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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581131844

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Cited By ~ 182

Author(s):

Paul W. K. Rothemund ◽

Erik Winfree

Keyword(s):

Self Assembled

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 ◽

Cited By ~ 20

Author(s):

Lisa Fleischer ◽

Satoru Iwata

Keyword(s):

Submodular Function ◽

Function Minimization ◽

Submodular Flow ◽

Submodular Function Minimization

Download Full-text

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 ◽

Cited By ~ 34

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 ◽

Cited By ~ 14

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 ◽

Cited By ~ 11

Author(s):

Janos Csirik ◽

David S. Johnson ◽

Claire Kenyon ◽

James B. Orlin ◽

Peter W. Shor ◽

...

Keyword(s):

Bin Packing ◽

Sum Of Squares

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 ◽

Cited By ~ 47

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 ◽

Cited By ~ 15

Author(s):

Danny Harnik ◽

Ran Raz

Keyword(s):

Lower Bounds

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 ◽

Cited By ~ 2

Author(s):

Salil Vadhan

Keyword(s):

Interactive Proofs

Download Full-text

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

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

10.1145/335305.335309 ◽

2000 ◽

Cited By ~ 28

Author(s):

Dimitris Achlioptas

Keyword(s):

Lower Bound

Download Full-text

Clustering for edge-cost minimization (extended abstract)

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

10.1145/335305.335373 ◽

2000 ◽

Cited By ~ 23

Author(s):

Leonard J. Schulman

Keyword(s):

Cost Minimization ◽

Edge Cost

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

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

Improved algorithms for submodular function minimization and submodular flow

Approximation algorithms for geometric shortest path problems

Are bitvectors optimal?

On the sum-of-squares algorithm for bin packing

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

Higher lower bounds on monotone size

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

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)

Clustering for edge-cost minimization (extended abstract)

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