Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897913078

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Designing programs that check their work

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73015 ◽

1989 ◽

Cited By ~ 152

Author(s):

M. Blum ◽

S. Kanna

Download Full-text

On the complexity of radio communication

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73033 ◽

1989 ◽

Cited By ~ 18

Author(s):

N. Alon ◽

A. Bar-Noy ◽

N. Linial ◽

D. Peleg

Keyword(s):

Radio Communication

Download Full-text

Trading space for time in undirected s-t connectivity

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73059 ◽

1989 ◽

Cited By ~ 20

Author(s):

A. Z. Broder ◽

A. R. Karlin ◽

P. Raghavan ◽

E. Upfal

Download Full-text

Compact distributed data structures for adaptive routing

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73053 ◽

1989 ◽

Cited By ~ 46

Author(s):

B. Awerbuch ◽

A. Bar-Noy ◽

N. Linial ◽

D. Peleg

Keyword(s):

Data Structures ◽

Adaptive Routing ◽

Distributed Data ◽

Distributed Data Structures

Download Full-text

The ismorphism conjecture fails relative to a random oracle

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73022 ◽

1989 ◽

Cited By ~ 22

Author(s):

S. A. Kurtz ◽

S. R. Mahaney ◽

J. S. Royer

Keyword(s):

Random Oracle

Download Full-text

Probabilistic computation and linear time

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73021 ◽

1989 ◽

Cited By ~ 10

Author(s):

L. Fortnow ◽

M. Sipser

Keyword(s):

Linear Time ◽

Probabilistic Computation

Download Full-text

Expressiveness of restricted recursive queries

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73018 ◽

1989 ◽

Cited By ~ 21

Author(s):

F. Afrati ◽

S. S. Cosmadakis

Download Full-text

Expanding graphs and the average-case analysis of algorithms for matchings and related problems

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73060 ◽

1989 ◽

Cited By ~ 6

Author(s):

R. Motwani

Keyword(s):

Analysis Of Algorithms ◽

Case Analysis ◽

Average Case Analysis ◽

Average Case ◽

Expanding Graphs

Download Full-text

Implicit O(1) probe search

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73039 ◽

1989 ◽

Cited By ~ 6

Author(s):

A. Fiat ◽

M. Noar

Download Full-text

On search decision and the efficiency of polynomial-time algorithms

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 ◽

10.1145/73007.73055 ◽

1989 ◽

Cited By ~ 39

Author(s):

M. R. Fellows ◽

M. A. Langston

Keyword(s):

Polynomial Time ◽

Polynomial Time Algorithms

Download Full-text

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Designing programs that check their work

On the complexity of radio communication

Trading space for time in undirected s-t connectivity

Compact distributed data structures for adaptive routing

The ismorphism conjecture fails relative to a random oracle

Probabilistic computation and linear time

Expressiveness of restricted recursive queries

Expanding graphs and the average-case analysis of algorithms for matchings and related problems

Implicit O(1) probe search

On search decision and the efficiency of polynomial-time algorithms

Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89
Latest Publications