Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897912217

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Testing for cycles in infinite graphs with periodic structure

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28401 ◽

1987 ◽

Cited By ~ 15

Author(s):

K. Iwano ◽

K. Steiglitz

Keyword(s):

Periodic Structure ◽

Infinite Graphs

Download Full-text

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28421 ◽

1987 ◽

Cited By ~ 138

Author(s):

B. Awerbuch

Keyword(s):

Distributed Algorithms ◽

Spanning Tree ◽

Minimum Weight ◽

Leader Election ◽

Minimum Weight Spanning Tree

Download Full-text

The decision problem for the probabilities of higher-order properties

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28441 ◽

1987 ◽

Cited By ~ 39

Author(s):

P. Kolaitis ◽

M. Vardi

Keyword(s):

Decision Problem ◽

Higher Order

Download Full-text

The power of randomness for communication complexity

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28415 ◽

1987 ◽

Cited By ~ 11

Author(s):

M. Furer

Keyword(s):

Communication Complexity

Download Full-text

Permutation groups in NC

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28439 ◽

1987 ◽

Cited By ~ 30

Author(s):

L. Babai ◽

E. Luks ◽

A. Seress

Keyword(s):

Permutation Groups

Download Full-text

A random NC algorithm for depth first search

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28430 ◽

1987 ◽

Cited By ~ 19

Author(s):

A. Aggarwal ◽

R. Anderson

Keyword(s):

Depth First Search

Download Full-text

On learning Boolean functions

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28427 ◽

1987 ◽

Cited By ~ 69

Author(s):

B. K. Natarajan

Keyword(s):

Boolean Functions ◽

Learning Boolean Functions

Download Full-text

Some consequences of the existence of pseudorandom generators

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28412 ◽

1987 ◽

Cited By ~ 11

Author(s):

E. Allender

Keyword(s):

Pseudorandom Generators

Download Full-text

The page number of genus g graphs is (g)

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28437 ◽

1987 ◽

Cited By ~ 2

Author(s):

L. Heath ◽

S. Istrail

Keyword(s):

Page Number

Download Full-text

Towards a theory of software protection and simulation by oblivious RAMs

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 ◽

10.1145/28395.28416 ◽

1987 ◽

Cited By ~ 169

Author(s):

O. Goldreich

Keyword(s):

Software Protection

Download Full-text

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Testing for cycles in infinite graphs with periodic structure

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

The decision problem for the probabilities of higher-order properties

The power of randomness for communication complexity

Permutation groups in NC

A random NC algorithm for depth first search

On learning Boolean functions

Some consequences of the existence of pseudorandom generators

The page number of genus g graphs is (g)

Towards a theory of software protection and simulation by oblivious RAMs

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87
Latest Publications