Liam Roditty
Liam Roditty
Verified email at biu.ac.il - Homepage
Title
Cited by
Cited by
Year
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
2312014
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
2062013
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
L Roditty, U Zwick
SIAM Journal on Computing 45 (3), 712-733, 2016
1522016
Deterministic constructions of approximate distance oracles and spanners
L Roditty, M Thorup, U Zwick
International Colloquium on Automata, Languages, and Programming, 261-272, 2005
1442005
Improved dynamic reachability algorithms for directed graphs
L Roditty, U Zwick
SIAM Journal on Computing 37 (5), 1455-1471, 2008
1262008
On dynamic shortest paths problems
L Roditty, U Zwick
European Symposium on Algorithms, 580-591, 2004
1242004
Realtime classification for encrypted traffic
R Bar-Yanai, M Langberg, D Peleg, L Roditty
International Symposium on Experimental Algorithms, 373-385, 2010
1122010
Distance oracles beyond the Thorup-Zwick bound
M Patrascu, L Roditty
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010
103*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
942014
On dynamic shortest paths problems
L Roditty, U Zwick
Algorithmica 61 (2), 389-401, 2011
862011
Fault tolerant spanners for general graphs
S Chechik, M Langberg, D Peleg, L Roditty
SIAM Journal on Computing 39 (7), 3403-3423, 2010
862010
Distributed algorithms for network diameter and girth
D Peleg, L Roditty, E Tal
International Colloquium on Automata, Languages, and Programming, 660-672, 2012
742012
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
642009
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
632005
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
582011
Dynamic approximate all-pairs shortest paths in undirected graphs
L Roditty, U Zwick
SIAM Journal on Computing 41 (3), 670-683, 2012
572012
Dynamic approximate all-pairs shortest paths in undirected graphs
L Roditty, U Zwick
45th Annual IEEE Symposium on Foundations of Computer Science, 499-508, 2004
562004
An optimal dynamic spanner for doubling metric spaces
LA Gottlieb, L Roditty
European Symposium on Algorithms, 478-489, 2008
552008
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 (3), 838-904, 2020
532020
Improved algorithms for fully dynamic geometric spanners and geometric routing.
LA Gottlieb, L Roditty
SODA 8, 591-600, 2008
432008
The system can't perform the operation now. Try again later.
Articles 1–20