Follow
Liam Roditty
Liam Roditty
Verified email at biu.ac.il - Homepage
Title
Cited by
Cited by
Year
Fast approximation algorithms for the diameter and radius of sparse graphs
L Roditty, V Vassilevska Williams
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
2922013
On Nash equilibria for a network creation game
S Albers, S Eilts, E Even-Dar, Y Mansour, L Roditty
ACM Transactions on Economics and Computation (TEAC) 2 (1), 1-27, 2014
2452014
Deterministic constructions of approximate distance oracles and spanners
L Roditty, M Thorup, U Zwick
International Colloquium on Automata, Languages, and Programming, 261-272, 2005
1802005
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
L Roditty, U Zwick
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
1772004
Realtime classification for encrypted traffic
R Bar-Yanai, M Langberg, D Peleg, L Roditty
Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia …, 2010
1632010
On dynamic shortest paths problems
L Roditty, U Zwick
Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004
1552004
Improved dynamic reachability algorithms for directed graphs
L Roditty, U Zwick
SIAM Journal on Computing 37 (5), 1455-1471, 2008
1412008
Distance oracles beyond the Thorup-Zwick bound
M Patrascu, L Roditty
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010
136*2010
Better approximation algorithms for the graph diameter
S Chechik, DH Larkin, L Roditty, G Schoenebeck, RE Tarjan, VV Williams
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
1322014
On dynamic shortest paths problems
L Roditty, U Zwick
Algorithmica 61, 389-401, 2011
1312011
Fault-tolerant spanners for general graphs
S Chechik, M Langberg, D Peleg, L Roditty
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1212009
Distributed algorithms for network diameter and girth
D Peleg, L Roditty, E Tal
International Colloquium on Automata, Languages, and Programming, 660-672, 2012
1002012
Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications
H Kaplan, W Mulzer, L Roditty, P Seiferth, M Sharir
Discrete & Computational Geometry 64, 838-904, 2020
942020
Roundtrip spanners and roundtrip routing in directed graphs
I Roditty, M Thorup, U Zwick
ACM Transactions on Algorithms (TALG) 4 (3), 1-17, 2008
922008
Dynamic approximate all-pairs shortest paths in undirected graphs
L Roditty, U Zwick
SIAM Journal on Computing 41 (3), 670-683, 2012
822012
Improved dynamic algorithms for maintaining approximate shortest paths under deletions
A Bernstein, L Roditty
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
762011
SINR diagrams: Towards algorithmically usable SINR models of wireless networks
C Avin, Y Emek, E Kantor, Z Lotker, D Peleg, L Roditty
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
732009
An optimal dynamic spanner for doubling metric spaces
LA Gottlieb, L Roditty
European Symposium on Algorithms, 478-489, 2008
722008
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs
L Roditty, U Zwick
International Colloquium on Automata, Languages, and Programming, 249-260, 2005
702005
Towards tight approximation bounds for graph diameter and eccentricities
A Backurs, L Roditty, G Segal, VV Williams, N Wein
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
672018
The system can't perform the operation now. Try again later.
Articles 1–20