Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Polynomial time approximation schemes for dense instances of NP-hard problems., , and . STOC, page 284-293. ACM, (1995)On real Turing machines that toss coins., , , , and . STOC, page 335-342. ACM, (1995)A Lower Bound for Randomized Algebraic Decision Trees., , , and . STOC, page 612-619. ACM, (1996)Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract)., , , and . CPM, volume 1075 of Lecture Notes in Computer Science, page 39-49. Springer, (1996)A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2., , and . ISAAC (1), volume 6506 of Lecture Notes in Computer Science, page 15-24. Springer, (2010)Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies.. FCT, volume 9210 of Lecture Notes in Computer Science, page 3-11. Springer, (2015)Approximating Huffman Codes in Parallel., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 845-855. Springer, (2002)The Equivalences Problems for Binary EOL-Systems are Decidable.. FCT, volume 56 of Lecture Notes in Computer Science, page 423-434. Springer, (1977)Polynomial Interpolation and Identity Testing from High Powers Over Finite Fields., , , , and . Algorithmica, 80 (2): 560-575 (2018)Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems., , and . SODA, page 74-83. ACM/SIAM, (2002)