Publications
Publications
Referenzen
145.
Noga Alon, W. Fernandez de la Vega, Ravi Kannan und Marek Karpinski
Random sampling and approximation of MAX-CSPs
Band 67
Seite 212--243.
2003
144.
W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon und Yuval Rabani
Approximation schemes for clustering problems
Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing , Seite 50--58.
Herausgeber: ACM, New York,
2003
143.
Wenceslas Fernandez de la Vega und Marek Karpinski
9/8-Approximation Algorithm for Random MAX-3SAT
Electronic Colloquium on Computational Complexity (ECCC), 9(070)
2002
142.
Wenceslas Fernandez de la Vega, Marek Karpinski und Claire Kenyon
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
Electronic Colloquium on Computational Complexity (ECCC), 9(041)
2002
141.
Wenceslas Fernandez de la Vega und Marek Karpinski
A Polynomial Time Approximation Scheme for Subdense MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC), 9(044)
2002
140.
Uriel Feige, Marek Karpinski und Michael Langberg
Improved approximation of Max-Cut on graphs of bounded degree
J. Algorithms, 43(2):201--219
2002
139.
R&#363si\cns Freivalds, Marek Karpinski, Carl H. Smith und Rolf Wiehagen
Learning by the process of elimination
Inform. and Comput., 176(1):37--50
2002
138.
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski und Wojciech Rytter
On the complexity of pattern matching for highly compressed two-dimensional texts
J. Comput. System Sci., 65(2):332--350
2002
137.
Marek Karpinski und Yakov Nekrich
Parallel Construction of Minimum Redundancy Length-Limited Codes
Electronic Colloquium on Computational Complexity (ECCC), 9(029)
2002
136.
Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon und Yuval Rabani
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Electronic Colloquium on Computational Complexity (ECCC), 9(025)
2002
135.
Susanne Albers und Marek Karpinski
Randomized splay trees: theoretical and experimental results
Inform. Process. Lett., 81(4):213--221
2002
134.
Piotr Berman, Sridhar Hannenhalli und Marek Karpinski
1.375-approximation algorithm for sorting by reversals
Algorithms---ESA 2002 Band 2461 aus Lecture Notes in Comput. Sci.
Seite 200--210.
Herausgeber: Springer, Berlin,
2002
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