Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897917189

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Tight analyses of two local load balancing algorithms

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225272 ◽

1995 ◽

Cited By ~ 15

Author(s):

Bhaskar Ghosh ◽

F. T. Leighton ◽

Bruce M. Maggs ◽

S. Muthukrishnan ◽

C. Greg Plaxton ◽

...

Keyword(s):

Load Balancing ◽

Local Load

Download Full-text

Geometric lower bounds for parametric matroid optimization

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225284 ◽

1995 ◽

Cited By ~ 5

Author(s):

David Eppstein

Keyword(s):

Lower Bounds ◽

Matroid Optimization

Download Full-text

Symmetric logspace is closed under complement

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225101 ◽

1995 ◽

Cited By ~ 15

Author(s):

Noam Nisan ◽

Amnon Ta-Shma

Download Full-text

The relative complexity of NP search problems

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225147 ◽

1995 ◽

Cited By ~ 14

Author(s):

Paul Beame ◽

Stephen Cook ◽

Jeff Edmonds ◽

Russell Impagliazzo ◽

Toniann Pitassi

Keyword(s):

Search Problems ◽

Relative Complexity

Download Full-text

Stochastic contention resolution with short delays

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225129 ◽

1995 ◽

Cited By ~ 10

Author(s):

Prabhakar Raghavan ◽

Eli Upfal

Keyword(s):

Contention Resolution

Download Full-text

Persistent lists with catenation via recursive slow-down

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225090 ◽

1995 ◽

Cited By ~ 16

Author(s):

Haim Kaplan ◽

Robert E. Tarjan

Download Full-text

A constant-factor approximation for the k-MST problem in the plane

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225143 ◽

1995 ◽

Cited By ~ 9

Author(s):

Avrim Blum ◽

Prasad Chalasani ◽

Santosh Vempala

Keyword(s):

Constant Factor

Download Full-text

String matching in Lempel-Ziv compressed strings

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225288 ◽

1995 ◽

Cited By ~ 54

Author(s):

Martin Farach ◽

Mikkel Thorup

Keyword(s):

String Matching

Download Full-text

A parallel repetition theorem

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225181 ◽

1995 ◽

Cited By ~ 29

Author(s):

Ran Raz

Keyword(s):

Parallel Repetition

Download Full-text

Bounding the power of preemption in randomized scheduling

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 ◽

10.1145/225058.225278 ◽

1995 ◽

Cited By ~ 6

Author(s):

Ran Canetti ◽

Sandy Irani

Download Full-text

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Tight analyses of two local load balancing algorithms

Geometric lower bounds for parametric matroid optimization

Symmetric logspace is closed under complement

The relative complexity of NP search problems

Stochastic contention resolution with short delays

Persistent lists with catenation via recursive slow-down

A constant-factor approximation for the k-MST problem in the plane

String matching in Lempel-Ziv compressed strings

A parallel repetition theorem

Bounding the power of preemption in randomized scheduling

Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95
Latest Publications