Karpiński, Marek (1948- )
Karpiński, Marek
Karpiński, Marek (1948- ; informatyka).
Marek Karpiński polski matematyk i informatyk
VIAF ID: 167681 ( Personal )
Permalink: http://viaf.org/viaf/167681
Preferred Forms
- 100 1 _ ‡a Karpinski, Marek ‡d 1948-...
-
- 100 1 _ ‡a Karpinski, Marek, ‡d 1948-....
-
- 200 _ | ‡a Karpiński ‡b Marek ‡f 1948-....
-
- 100 1 _ ‡a Karpiński, Marek ‡d 1948-
-
-
-
- 100 1 _ ‡a Karpiński, Marek, ‡d 1948-
-
- 100 1 _ ‡a Karpiński, Marek
-
-
- 100 0 _ ‡a Marek Karpiński ‡c polski matematyk i informatyk
4xx's: Alternate Name Forms (8)
5xx's: Related Names (3)
- 510 2 _ ‡a Institut für Informatik
- 510 2 _ ‡a Polska Akademia Nauk. Instytut Podstaw Informatyki
- 510 2 _ ‡a Rheinische Friedrich-Wilhelms-Universität Bonn ‡b Institut für Informatik ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
Works
Title | Sources |
---|---|
Akcja ratunkowa | |
Alphabet independent optimal parallel search for three-dimensional patterns | |
Approximation hardness of TSP with bounded metrics | |
Aristocats | |
Aryskotraci | |
Barbie loves her sisters | |
Cip, kurko, cip! | |
computational complexity of graph problems with succinct multigraph representation | |
Correctness of constructing optimal alphabetic trees revisited | |
Day with the pet doctor | |
Decidability results on plane automata searching mazes | |
Dinozaur | |
Dwa serca | |
Dzień w lecznicy zwierząt | |
Equivalence resulte on probabilistic tree languages | |
Fast parallel algorithms for graph matching problems | |
Foundations of computation theory / ed. by Marek Karpinski. - Berlin, 1983. | |
Foundations of computation theory : proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983 | |
Hau, piesku, hau! | |
Kanga's Café | |
Kawiarenka kangurzycy | |
Kiara i Kovu | |
Królewna Śnieżka i siedmiu krasnoludków | |
Kwa, kaczuszko, kwa! | |
Mulan | |
Na plaży | |
Na wsi. | |
Najstarszy zawód świata : historia prostytucji | |
New inapproximability bounds for TSP | |
Niedźwiedzie | |
note on on-line load balancing for related machines | |
NP-hardness of the bandwidth problem on dense graphs | |
On a new high dimensional Weisfeiler-Lehmann algorithm | |
On a sublinear time parallel construction of optimal binary search trees | |
On some tighter inapproximability results | |
On the computational hardness of testing square freeness of sparse polynomials | |
On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes | |
On the power of two way random generators and the impossibility of deterministic poly-space simulation | |
On the sample complexity of MAX-CUT | |
One.375-approximation algorithm for sorting by reversals | |
Optimal cuts and bisections on the real line polynomial time | |
Piszcz, myszko, piszcz! | |
Pocahontas | |
Polynomial time approximation schemes for some dense instances of NP-hard optimization problems | |
Pracowity smok | |
Predecessor queries in constant time? | |
Probabilistic [NC-circuits] equal probabilistic polynomial time | |
Proceedings of the Workshop on Algorithms, Complexity & Mazes, September 12-15, 1979 | |
Przedstawiam wam... | |
Przekroczyć granice | |
Przygoda w dżungli | |
Puchatek i smok | |
Puchatek szuka miodu | |
Pumpa runs away from home | |
Puppy rescue | |
Raz, dwa, trzy, szukasz ty! | |
Requefort to the rescue | |
Restricted principles of computing processes (PCP) and equations in free semigroups informal workshop, May 27, 1980 | |
Schemes for deterministic polynomial factoring | |
Searching for frequent colors in rectangles | |
Stopping times, metric and approximate counting | |
The structural equivalence problem for EOL-systems is recursively solvable / Marek Karpiński. - Warszawa, 1977. | |
Subclasses of quantified Boolean formulas | |
Świadek stulecia | |
Tarzan | |
Tęczowe kolory | |
Tigger movie | |
Totally cool nail party | |
Toy Story | |
Trading tensors for cloning constant time approximation schemes for metric MAX-CSP | |
Traktor i maszyna do malowania | |
Trening młodego Herkulesa | |
Two hearts | |
Tygrys i przyjaciele | |
Ucieczka Walca-lunatyka | |
The ultimate equivalence of iterated homomorphisms is recursively unsolvable | |
Very best easter bunny | |
W gabinecie Sowy ; Przeprowadzka Tygrysa | |
W sklepie z zabawkami : znajdź różnice : [zagadki obrazkowe] | |
Wielki konkurs | |
Wiosna | |
Wspomnienia | |
Zabawki małego Herkulesa | |
Zasadzka na Robin Hooda | |
Zima | |
Zwierzęta z podwórka. |