Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897918886

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Retraction of probabilistic computation and linear time

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258677 ◽

1997 ◽

Cited By ~ 4

Author(s):

Lance Fortnow ◽

Michael Sipser

Keyword(s):

Linear Time ◽

Probabilistic Computation

Reducing the complexity of reductions

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258671 ◽

1997 ◽

Cited By ~ 7

Author(s):

Manindra Agrawal ◽

Eric Allender ◽

Russell Impagliazzo ◽

Toniann Pitassi ◽

Steven Rudich

Probabilistically checkable proofs with zero knowledge

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258643 ◽

1997 ◽

Cited By ~ 17

Author(s):

Joe Kilian ◽

Erez Petrank ◽

Gábor Tardos

Keyword(s):

Zero Knowledge ◽

Probabilistically Checkable Proofs

Better bounds for online scheduling

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258566 ◽

1997 ◽

Cited By ~ 36

Author(s):

Susanne Albers

Keyword(s):

Online Scheduling

All of us are smarter than any of us

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258651 ◽

1997 ◽

Cited By ~ 5

Author(s):

Wai-Kau Lo ◽

Vassos Hadzilacos

Sampling lattice points

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258665 ◽

1997 ◽

Cited By ~ 6

Author(s):

Ravi Kannan ◽

Santosh Vempala

Keyword(s):

Lattice Points

A composition theorem for learning algorithms with applications to geometric concept classes

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258614 ◽

1997 ◽

Cited By ~ 7

Author(s):

Shai Ben-David ◽

Nader H. Bshouty ◽

Eyal Kushilevitz

Keyword(s):

Learning Algorithms ◽

Concept Classes ◽

Composition Theorem

Some optimal inapproximability results

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258536 ◽

1997 ◽

Cited By ~ 181

Author(s):

Johan Håstad

Static and dynamic path selection on expander graphs (preliminary version)

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258646 ◽

1997 ◽

Cited By ~ 3

Author(s):

Andrei Z. Broder ◽

Alan M. Frieze ◽

Eli Upfal

Keyword(s):

Path Selection ◽

Expander Graphs ◽

Preliminary Version ◽

Dynamic Path

Commodity-based cryptography (extended abstract)

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 ◽

10.1145/258533.258637 ◽

1997 ◽

Cited By ~ 48

Author(s):

Donald Beaver

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Retraction of probabilistic computation and linear time

Reducing the complexity of reductions

Probabilistically checkable proofs with zero knowledge

Better bounds for online scheduling

All of us are smarter than any of us

Sampling lattice points

A composition theorem for learning algorithms with applications to geometric concept classes

Some optimal inapproximability results

Static and dynamic path selection on expander graphs (preliminary version)

Commodity-based cryptography (extended abstract)

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97
Latest Publications