Publications
Publications
Referenzen
157.
Marek Karpinski und Yakov Nekrich
Predecessor queries in constant time?
Algorithms---ESA 2005 Band 3669 aus Lecture Notes in Comput. Sci.
Seite 238--248.
Herausgeber: Springer, Berlin,
2005
156.
W. Fernandez de la Vega, Ravi Kannan, Marek Karpinski und Santosh Vempala
Tensor decomposition and approximation schemes for constraint satisfaction problems
STOC'05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing , Seite 747--754.
Herausgeber: ACM, New York,
2005
155.
Marek Karpinski, Miroslaw Kowaluk und Andrzej Lingas
Approximation algorithms for MAX-BISECTION on low degree regular graphs
Fund. Inform., 62(3-4):369--375
2004
154.
Marek Karpinski, Lawrence Larmore und Yakov Nekrich
Work-efficient algorithms for the construction of length-limited Huffman codes
Parallel Process. Lett., 14(1):99--105
2004
153.
W. Fernandez de la Vega, Marek Karpinski und Claire Kenyon
Approximation schemes for metric bisection and partitioning
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms , Seite 506--515.
Herausgeber: ACM, New York,
2004
152.
Farid Ablayev und Marek Karpinski
A lower bound for integer multiplication on randomized ordered read-once branching programs
Inform. and Comput., 186(1):78--89
2003
151.
Piotr Berman und Marek Karpinski
Approximability of Hypergraph Minimum Bisection
Electronic Colloquium on Computational Complexity (ECCC), 10(056)
2003
150.
Piotr Berman, Marek Karpinski und Alex D. Scott
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
Electronic Colloquium on Computational Complexity (ECCC), 10(022)
2003
149.
Piotr Berman, Marek Karpinski und Alex D. Scott
Approximation Hardness of Short Symmetric Instances of MAX-3SAT
Electronic Colloquium on Computational Complexity (ECCC), 10(049)
2003
148.
Piotr Berman und Marek Karpinski
Improved Approximation Lower Bounds on Small Occurrence Optimization
Electronic Colloquium on Computational Complexity (ECCC), 10(008)
2003
147.
Cristina Bazgan, W. Fernandez de la Vega und Marek Karpinski
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures Algorithms, 23(1):73--91
2003
146.
Marek Karpinski, Ion I. M\uandoiu, Alexander Olshevsky und Alexander Zelikovsky
Improved approximation algorithms for the quality of service Steiner tree problem
Algorithms and data structures Band 2748 aus Lecture Notes in Comput. Sci.
Seite 401--411.
Herausgeber: Springer, Berlin,
2003
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