Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897911512

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Finding the median requires 2n comparisons

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22169 ◽

1985 ◽

Cited By ~ 20

Author(s):

S W Bent ◽

J W John

Download Full-text

The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22190 ◽

1985 ◽

Cited By ~ 6

Author(s):

D T Huynh

Keyword(s):

Equivalence Problem ◽

Commutative Semigroups ◽

Vector Addition

Download Full-text

A linear algorithm for finding dominators in flow graphs and related problems

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22166 ◽

1985 ◽

Cited By ~ 34

Author(s):

D Harel

Keyword(s):

Linear Algorithm ◽

Flow Graphs

Download Full-text

The two-processor scheduling problem is in R-NC

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22147 ◽

1985 ◽

Cited By ~ 9

Author(s):

U Vazirani ◽

V V Vazirani

Keyword(s):

Scheduling Problem ◽

Processor Scheduling

Download Full-text

The cryptographic security of truncated linearly related variables

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22184 ◽

1985 ◽

Cited By ~ 22

Author(s):

J Hastad ◽

A Shamir

Keyword(s):

Cryptographic Security

Download Full-text

A simple three-dimensional real-time cellular array

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22188 ◽

1985 ◽

Author(s):

P Gács ◽

J Reif

Keyword(s):

Real Time ◽

Three Dimensional ◽

Cellular Array

Download Full-text

The polynomial hierarchy and fragments of bounded arithmetic

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22177 ◽

1985 ◽

Cited By ~ 4

Author(s):

S R Buss

Keyword(s):

Polynomial Hierarchy ◽

Bounded Arithmetic

Download Full-text

One-way functions and pseudorandom generators

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22185 ◽

1985 ◽

Cited By ~ 37

Author(s):

L A Levin

Keyword(s):

Pseudorandom Generators

Download Full-text

Algorithms for routing and testing routability of planar VLSI layouts

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22153 ◽

1985 ◽

Cited By ~ 46

Author(s):

C E Leiserson ◽

F M Maley

Download Full-text

Fault tolerance of minimal path routings in a network

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85 ◽

10.1145/22145.22181 ◽

1985 ◽

Cited By ~ 9

Author(s):

P Feldman

Keyword(s):

Fault Tolerance ◽

Minimal Path

Download Full-text

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Finding the median requires 2n comparisons

The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems

A linear algorithm for finding dominators in flow graphs and related problems

The two-processor scheduling problem is in R-NC

The cryptographic security of truncated linearly related variables

A simple three-dimensional real-time cellular array

The polynomial hierarchy and fragments of bounded arithmetic

One-way functions and pseudorandom generators

Algorithms for routing and testing routability of planar VLSI layouts

Fault tolerance of minimal path routings in a network

Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85
Latest Publications