Searching for authors named "Liam Roditty" – sorted by Relevance.
-
Fully Dynamic Geometric Spanners (Extended Abstract)
- Fully Dynamic Geometric Spanners [Extended Abstract] Liam RodittyDepartment of Computer Science
- Add To MetaCart
-
All-Pairs Shortest Paths with a Sublinear Additive Error
- All-Pairs Shortest Paths with a Sublinear Additive Error Liam Roditty ∗ Asaf Shapira † Abstract We
- Add To MetaCart
-
Improved Dynamic Reachability Algorithms for Directed Graphs
- Improved dynamic reachability algorithms for directed graphs Liam Roditty and Uri Zwick School
- Cited by 14 (3 self) – Add To MetaCart
-
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
- ABSTRACT Liam Roditty School of Computer Science Tel-Aviv University Tel Aviv 69978, Israel liamr
- Cited by 4 (0 self) – Add To MetaCart
-
Improved algorithms for fully dynamic geometric spanners and geometric routing
- ∗ Liam Roditty † Abstract For a set S of points in R d , a t-spanner is a sparse graph on the points
- Cited by 3 (3 self) – Add To MetaCart
-
Roundtrip Spanners and Roundtrip Routing in Directed Graphs
- Roundtrip Spanners and Roundtrip Routing in Directed Graphs Liam Roditty Mikkel Thorup y Uri
- Cited by 12 (0 self) – Add To MetaCart
-
A near-linear time algorithm for computing replacement paths in planar directed graphs
- ∗ David Peleg ∗ Liam Roditty ∗ Abstract Let G = (V (G), E(G)) be a weighted directed graph and let P be a
- Cited by 2 (1 self) – Add To MetaCart
-
On Nash equilibria for a network creation game
- -Dar ‡ Yishay Mansour § Liam Roditty ¶ Abstract We study a network creation game recently proposed by Fabrikant
- Cited by 32 (6 self) – Add To MetaCart
-
Submitted
- Liam Roditty January 6, 2008 Contact Information Research Interests Office Address: School
- Add To MetaCart

