Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897913612

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Efficient computation on oblivious RAMs

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100289 ◽

1990 ◽

Cited By ~ 96

Author(s):

R. Ostrovsky

Keyword(s):

Efficient Computation

Searching for primitive roots in finite fields

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100293 ◽

1990 ◽

Cited By ~ 8

Author(s):

V. Shoup

Keyword(s):

Finite Fields ◽

Primitive Roots

Approximate inclusion-exclusion

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100250 ◽

1990 ◽

Cited By ~ 3

Author(s):

N. Linial ◽

N. Nisan

Deterministic sorting in nearly logarithmic time on the hypercube and related computers

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100240 ◽

1990 ◽

Cited By ~ 49

Author(s):

R. Cypher ◽

C. G. Plaxton

On the decidability of sparse univariate polynomial interpolation

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100292 ◽

1990 ◽

Cited By ~ 7

Author(s):

A. Borodin ◽

P. Tiwari

Keyword(s):

Polynomial Interpolation ◽

Univariate Polynomial

The discrete log is very discreet

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100271 ◽

1990 ◽

Cited By ~ 19

Author(s):

A. W. Schrift ◽

A. Shamir

The number field sieve

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100295 ◽

1990 ◽

Cited By ~ 91

Author(s):

A. K. Lenstra ◽

H. W. Lenstra ◽

M. S. Manasse ◽

J. M. Pollard

Keyword(s):

Number Field ◽

Number Field Sieve

Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100237 ◽

1990 ◽

Cited By ~ 7

Author(s):

M.-Y. Kao ◽

P. N. Klein

Keyword(s):

Parallel Algorithms ◽

Transitive Closure

Online algorithms for locating checkpoints

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100264 ◽

1990 ◽

Cited By ~ 2

Author(s):

M. Bern ◽

D. H. Greene ◽

A. Raghunathan ◽

M. Sudan

Keyword(s):

Online Algorithms

Computing in quotient groups

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90 ◽

10.1145/100216.100290 ◽

1990 ◽

Cited By ~ 11

Author(s):

W. M. Kantor ◽

E. M. Luks

Keyword(s):

Quotient Groups

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

Efficient computation on oblivious RAMs

Searching for primitive roots in finite fields

Approximate inclusion-exclusion

Deterministic sorting in nearly logarithmic time on the hypercube and related computers

On the decidability of sparse univariate polynomial interpolation

The discrete log is very discreet

The number field sieve

Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs

Online algorithms for locating checkpoints

Computing in quotient groups

Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90
Latest Publications