U. Vishkin
U. Vishkin
Bookitis has not yet captured a biography for this author, but the catalog links below show the books currently associated with this profile.
Overview
Catalog identity and bibliographic footprint for this author.
Catalog identity
How this author appears inside the active Bookitis catalog.
Display name
Personal name
Source identifier
Featured books
Representative editions for works actually authored by this person.
- Image source: Open LibraryFO
Faster optimal parallel prefix sums and list ranking
cover - Image source: Open LibraryMP
Matching patterns in strings subject to multi-linear transformations
cover - Image source: Open LibraryAC
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
cover - Image source: Open LibraryEP
Efficient parallel and serial approximate string matching
cover - Image source: Open LibraryDC
Deterministic coin tossing with applications to optimal parallel list ranking
cover - Image source: Open LibraryAE
An efficient parallel strong orientation
cover - Image source: Open LibraryOP
Optimal parallel pattern matching in strings
cover - Image source: Open LibraryRS
Randomized speed-ups in parallel computation
cover - Image source: Open LibraryAO
An optimal parallel algorithm for selection
cover - Image source: Open LibraryDP
Dynamic parallel memories
cover - Image source: Open LibraryOC
On choice of a model of parallel computation
cover - Image source: Open LibraryAP
A parallel-design distributed-implementation (PDDI) general-purpose computer
cover - Image source: Open LibrarySP
Synchronous parallel computation - a survey
cover - Image source: Open LibraryTB
Trade-offs between depth and width in parallel computation
cover - Image source: Open LibraryLV
Lucid-boxes vs. black-boxes
cover - OTOn the Detection of Robust CurvesU. Vishkin
On the Detection of Robust Curves
no cover
Works in catalog
Quick navigation into the work-level grouping pages behind the featured books.
- Open Work
Faster optimal parallel prefix sums and list ranking
- Open Work
Matching patterns in strings subject to multi-linear transformations
- Open Work
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- Open Work
Efficient parallel and serial approximate string matching
- Open Work
Deterministic coin tossing with applications to optimal parallel list ranking
- Open Work
An efficient parallel strong orientation
- Open Work
Optimal parallel pattern matching in strings
- Open Work
Randomized speed-ups in parallel computation
- Open Work
An optimal parallel algorithm for selection
- Open Work
Dynamic parallel memories
- Open Work
On choice of a model of parallel computation
- Open Work
A parallel-design distributed-implementation (PDDI) general-purpose computer
- Open Work
Synchronous parallel computation - a survey
- Open Work
Trade-offs between depth and width in parallel computation
- Open Work
Lucid-boxes vs. black-boxes
- Open Work
On the Detection of Robust Curves