Travelled to:1 × Germany
1 × Greece
1 × India
2 × Canada
2 × Spain
6 × USA
Collaborated with:∅ Y.Matias G.M.Landau B.Schieber S.C.Sahinalp S.Khuller R.Cole A.O.Balkan G.Qu Y.Mansour N.Nisan W.J.Paul H.Wagener A.Tzannes G.C.Caragea R.Barua O.Berkman D.Breslauer Z.Galil
Talks about:parallel (11) algorithm (3) match (3) tree (3) time (3) high (3) determinist (2) throughput (2) construct (2) techniqu (2)
Person: Uzi Vishkin
DBLP: Vishkin:Uzi
Contributed to:
2010
2008
19941992
1991199119901990198919871986198519841983Wrote 16 papers:
- PPoPP-2010-TzannesCBV #adaptation #lazy evaluation #runtime
- Lazy binary-splitting: a run-time adaptive work-stealing scheduler (AT, GCC, RB, UV), pp. 179–190.
- DAC-2008-BalkanQV #hybrid #network #parallel
- An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing (AOB, GQ, UV), pp. 435–440.
- STOC-1994-MansourNV #communication #parallel #throughput #trade-off
- Trade-offs between communication throughput and parallel time (YM, NN, UV), pp. 372–381.
- STOC-1994-SahinalpV #symmetry
- Symmetry breaking for suffix tree construction (SCS, UV), pp. 300–309.
- STOC-1992-KhullerV #approximate #graph
- Biconnectivity Approximations and Graph Carvings (SK, UV), pp. 759–770.
- ICALP-1991-Vishkin #algorithm #parallel
- Strutural Parallel Algorithmics (UV), pp. 363–380.
- STOC-1991-MatiasV #parallel #probability
- Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (YM, UV), pp. 307–316.
- ICALP-1990-MatiasV #integer #on the #parallel #sorting
- On Parallel Hashing and Integer Sorting (YM, UV), pp. 729–743.
- STOC-1990-Vishkin #pattern matching #performance
- Deterministic Sampling-A New Technique for Fast Pattern Matching (UV), pp. 170–180.
- STOC-1989-BerkmanBGSV #problem
- Highly Parallelizable Problems (OB, DB, ZG, BS, UV), pp. 309–319.
- ICALP-1987-LandauSV #parallel
- Parallel Construction of a Suffix Tree (GML, BS, UV), pp. 314–325.
- STOC-1986-ColeV #algorithm #design #metaprogramming #parallel
- Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (RC, UV), pp. 206–219.
- STOC-1986-LandauV #algorithm #approximate #parallel #performance #string
- Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm (GML, UV), pp. 220–230.
- ICALP-1985-Vishkin #parallel #pattern matching #string
- Optimal Parallel Pattern Matching in Strings (UV), pp. 497–508.
- STOC-1984-Vishkin #parallel #random
- Randomized Speed-Ups in Parallel Computation (UV), pp. 230–239.
- ICALP-1983-PaulVW #parallel
- Parallel Dictionaries in 2-3 Trees (WJP, UV, HW), pp. 597–609.