Travelled to:1 × Iceland
1 × Portugal
1 × United Kingdom
3 × USA
Collaborated with:U.Zwick D.Peleg V.V.Williams A.Shapira E.Tal M.Thorup S.Chechik M.Langberg
Talks about:graph (4) algorithm (3) path (3) shortest (2) approxim (2) spanner (2) direct (2) diamet (2) determinist (1) sublinear (1)
Person: Liam Roditty
DBLP: Roditty:Liam
Contributed to:
2013
20122009200820052004Wrote 7 papers:
- STOC-2013-RodittyW #algorithm #approximate #graph #performance
- Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
- ICALP-v2-2012-PelegRT #algorithm #distributed #network
- Distributed Algorithms for Network Diameter and Girth (DP, LR, ET), pp. 660–672.
- STOC-2009-ChechikLPR #fault tolerance #graph
- Fault-tolerant spanners for general graphs (SC, ML, DP, LR), pp. 435–444.
- ICALP-A-2008-RodittyS #fault #sublinear
- All-Pairs Shortest Paths with a Sublinear Additive Error (LR, AS), pp. 622–633.
- 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.