Liam
Roditty
About me:
I am a senior lecturer in the computer science
department of
Research Interests:
Networking, Routing, Computational Geometry, Dynamic Algorithms, Algorithms Engineering.
Contact Information:
Office: Computer and Mathematics Bldg (216), Room 017 Office
Phone: (972)-3-5317874
Email: liamr@macs.biu.ac.il
Department of
Computer Science,
Office hours: Anytime just send an email to check if I am not busy
Teaching:
Year 2009/2010
Semester A:
Dynamic algorithms 89-526
Seminar in Algorithms 89-426
Programming languages 89-310
Year 2008/2009
Semester B:
Dynamic algorithms 89-526
Seminar in Algorithms 89-426
Semester A:
Programming languages 89-310
Publications:
Fault-tolerant spanners for general graphs
Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty
STOC 2009
Dynamic connectivity: connecting
to networks and geometry
Timothy Chan, Mihai Patrascu, and Liam Roditty
FOCS 2008:95-104
Spanners for Ad Hoc networks with variable transmission range
David Peleg and Liam Roditty
Ad-hoc NOW 2008: 622-633
Dynamic geometric spanners with low degree and optimal update time
Liam Roditty and Lee-Ad Gottlieb
ESA 2008: 478-489
All-pairs shortest paths with a sublinear additive error
Liam Roditty and Asaf Shapira
ICALP 2008: 622-633
A near-linear time algorithm for computing replacement paths in planar directed graphs
Yuval Emek, David Peleg and Liam Roditty
SODA 2008: 428-435
Accepted to Special Issue of SODA08 in ACM Transactions on Algorithms (TALG)
Improved algorithms for fully dynamic geometric spanners
Lee-Ad Gottlieb and Liam Roditty
SODA 2008: 591-600
Fully dynamic geometric spanners
Liam Roditty
SoCG 2007: 373-380
On the $k$-simple shortest paths problem in weighted directed graphs.
Liam Roditty
SODA 2007: 920-928
On bounded leg shortest paths problems
Liam Roditty and Michael Segal
SODA 2007: 775-784
On Nash equilibria for a network creation game
Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour and Liam Roditty
SODA 2006: 89-98
Replacement paths and k simple shortest paths in unweighted directed graphs
Liam Roditty and Uri Zwick
ICALP 2005: 249-260
Deterministic constructions of approximate distance oracles and spanners
Liam Roditty, Mikkel Thorup and Uri Zwick
ICALP 2005: 261-272
Dynamic approximate all-pairs shortest paths in undirected Graphs
Liam Roditty and Uri Zwick
FOCS 2004: 499-508
On dynamic shortest paths problems
Liam Roditty and Uri Zwick
ESA 2004: 580-591
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
Liam Roditty and Uri Zwick
STOC 2004: 184:191
A faster and simpler fully dynamic transitive closure
Liam Roditty
SODA 2003: 404-412
Journal Version in ACM Transactions on Algorithms (TALG).
Improved dynamic reachability algorithms for directed graphs
Liam Roditty and Uri Zwick
FOCS 2002: 679-686
Journal Version in
Roundtrip spanners and roundtrip routing in directed graphs.
Liam Roditty, Mikkel Thorup and Uri Zwick
SODA 2002: 844-851
Journal Version in ACM Transactions on Algorithms (TALG)