( en | de | ru )

 

Disambiguation of "Krinninger, Sebastian"

Author of the publication

copydeleteadd this publication to your clipboard
An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths.

, , and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christoph Krinninger

Eduard Krinninger

Dominik Krinninger

Maximilian Krinninger

Ludwig Krinninger

 

Other publications of authors with the same name

Decremental Data Structures for Connectivity and Dominators in Directed Graphs., , , , and . ICALP, volume 80 of LIPIcs, page 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Fully dynamic all-pairs shortest paths with worst-case update-time revisited., , and . SODA, page 440-452. SIAM, (2017)An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths., , and . CoRR, (2015)Schnellere Approximationsalgorithmen zur Partiell-Dynamischen Berechnung Kürzester Wege.. Ausgezeichnete Informatikdissertationen, volume D-16 of LNI, GI, (2015)A Subquadratic-Time Algorithm for Decremental Single-Source Shortest Paths., , and . SODA, page 1053-1072. SIAM, (2014)Finding 2-edge and 2-vertex strongly connected components in quadratic time., , and . CoRR, (2014)Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs., , and . CoRR, (2016)On Fully Dynamic Graph Sparsifiers., , , , and . FOCS, page 335-344. IEEE Computer Society, (2016)Fully dynamic all-pairs shortest paths with worst-case update-time revisited., , and . CoRR, (2016)Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 713-724. Springer, (2015)