On Parallel Hashing and Integer Sorting (1991)

Cached

Download Links

by Yossi Matias , Uzi Vishkin
Citations:25 - 9 self

Active Bibliography

11 Structural Parallel Algorithmics – Uzi Vishkin - 1991
1 Randomized Parallel Computation – Sanguthevar Rajasekaran, John H. Reif
189 The NP-completeness column: an ongoing guide – David S. Johnson - 1985
193 Programming Parallel Algorithms – Guy E. Blelloch - 1996
7 Thinking in parallel: Some basic data-parallel algorithms and techniques – Uzi Vishkin - 1993
9 Computational Complexity – Oded Goldreich, Avi Wigderson - 2004
70 Computational Complexity: A Conceptual Perspective – Oded Goldreich - 2006
14 Simulation of PRAM Models on Meshes – Ville Leppänen, Martti Penttonen - 1994
29 Parallel Algorithmic Techniques for Combinatorial Computation – David Eppstein, Zvi Galil - 1988
5 Fast modular algorithms for squarefree factorization and Hermite integration – Jürgen Gerhard - 1999
58 Models of Computation -- Exploring the Power of Computing – John E. Savage
26 Parallel Sorting With Limited Bandwidth – Micah Adler, John W Byers, Richard M Karp - 1995
26 On Universal Classes of Extremely Random Constant Time Hash Functions and Their Time-Space Tradeoff – Alan Siegel
Modern Primality Tests and the Agrawal-Kayal-Saxena Algorithm – Jason Wojciechowski - 2003
6 Towards a deterministic polynomial-time Primality Test – Neeraj Kayal, Nitin Saxena, Supervisor Dr. Manindra Agarwal - 2002
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
7 Automorphisms of Finite Rings and Applications to Complexity of Problems – Manindra Agrawal, Nitin Saxena - 2005
69 Almost All Primes Can be Quickly Certified – Shafi Goldwasser, Joe Kilian
26 PRIMES is in P – Manindra Agrawal, Neeraj Kayal, Nitin Saxena - 2002