Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Parallel comparison algorithms for approximation problems
N. Alon
, Y. Azar
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
5
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Parallel comparison algorithms for approximation problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Algorithm Comparison
100%
Approximation Problem
100%
Parallel Comparison
100%
Time Complexity
66%
Parameters Determining
33%
Valiant
33%
Tree Model
33%
Ordered Domain
33%
Binary Comparison
33%
Accuracy Parameters
33%
Approximate Sorting
33%
Parallel Sorting
33%
Totally Ordered
33%
Parallel Selection
33%
Approximate Merging
33%
Parallel Merging
33%
Computer Science
Time Complexity
100%
Approximation Problem
100%
Approximation (Algorithm)
50%
Constant Factor
50%
Considered Problem
50%
Mathematics
Approximates
100%
Approximation Problem
100%
Constant Factor
25%
Model Comparison
25%
Considered Problem
25%
Time Unit
25%