פרופ' ליעם רודיטי

פרופ'
פרופ' ליעם רודיטי
טלפון: 
פקס: 
דוא"ל: 
משרד: 
שעות קבלה: 

פירסומים

Liam Roditty, Virginia Vassilevska Williams: Subquadratic time approximation algorithms for the girth. SODA 2012: 833-845

Liam Roditty: Fully Dynamic Geometric Spanners. Algorithmica 62(3-4): 1073-1087 (2012)

Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: f-Sensitivity Distance Oracles and Routing Schemes. Algorithmica 63(4): 861-882 (2012)

Asaf Frieder, Liam Roditty: An Experimental Study on Approximating K Shortest Simple Paths. ESA 2011: 433-444

Ely Porat, Liam Roditty: Preprocess, Set, Query! ESA 2011: 603-614

Liam Roditty, Virginia Vassilevska Williams: Minimum Weight Cycles and Triangles: Equivalences and Algorithms. FOCS 2011: 180-189

Aaron Bernstein, Liam Roditty: Improved Dynamic Algorithms for Maintaining Approximate Shortest Paths Under Deletions. SODA 2011: 1355-1365

Liam Roditty, Roei Tov: Approximating the Girth. SODA 2011: 1446-1454

Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, Moshe Lewenstein, Liam Roditty: Fast, precise and dynamic distance queries. SODA 2011: 840-853

Amihood Amir, Haim Parienty, Liam Roditty: Approximations and Partial Solutions for the Consensus Sequence Problem. SPIRE 2011: 168-173

Liam Roditty, Asaf Shapira: All-pairs shortest paths with a sublinear additive error. ACM Transactions on Algorithms 7(4): 45 (2011)

Liam Roditty, Michael Segal: On Bounded Leg Shortest Paths Problems. Algorithmica 59(4): 583-600 (2011)

Liam Roditty, Uri Zwick: On Dynamic Shortest Paths Problems. Algorithmica 61(2): 389-401 (2011)

Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. 40(2): 333-349 (2011)

Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: f-Sensitivity Distance Oracles and Routing Schemes. ESA (1) 2010: 84-96

Mihai Patrascu, Liam Roditty: Distance Oracles beyond the Thorup-Zwick Bound. FOCS 2010: 815-823

Roni Bar-Yanai, Michael Langberg, David Peleg, Liam Roditty: Realtime Classification for Encrypted Traffic. SEA 2010: 373-385

David Peleg, Liam Roditty: Relaxed Spanners for Directed Disk Graphs. STACS 2010: 609-620

Yuval Emek, David Peleg, Liam Roditty: A near-linear-time algorithm for computing replacement paths in planar directed graphs. ACM Transactions on Algorithms 6(4): (2010)

Liam Roditty: On the k Shortest Simple Paths Problem in Weighted Directed Graphs. SIAM J. Comput. 39(6): 2363-2376 (2010)

Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: Fault Tolerant Spanners for General Graphs. SIAM J. Comput. 39(7): 3403-3423 (2010)

David Peleg, Liam Roditty: Localized spanner construction for ad hoc networks with variable transmission range. TOSN 7(3): (2010)

Chen Avin, Yuval Emek, Erez Kantor, Zvi Lotker, David Peleg, Liam Roditty: SINR diagrams: towards algorithmically usable SINR models of wireless networks. PODC 2009: 200-209

Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty: Fault-tolerant spanners for general graphs. STOC 2009: 435-444

David Peleg, Liam Roditty: Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ADHOC-NOW 2008: 135-147

Lee-Ad Gottlieb, Liam Roditty: An Optimal Dynamic Spanner for Doubling Metric Spaces. ESA 2008: 478-489

Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104

Liam Roditty, Asaf Shapira: All-Pairs Shortest Paths with a Sublinear Additive Error. ICALP (1) 2008: 622-633

Yuval Emek, David Peleg, Liam Roditty: A near-linear time algorithm for computing replacement paths in planar directed graphs. SODA 2008: 428-435

Lee-Ad Gottlieb, Liam Roditty: Improved algorithms for fully dynamic geometric spanners and geometric routing. SODA 2008: 591-600

Liam Roditty: A faster and simpler fully dynamic transitive closure. ACM Transactions on Algorithms 4(1): (2008)

Liam Roditty, Mikkel Thorup, Uri Zwick: Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms 4(3): (2008)

Liam Roditty, Uri Zwick: Improved Dynamic Reachability Algorithms for Directed Graphs. SIAM J. Comput. 37(5): 1455-1471 (2008)

Liam Roditty, Michael Segal: On bounded leg shortest paths problems. SODA 2007: 775-784

Liam Roditty: On the K-simple shortest paths problem in weighted directed graphs. SODA 2007: 920-928

Liam Roditty: Fully dynamic geometric spanners. Symposium on Computational Geometry 2007: 373-380

 

תחומי מחקר

אלגוריתמים לגרפים, גיאומטריה חישובית\ אלגוריתמים דינאמיים, אלגוריתמים לרשתות אלחוטיות.