The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Liam Roditty: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Liam Roditty
    Fully dynamic geometric spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:373-380 [Conf]
  2. Liam Roditty, Uri Zwick
    On Dynamic Shortest Paths Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:580-591 [Conf]
  3. Liam Roditty, Uri Zwick
    Improved Dynamic Reachability Algorithms for Directed Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:679-0 [Conf]
  4. Liam Roditty, Uri Zwick
    Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:499-508 [Conf]
  5. Liam Roditty, Mikkel Thorup, Uri Zwick
    Deterministic Constructions of Approximate Distance Oracles and Spanners. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:261-272 [Conf]
  6. Liam Roditty, Uri Zwick
    Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:249-260 [Conf]
  7. Susanne Albers, Stefan Eilts, Eyal Even-Dar, Yishay Mansour, Liam Roditty
    On nash equilibria for a network creation game. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:89-98 [Conf]
  8. Liam Roditty
    A faster and simpler fully dynamic transitive closure. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:404-412 [Conf]
  9. Liam Roditty, Mikkel Thorup, Uri Zwick
    Roundtrip spanners and roundtrip routing in directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:844-851 [Conf]
  10. Liam Roditty, Uri Zwick
    A fully dynamic reachability algorithm for directed graphs with an almost linear update time. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:184-191 [Conf]
  11. Liam Roditty
    On the K-simple shortest paths problem in weighted directed graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:920-928 [Conf]
  12. Liam Roditty, Michael Segal
    On bounded leg shortest paths problems. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:775-784 [Conf]

  13. Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. [Citation Graph (, )][DBLP]


  14. An Optimal Dynamic Spanner for Doubling Metric Spaces. [Citation Graph (, )][DBLP]


  15. f-Sensitivity Distance Oracles and Routing Schemes. [Citation Graph (, )][DBLP]


  16. Dynamic Connectivity: Connecting to Networks and Geometry. [Citation Graph (, )][DBLP]


  17. All-Pairs Shortest Paths with a Sublinear Additive Error. [Citation Graph (, )][DBLP]


  18. SINR diagrams: towards algorithmically usable SINR models of wireless networks. [Citation Graph (, )][DBLP]


  19. Improved algorithms for fully dynamic geometric spanners and geometric routing. [Citation Graph (, )][DBLP]


  20. A near-linear time algorithm for computing replacement paths in planar directed graphs. [Citation Graph (, )][DBLP]


  21. Relaxed Spanners for Directed Disk Graphs. [Citation Graph (, )][DBLP]


  22. Fault-tolerant spanners for general graphs. [Citation Graph (, )][DBLP]


  23. Realtime Classification for Encrypted Traffic. [Citation Graph (, )][DBLP]


  24. Dynamic Connectivity: Connecting to Networks and Geometry [Citation Graph (, )][DBLP]


  25. SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks [Citation Graph (, )][DBLP]


  26. Relaxed spanners for directed disk graphs [Citation Graph (, )][DBLP]


  27. Fast, precise and dynamic distance queries [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002