`Travelled to:`

1 × Denmark

1 × Greece

1 × Israel

1 × Japan

1 × Portugal

2 × Canada

5 × USA

`Collaborated with:`

∅ L.Roditty M.Thorup T.D.Hansen H.Kaplan R.Yuster M.Paterson S.Alstrup O.Friedmann E.Cohen N.Alon R.E.Tarjan A.Björklund R.Pagh V.V.Williams I.L.Gørtz T.Rauhe

`Talks about:`

graph (4) path (4) find (4) algorithm (3) shortest (2) approxim (2) simplex (2) distanc (2) random (2) direct (2)

## Person: Uri Zwick

### DBLP: Zwick:Uri

### Contributed to:

### Wrote 17 papers:

- ICALP-v1-2015-HansenKTZ
- Hollow Heaps (TDH, HK, RET, UZ), pp. 689–700.
- STOC-2015-AlstrupKTZ #graph
- Adjacency Labeling Schemes and Induced-Universal Graphs (SA, HK, MT, UZ), pp. 625–634.
- STOC-2015-HansenZ #algorithm
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (TDH, UZ), pp. 209–218.
- ICALP-v1-2014-BjorklundPWZ
- Listing Triangles (AB, RP, VVW, UZ), pp. 223–234.
- STOC-2011-FriedmannHZ #algorithm #bound #random
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.
- ICALP-2005-AlstrupGRTZ #constant
- Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.
- ICALP-2005-RodittyTZ #approximate #distance
- Deterministic Constructions of Approximate Distance Oracles and Spanners (LR, MT, UZ), pp. 261–272.
- ICALP-2005-RodittyZ #graph
- Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs (LR, UZ), pp. 249–260.
- STOC-2004-RodittyZ #algorithm #graph #linear #reachability
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.
- STOC-2001-ThorupZ #approximate #distance
- Approximate distance oracles (MT, UZ), pp. 183–192.
- STOC-1999-CohenKZ
- Connection Caching (EC, HK, UZ), pp. 612–621.
- STOC-1999-Zwick
- All Pairs Lightest Shortest Paths (UZ), pp. 61–69.
- STOC-1999-Zwick99a #problem #programming
- Outward Rotations: A Tool for Rounding Solutions of Semidefinite Programming Relaxations, with Applications to MAX CUT and Other Problems (UZ), pp. 679–687.
- STOC-1998-Zwick
- Finding Almost-Satisfying Assignments (UZ), pp. 551–560.
- ICALP-1994-YusterZ #performance
- Finding Even Cycles Even Faster (RY, UZ), pp. 532–543.
- STOC-1994-AlonYZ #graph #named #scalability
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (NA, RY, UZ), pp. 326–335.
- STOC-1992-PatersonZ #multi
- Shallow Multiplication Circuits and Wise Financial Investments (MP, UZ), pp. 429–437.