Publications
Publications
Referenzen
181.
M. Karpinski und W. Schudy
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems
Proceedings of the 41st ACM Symposium on Theory of Computing (STOC) , Seite 626--636.
2009
180.
Travis Gagie, Marek Karpinski und Yakov Nekrich
Low-Memory Adaptive Prefix Coding
Proceeding of the 19th Data Compression Conference (DCC) , Seite 13--22.
Herausgeber: IEEE Computer Society,
2009
179.
Gábor Ivanyos, Marek Karpinski und Nitin Saxena
Schemes for deterministic polynomial factoring
ISSAC 2009---Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation , Seite 191--198.
Herausgeber: ACM, New York,
2009
178.
Magnus Bordewich, Martin Dyer und Marek Karpinski
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures Algorithms, 32(3):375--399
2008
177.
Marek Karpinski und Yakov Nekrich
Searching for Frequent Colors in Rectangles
Proceedings of the 20th Annual Canadian Conference on Computational Geometry (CCCG) , Seite 11--14.
2008
176.
Wenceslas Fernandez de la Vega und Marek Karpinski
1.0957-approximation algorithm for random MAX-3SAT
RAIRO Oper. Res., 41(1):95--103
2007
175.
P. Berman, M. Karpinski und Y. Nekrich
Approximating Huffman codes in parallel
J. Discrete Algorithms, 5(3):479--490
2007
174.
Piotr Berman, Marek Karpinski und Alexander D. Scott
Computational complexity of some restricted instances of 3-SAT
Discrete Appl. Math., 155(5):649--653
2007
173.
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Marek Karpinski, Christian Knauer und Andrzej Lingas
Embedding point sets into plane graphs of small dilation
Internat. J. Comput. Geom. Appl., 17(3):201--230
2007
172.
Piotr Berman, Marek Karpinski und Yakov Nekrich
Optimal trade-off for Merkle tree traversal
Theoret. Comput. Sci., 372(1):26--36
2007
171.
Marek Karpinski und Yakov Nekrich
Algorithms for construction of optimal and almost-optimal length-restricted codes
Parallel Process. Lett., 16(1):81--92
2006
170.
Wenceslas Fernandez de la Vega und Marek Karpinski
Approximation Complexity of Nondense Instances of MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 13(101)
2006
Seite:  
Previous | Publications, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next
Export als:
BibTeX, XML