Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

1581134959

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fast, small-space algorithms for approximate histogram maintenance

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509966 ◽

2002 ◽

Cited By ~ 84

Author(s):

Anna C. Gilbert ◽

Sudipto Guha ◽

Piotr Indyk ◽

Yannis Kotidis ◽

S. Muthukrishnan ◽

...

Keyword(s):

Small Space

Download Full-text

Stability of load balancing algorithms in dynamic adversarial systems

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509968 ◽

2002 ◽

Cited By ~ 14

Author(s):

Elliot Anshelevich ◽

David Kempe ◽

Jon Kleinberg

Keyword(s):

Load Balancing

Download Full-text

Hard examples for bounded depth frege

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509988 ◽

2002 ◽

Cited By ~ 4

Author(s):

Eli Ben-Sasson

Download Full-text

3-manifold knot genus is NP-complete

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.510016 ◽

2002 ◽

Cited By ~ 2

Author(s):

Ian Agol ◽

Joel Hass ◽

William Thurston

Keyword(s):

Np Complete

Download Full-text

Algorithmic derandomization via complexity theory

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509996 ◽

2002 ◽

Cited By ~ 17

Author(s):

D. Sivakumar

Keyword(s):

Complexity Theory

Download Full-text

An exponential separation between regular and general resolution

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509974 ◽

2002 ◽

Cited By ~ 7

Author(s):

Michael Alekhnovich ◽

Jan Johannsen ◽

Toniann Pitassi ◽

Alasdair Urquhart

Keyword(s):

Exponential Separation

Download Full-text

Competitive generalized auctions

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509921 ◽

2002 ◽

Cited By ~ 40

Author(s):

Amos Fiat ◽

Andrew V. Goldberg ◽

Jason D. Hartline ◽

Anna R. Karlin

Download Full-text

Approximation schemes for preemptive weighted flow time

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509954 ◽

2002 ◽

Cited By ~ 12

Author(s):

Chandra Chekuri ◽

Sanjeev Khanna

Keyword(s):

Flow Time ◽

Approximation Schemes

Download Full-text

On paging with locality of reference

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509949 ◽

2002 ◽

Cited By ~ 4

Author(s):

Susanne Albers ◽

Lene M. Favrholdt ◽

Oliver Giel

Download Full-text

Verifying candidate matches in sparse and wildcard matching

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02 ◽

10.1145/509907.509992 ◽

2002 ◽

Cited By ~ 48

Author(s):

Richard Cole ◽

Ramesh Hariharan

Download Full-text

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Fast, small-space algorithms for approximate histogram maintenance

Stability of load balancing algorithms in dynamic adversarial systems

Hard examples for bounded depth frege

3-manifold knot genus is NP-complete

Algorithmic derandomization via complexity theory

An exponential separation between regular and general resolution

Competitive generalized auctions

Approximation schemes for preemptive weighted flow time

On paging with locality of reference

Verifying candidate matches in sparse and wildcard matching

Proceedings of the thiry-fourth annual ACM symposium on Theory of computing - STOC '02
Latest Publications