On Parallel Hashing and Integer Sorting

[1]  Uzi Vishkin,et al.  Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values , 1993, J. Algorithms.

[2]  Uzi Vishkin,et al.  A Parallel Blocking Flow Algorithm for Acyclic Networks , 1992, J. Algorithms.

[3]  Krishna V. Palem,et al.  Optimal Parallel Algorithms for Forest and Term Matching , 1992, Theor. Comput. Sci..

[4]  Krzysztof Diks,et al.  Improved Deterministic Parallel Integer Sorting , 1991, Inf. Comput..

[5]  Uzi Vishkin,et al.  On Parallel Hashing and Integer Sorting (Extended Summary) , 1990, ICALP.

[6]  Larry Rudolph,et al.  A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..

[7]  Richard Cole,et al.  Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..

[8]  Torben Hagerup,et al.  Parallel Retrieval of Scattered Information , 1989, ICALP.

[9]  Sanguthevar Rajasekaran,et al.  Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms , 1989, SIAM J. Comput..

[10]  Friedhelm Meyer auf der Heide,et al.  An optimal parallel dictionary , 1989, SPAA '89.

[11]  Ravi B. Boppana,et al.  Optimal separations between concurrent-write parallel machines , 1989, STOC '89.

[12]  Paul Beame,et al.  A general sequential time-space tradeoff for finding unique elements , 1989, STOC '89.

[13]  David Eppstein,et al.  Parallel Algorithmic Techniques for Combinatorial Computation , 1988, ICALP.

[14]  Torben Hagerup.  On Saving Space in Parallel Computation (Note) , 1988, Inf. Process. Lett..

[15]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[16]  Eli Upfal,et al.  Parallel hashing: an efficient implementation of shared memory , 1988, JACM.

[17]  Krzysztof Diks,et al.  Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models , 1988, MFCS.

[18]  Josef Kittler,et al.  A survey of the hough transform , 1988, Comput. Vis. Graph. Image Process..

[19]  Raffaele Giancarlo,et al.  Data structures and algorithms for approximate string matching , 1988, J. Complex..

[20]  Richard Cole,et al.  Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time , 1988, SIAM J. Comput..

[21]  Paul G. Spirakis,et al.  Optimal Parallel Randomized Algorithms for Addition Sparse Addition and Identification , 1988, Inf. Comput..

[22]  Richard M. Karp,et al.  A Survey of Parallel Algorithms for Shared-Memory Machines , 1988 .

[23]  Kireeti Kompella,et al.  Using smoothness to achieve parallelism , 1988, STOC '88.

[24]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[25]  Torben Hagerup,et al.  Towards Optimal Parallel Bucket Sorting , 1987, Inf. Comput..

[26]  Gad M. Landau,et al.  Parallel Construction of a Suffix Tree (Extended Abstract) , 1987, ICALP.

[27]  Leonard M. Adleman,et al.  Recognizing primes in random polynomial time , 1987, STOC.

[28]  Johan Håstad,et al.  Optimal bounds for decision problems on the CRCW PRAM , 1987, STOC.

[29]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[30]  Edith Schonberg,et al.  Two-Dimensional, Model-Based, Boundary Matching Using Footprints , 1986 .

[31]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[32]  Joe Kilian,et al.  Almost all primes can be quickly certified , 1986, STOC '86.

[33]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[34]  Alberto Apostolico,et al.  The Myriad Virtues of Subword Trees , 1985 .

[35]  Uzi Vishkin,et al.  Randomized speed-ups in parallel computation , 2015, STOC '84.

[36]  Uzi Vishkin,et al.  Simulation of Parallel Random Access Machines by Circuits , 1984, SIAM J. Comput..

[37]  David G. Kirkpatrick,et al.  Upper Bounds for Sorting Integers on Random Access Machines , 1984, Theor. Comput. Sci..

[38]  E. Szemerédi,et al.  O(n LOG n) SORTING NETWORK. , 1983 .

[39]  János Komlós,et al.  An 0(n log n) sorting network , 1983, STOC.

[40]  Uzi Vishkin,et al.  Parallel Dictionaries in 2-3 Trees , 1983, ICALP.

[41]  A. Gottleib,et al.  The nyu ultracomputer- designing a mimd shared memory parallel computer , 1983 .

[42]  B. Awerbuch,et al.  New Connectivity and MSF Algorithms for Ultracomputer and PRAM , 1983, ICPP.

[43]  János Komlós,et al.  Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[44]  Leslie M. Goldschlager,et al.  A universal interconnection pattern for parallel computers , 1982, JACM.

[45]  Uzi Vishkin,et al.  An O(log n) Parallel Connectivity Algorithm , 1982, J. Algorithms.

[46]  Uzi Vishkin,et al.  An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.

[47]  Uzi Vishkin,et al.  Finding the Maximum, Merging, and Sorting in a Parallel Computation Model , 1981, J. Algorithms.

[48]  Walter L. Ruzzo,et al.  Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..

[49]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[50]  Volker Strassen,et al.  A Fast Monte-Carlo Test for Primality , 1977, SIAM J. Comput..

[51]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[52]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[53]  Arnold L. Rosenberg,et al.  Rapid identification of repeated patterns in strings, trees and arrays , 1972, STOC.

[54]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[55]  D. Bernstein.  DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .