Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897910990

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Languages which capture complexity classes

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808765 ◽

1983 ◽

Cited By ~ 28

Author(s):

Neil Immerman

Keyword(s):

Complexity Classes

New bounds for parallel prefix circuits

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808738 ◽

1983 ◽

Cited By ~ 39

Author(s):

Faith E. Fich

Keyword(s):

Parallel Prefix ◽

Prefix Circuits

Data structures for on-line updating of minimum spanning trees

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808754 ◽

1983 ◽

Cited By ~ 14

Author(s):

Greg N. Frederickson

Keyword(s):

Data Structures ◽

Spanning Trees ◽

Minimum Spanning Trees ◽

On Line

A logarithmic time sort for linear size networks

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808727 ◽

1983 ◽

Cited By ~ 22

Author(s):

John H. Reif ◽

Leslie G. Valiant

Keyword(s):

Linear Size

How to exchange (secret) keys

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808775 ◽

1983 ◽

Cited By ~ 14

Author(s):

Manuel Blum

Keyword(s):

Secret Keys

Exponential lower bounds for restricted monotone circuits

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808739 ◽

1983 ◽

Cited By ~ 15

Author(s):

L. G. Valiant

Keyword(s):

Lower Bounds ◽

Monotone Circuits

Self-adjusting binary trees

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808752 ◽

1983 ◽

Cited By ~ 37

Author(s):

Daniel Dominic Sleator ◽

Robert Endre Tarjan

Keyword(s):

Binary Trees

On breaking generalized knapsack public key cryptosystems

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808771 ◽

1983 ◽

Cited By ~ 23

Author(s):

Leonard M. Adleman

Keyword(s):

Public Key ◽

Public Key Cryptosystems

Topological matching

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808729 ◽

1983 ◽

Cited By ~ 24

Author(s):

Quentin F. Stout

Unary inclusion dependencies have polynomial time inference problems

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 ◽

10.1145/800061.808756 ◽

1983 ◽

Cited By ~ 16

Author(s):

Paris C. Kanellakis ◽

Stavros S. Cosmadakis ◽

Moshe Y. Vardi

Keyword(s):

Polynomial Time ◽

Inference Problems

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Languages which capture complexity classes

New bounds for parallel prefix circuits

Data structures for on-line updating of minimum spanning trees

A logarithmic time sort for linear size networks

How to exchange (secret) keys

Exponential lower bounds for restricted monotone circuits

Self-adjusting binary trees

On breaking generalized knapsack public key cryptosystems

Topological matching

Unary inclusion dependencies have polynomial time inference problems

Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
Latest Publications