Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Home
Profiles
Research units
Research output
Prizes
Search by expertise, name or affiliation
The complexity of parallel search
Richard M. Karp
*
, Eli Upfal
,
Avi Wigderson
*
Corresponding author for this work
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
69
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'The complexity of parallel search'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Decision Problems
25%
Families of Subsets
25%
General Questions
25%
Graphic Matroid
25%
Independence System
75%
Independent Sets of Vertices
25%
Matroid
25%
Maximal Independent Set
50%
Maximum Independent Set
25%
Maximum Matching
25%
Oracle
100%
Parallel Algorithm
100%
Parallel Complexity
25%
Parallel Search
100%
Parallel Search Algorithm
25%
Partition Matroid
25%
Randomized Algorithms
25%
Randomized Complexity
25%
Search Problems
25%
Self-reducibility
25%
Sequential Computation
25%
Computer Science
Decision Problem
25%
Independent Set
75%
Maximal Independent Set
50%
Maximum Matching
25%
Parallel Algorithm
100%
Parallel Search
100%
Randomized Algorithm
25%
Searching Algorithm
25%
Mathematics
Independent Set
100%
Lower and upper bounds
25%
Matroid
75%
Maximum Independent Set
25%
Search Algorithm
25%