Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
On parallel hashing and integer sorting
Yossi Matias
*
, Uzi Vishkin
*
Corresponding author for this work
School of Computer Science
University of Maryland, College Park
Tel Aviv University
Research output
:
Contribution to journal
›
Article
›
peer-review
35
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On parallel hashing and integer sorting'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Log-log
100%
Parallel Hashing
100%
Integer Sorting
100%
Parallel Sorting
100%
Strong Model
100%
Parallel Algorithm
50%
Parallel Computing
50%
Randomized Algorithms
50%
Nonstandard Models
50%
Expected Time
50%
Space Constraints
50%
Optimal number
50%
Efficient Simulation
50%
Parallel String Matching
50%
Parallelizable
50%
String Matching Algorithm
50%
Superpolynomials
50%
Construction Period
50%
Hashing Technique
50%
Range Limits
50%
Computer Science
Sorting Algorithm
100%
Hashing
100%
Parallel Algorithms
50%
Randomized Algorithm
50%
Space Requirement
50%
Parallel Computation
50%
Matching Algorithm
50%
Mathematics
Integer
100%
Worst Case
50%
Optimal Number
50%