Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897915119

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The history and status of the P versus NP question

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129771 ◽

1992 ◽

Cited By ~ 26

Author(s):

Michael Sipser

Download Full-text

New algorithms for an ancient scheduling problem

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129718 ◽

1992 ◽

Cited By ~ 33

Author(s):

Yair Bartal ◽

Amos Fiat ◽

Howard Karloff ◽

Rakesh Vohra

Keyword(s):

Scheduling Problem ◽

New Algorithms

Download Full-text

Self-stabilizing symmetry breaking in constant-space (extended abstract)

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129777 ◽

1992 ◽

Cited By ~ 17

Author(s):

Alain Mayer ◽

Yoram Ofek ◽

Rafail Ostrovsky ◽

Moti Yung

Keyword(s):

Symmetry Breaking

Download Full-text

Existence and construction of edge disjoint paths on expander graphs

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129727 ◽

1992 ◽

Cited By ~ 2

Author(s):

Andrei Z. Broder ◽

Alan M. Frieze ◽

Eli Upfal

Keyword(s):

Disjoint Paths ◽

Expander Graphs ◽

Edge Disjoint

Download Full-text

Fault tolerant planar communication networks

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129726 ◽

1992 ◽

Cited By ~ 2

Author(s):

Geng Lin

Keyword(s):

Communication Networks ◽

Fault Tolerant

Download Full-text

On the complexity of RAM with various operation sets

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129773 ◽

1992 ◽

Cited By ~ 2

Author(s):

Janos Simon ◽

Mario Szegedy

Download Full-text

Ray shooting and parametric search

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129763 ◽

1992 ◽

Cited By ~ 21

Author(s):

Pankaj K. Agarwal ◽

Jiří Matoušek

Keyword(s):

Ray Shooting ◽

Parametric Search

Download Full-text

Entropy and sorting

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129731 ◽

1992 ◽

Cited By ~ 11

Author(s):

Jeff Kahn ◽

Jeong Han Kim

Download Full-text

Faster algorithms for finding small edge cuts in planar graphs

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129735 ◽

1992 ◽

Cited By ~ 11

Author(s):

Satish B. Rao

Keyword(s):

Planar Graphs

Download Full-text

Fast learning of k-term DNF formulas with queries

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 ◽

10.1145/129712.129748 ◽

1992 ◽

Cited By ~ 15

Author(s):

Avrim Blum ◽

Steven Rudich

Keyword(s):

Dnf Formulas ◽

Fast Learning

Download Full-text

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

The history and status of the P versus NP question

New algorithms for an ancient scheduling problem

Self-stabilizing symmetry breaking in constant-space (extended abstract)

Existence and construction of edge disjoint paths on expander graphs

Fault tolerant planar communication networks

On the complexity of RAM with various operation sets

Ray shooting and parametric search

Entropy and sorting

Faster algorithms for finding small edge cuts in planar graphs

Fast learning of k-term DNF formulas with queries

Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92
Latest Publications