Liam Roditty

View Scopus Profile

Liam Roditty

 https://orcid.org/0000-0002-5289-198X
20022023

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2023

    Improved girth approximation in weighted undirected graphs

    Kadria, A., Roditty, L., Sidford, A., Williams, V. V. & Zwick, U., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. Association for Computing Machinery, p. 2242-2255 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • New Algorithms for All Pairs Approximate Shortest Paths

    Roditty, L., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 309-320 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2022

    Algorithmic trade-offs for girth approximation in undirected graphs

    Kadria, A., Roditty, L., Sidford, A., Williams, V. V. & Zwick, U., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1471-1492 22 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations

  • Dynamic Connectivity in Disk Graphs

    Kaplan, H., Kauer, A., Klost, K., Knorr, K., Mulzer, W., Roditty, L. & Seiferth, P., 1 Jun 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 224).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2021

    Approximate Distance Oracles with Improved Stretch for Sparse Graphs

    Roditty, L. & Tov, R., 2021, Computing and Combinatorics - 27th International Conference, COCOON 2021, Proceedings. Chen, C-Y., Hon, W-K., Hung, L-J. & Lee, C-W. (eds.). Springer Science and Business Media Deutschland GmbH, p. 89-100 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13025 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations

  • A unified approach for all pairs approximate shortest paths in weighted undirected graphs

    Akav, M. & Roditty, L., 1 Sep 2021, 29th Annual European Symposium on Algorithms, ESA 2021. Mutzel, P., Pagh, R. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 4. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 204).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2020

    An almost 2-approximation for all-pairs of shortest paths in subquadratic time

    Akav, M. & Roditty, L., 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1-11 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2020-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2019

    Algorithms and hardness for diameter in dynamic graphs

    Ancona, B., Henzinger, M., Roditty, L., Williams, V. V. & Wein, N., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    17 Scopus citations

  • Triangles and girth in disk graphs and transmission graphs

    Kaplan, H., Klost, K., Mulzer, W., Roditty, L., Seiferth, P. & Sharir, M., Sep 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 64. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 144).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2018

    Approximate single source fault tolerant shortest path

    Baswana, S., Choudhary, K., Hussain, M. & Roditty, L., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 1901-1915 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    7 Scopus citations

  • Approximating cycles in directed graphs: Fast algorithms for girth and roundtrip spanners

    Pachocki, J., Roditty, L., Sidford, A., Tov, R. & Williams, V. V., 2018, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018. Czumaj, A. (ed.). Association for Computing Machinery, p. 1374-1392 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    16 Scopus citations

  • Stabbing pairwise intersecting disks by five points

    Har-Peled, S., Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M. & Willert, M., 1 Dec 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Liao, C-S., Hsu, W-L. & Lee, D-T. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 50:1-50:12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    5 Scopus citations

  • Towards tight approximation bounds for graph diameter and eccentricities

    Backurs, A., Roditty, L., Segal, G., Williams, V. V. & Wein, N., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). Association for Computing Machinery, p. 1220-1233 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    30 Scopus citations
  • 2017

    An efficient strongly connected components algorithm in the fault tolerant model

    Baswana, S., Choudhary, K. & Roditty, L., 1 Jul 2017, 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. Muscholl, A., Indyk, P., Kuhn, F. & Chatzigiannakis, I. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 72. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 80).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Dynamic planar voronoi diagrams for general distance functions and their algorithmic applications

    Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P. & Sharir, M., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 2495-2504 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    43 Scopus citations

  • Finding triangles and computing the girth in disk graphs,

    Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 2017, Proc. 33rd European Workshop on Computational Geometry, EuroCG 2017. p. 205-208 4 p. (Proc. 33rd European Workshop Comput. Geom.(EWCG),).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2016

    Fault Tolerant subgraph for single source reachability: Generic and optimal

    Baswana, S., Choudhary, K. & Roditty, L., 19 Jun 2016, STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing. Mansour, Y. & Wichs, D. (eds.). Association for Computing Machinery, p. 509-518 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 19-21-June-2016).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    26 Scopus citations

  • Routing in unit disk graphs

    Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 2016, LATIN 2016: Theoretical Informatics - 12th Latin American Symposium, Proceedings. Navarro, G., Kranakis, E. & Chávez, E. (eds.). Springer Verlag, p. 536-548 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9644).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2015

    Fault tolerant reachability for directed graphs

    Baswana, S., Choudhary, K. & Roditty, L., 2015, Distributed Computing - 29th International Symposium, DISC 2015, Proceedings. Moses, Y. (ed.). Springer Verlag, p. 528-543 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9363).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    15 Scopus citations

  • New routing techniques and their applications

    Roditty, L. & Tov, R., 21 Jul 2015, PODC 2015 - Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 23-32 10 p. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing; vol. 2015-July).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    15 Scopus citations

  • Spanners and Reachability Oracles for Directed Transmission Graphs

    Kaplan, H., Mulzer, W., Roditty, L. & Seiferth, P., 1 Jun 2015, 31st International Symposium on Computational Geometry, SoCG 2015. Pach, J., Pach, J. & Arge, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 156-170 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    12 Scopus citations
  • 2014

    Better approximation algorithms for the graph diameter

    Chechik, S., Larkin, D. H., Roditty, L., Schoenebeck, G., Tarjan, R. E. & Williams, V. V., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 1041-1052 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    89 Scopus citations

  • Brief announcement: Distributed 3/2-approximation of the diameter

    Holzer, S., Peleg, D., Roditty, L. & Wattenhofer, R., 2014, Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Kuhn, F. (ed.). Springer Verlag, p. 562-564 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8784).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    22 Scopus citations

  • Close to linear space routing schemes

    Roditty, L. & Tov, R., 2014, Distributed Computing - 28th International Symposium, DISC 2014, Proceedings. Kuhn, F. (ed.). Springer Verlag, p. 182-196 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8784).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Multiply balanced k∈-partitioning

    Amir, A., Ficler, J., Krauthgamer, R., Roditty, L. & Sar Shalom, O., 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Verlag, p. 586-597 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • On the efficiency of the hamming C-centerstring problems

    Amir, A., Ficler, J., Roditty, L. & Shalom, O. S., 2014, Combinatorial Pattern Matching - 25th Annual Symposium, CPM 2014, Proceedings. Springer Verlag, p. 1-10 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8486 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2013

    Decremental maintenance of strongly connected components

    Roditty, L., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 1143-1150 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    20 Scopus citations

  • Fast approximation algorithms for the diameter and radius of sparse graphs

    Roditty, L. & Williams, V. V., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 515-524 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    183 Scopus citations

  • Finding the minimum-weight k-path

    Hassidim, A., Keller, O., Lewenstein, M. & Roditty, L., 2013, Algorithms and Data Structures - 13th International Symposium, WADS 2013, Proceedings. p. 390-401 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8037 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2012

    Configurations and minority in the string consensus problem

    Amir, A., Paryenty, H. & Roditty, L., 2012, String Processing and Information Retrieval - 19th International Symposium, SPIRE 2012, Proceedings. Springer Verlag, p. 42-53 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7608 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • Distributed algorithms for network diameter and girth

    Peleg, D., Roditty, L. & Tal, E., 2012, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 2 ed. Springer Verlag, p. 660-672 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7392 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    59 Scopus citations

  • Subquadratic time approximation algorithms for the girth

    Roditty, L. & Vassilevska Williams, V., 2012, Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012. Association for Computing Machinery, p. 833-845 13 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    17 Scopus citations
  • 2011

    An experimental study on approximating K Shortest simple paths

    Frieder, A. & Roditty, L., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 433-444 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Approximating the girth

    Roditty, L. & Tov, R., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 1446-1454 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    6 Scopus citations

  • Approximations and partial solutions for the consensus sequence problem

    Amir, A., Paryenty, H. & Roditty, L., 2011, String Processing and Information Retrieval - 18th International Symposium, SPIRE 2011, Proceedings. p. 168-173 6 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7024 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    7 Scopus citations

  • Fast, precise and dynamic distance queries

    Bartal, Y., Gottlieb, L. A., Kopelowitz, T., Lewenstein, M. & Roditty, L., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 840-853 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
    15 Scopus citations

  • Improved dynamic algorithms for maintaining approximate shortest paths under deletions

    Bernstein, A. & Roditty, L., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 1355-1365 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    53 Scopus citations

  • Minimum weight cycles and triangles: Equivalences and algorithms

    Roditty, L. & Williams, V. V., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 180-189 10 p. 6108163. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    30 Scopus citations

  • Preprocess, Set, query!

    Porat, E. & Roditty, L., 2011, Algorithms, ESA 2011 - 19th Annual European Symposium, Proceedings. p. 603-614 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6942 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    9 Scopus citations
  • 2010

    Distance oracles beyond the Thorup-Zwick bound

    Pǎtraşcu, M. & Roditty, L., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 815-823 9 p. 5671362. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    57 Scopus citations

  • f-sensitivity distance Oracles and routing schemes

    Chechik, S., Langberg, M., Peleg, D. & Roditty, L., 2010, European Symposium on Algorithms. Berg, M. D. & Meyer, U. (eds.). Springer Berlin Heidelberg

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • f-Sensitivity distance oracles and routing schemes

    Chechik, S., Langberg, M., Peleg, D. & Roditty, L., 2010, Algorithms, ESA 2010 - 18th Annual European Symposium, Proceedings. PART 1 ed. p. 84-96 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6346 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    20 Scopus citations

  • Realtime classification for encrypted traffic

    Bar-Yanai, R., Langberg, M., Peleg, D. & Roditty, L., 2010, Experimental Algorithms - 9th International Symposium, SEA 2010, Proceedings. p. 373-385 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6049 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    70 Scopus citations

  • Relaxed spanners for directed disk graphs

    Peleg, D. & Roditty, L., 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 609-620 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations

  • Relaxed Spanners for Directed Disk Graphs

    Peleg, D. & Roditty, L., 2010, STACS 2010.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2009

    Fault-tolerant spanners for general graphs

    Chechik, S., Langberg, M., Peleg, D. & Roditty, L., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 435-444 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    42 Scopus citations

  • SINR diagrams: Towards algorithmically usable SINR models of wireless networks

    Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D. & Roditty, L., 2009, PODC'09 - Proceedings of the 2009 ACM Symposium on Principles of Distributed Computing. p. 200-209 10 p. 1582750. (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    35 Scopus citations

  • SINR diagrams: towards algorithmically usable SINR models of wireless networks

    Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D. & Roditty, L., 2009, 28th ACM symposium on Principles of distributed computing. ACM

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2008

    All-pairs shortest paths with a sublinear additive error

    Roditty, L. & Shapira, A., 2008, Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 1 ed. p. 622-633 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5125 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations

  • All-Pairs Shortest Paths with a sublinear additive error

    Roditty, L. & Shapira, A., 2008, International Colloquium on Automata, Languages, and Programming. Aceto, L., Damgård, I., Ann, L., Goldberg, Magnús, M., Halldórsson, Ingólfsdóttir, A. & Walukiewicz, I. (eds.). Springer Berlin Heidelberg

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Your message has successfully been sent.
Your message was not sent due to an error.