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

TOTAL DOCUMENTS

54

(FIVE YEARS 0)

H-INDEX

23

(FIVE YEARS 0)

Published By ACM Press

0897910990

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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 ◽

Author(s):

Greg N. Frederickson

Keyword(s):

Data Structures ◽

Spanning Trees ◽

Minimum Spanning Trees ◽

Download Full-text

Languages which capture complexity classes

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

10.1145/800061.808765 ◽

1983 ◽

Author(s):

Neil Immerman

Keyword(s):

Complexity Classes

Download Full-text

New bounds for parallel prefix circuits

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

10.1145/800061.808738 ◽

1983 ◽

Author(s):

Faith E. Fich

Keyword(s):

Parallel Prefix ◽

Prefix Circuits

Download Full-text

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 ◽

Author(s):

John H. Reif ◽

Leslie G. Valiant

Keyword(s):

Download Full-text

How to exchange (secret) keys

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

10.1145/800061.808775 ◽

1983 ◽

Author(s):

Manuel Blum

Keyword(s):

Download Full-text

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 ◽

Author(s):

L. G. Valiant

Keyword(s):

Lower Bounds ◽

Monotone Circuits

Download Full-text

Self-adjusting binary trees

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

10.1145/800061.808752 ◽

1983 ◽

Author(s):

Daniel Dominic Sleator ◽

Robert Endre Tarjan

Keyword(s):

Download Full-text

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 ◽

Author(s):

Leonard M. Adleman

Keyword(s):

Public Key Cryptosystems

Download Full-text

Topological matching

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

10.1145/800061.808729 ◽

1983 ◽

Author(s):

Quentin F. Stout

Download Full-text

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 ◽

Author(s):

Paris C. Kanellakis ◽

Stavros S. Cosmadakis ◽

Moshe Y. Vardi

Keyword(s):

Polynomial Time ◽

Inference Problems

Download Full-text