Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00
Latest Publications

TOTAL DOCUMENTS

85

(FIVE YEARS 0)

H-INDEX

26

(FIVE YEARS 0)

Published By ACM Press

1581131844

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation algorithms for geometric shortest path problems

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335339 ◽

2000 ◽

Author(s):

Lyudmil Aleksandrov ◽

Anil Maheshwari ◽

Jörg-Rüdiger Sack

Keyword(s):

Approximation Algorithms ◽

Shortest Path ◽

Shortest Path Problems

Download Full-text

Are bitvectors optimal?

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335357 ◽

2000 ◽

Author(s):

H. Buhrman ◽

P. B. Miltersen ◽

J. Radhakrishnan ◽

S. Venkatesh

Download Full-text

On the sum-of-squares algorithm for bin packing

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335331 ◽

2000 ◽

Author(s):

Janos Csirik ◽

David S. Johnson ◽

Claire Kenyon ◽

James B. Orlin ◽

Peter W. Shor ◽

...

Keyword(s):

Bin Packing ◽

Download Full-text

The program-size complexity of self-assembled squares (extended abstract)

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335358 ◽

2000 ◽

Author(s):

Paul W. K. Rothemund ◽

Erik Winfree

Keyword(s):

Download Full-text

Improved algorithms for submodular function minimization and submodular flow

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335318 ◽

2000 ◽

Author(s):

Lisa Fleischer ◽

Satoru Iwata

Keyword(s):

Submodular Function ◽

Function Minimization ◽

Submodular Flow ◽

Submodular Function Minimization

Download Full-text

More general completeness theorems for secure two-party computation

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335342 ◽

2000 ◽

Author(s):

Joe Kilian

Keyword(s):

Completeness Theorems

Download Full-text

Approximating the minimum bisection size (extended abstract)

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335370 ◽

2000 ◽

Author(s):

Uriel Feige ◽

Robert Krauthgamer ◽

Kobbi Nissim

Download Full-text

Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335387 ◽

2000 ◽

Author(s):

Alexei Kitaev ◽

John Watrous

Keyword(s):

Interactive Proof ◽

Exponential Time ◽

Interactive Proof Systems ◽

Proof Systems ◽

Time Simulation

Download Full-text

Higher lower bounds on monotone size

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335349 ◽

2000 ◽

Author(s):

Danny Harnik ◽

Ran Raz

Keyword(s):

Download Full-text

On transformation of interactive proofs that preserve the prover's complexity

Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC '00 ◽

10.1145/335305.335330 ◽

2000 ◽

Author(s):

Salil Vadhan

Keyword(s):

Interactive Proofs

Download Full-text