Author of the publication

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.

 

Other publications of authors with the same name

Fast and Simple Algorithms for Computing both LCSk and LCSk+., , , , and . Stringology, page 50-62. Czech Technical University in Prague, Faculty of Information Technology, Department of Theoretical Computer Science, (2018)Hop-Constrained Oblivious Routing., , and . CoRR, (2020)Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms., , , , and . STOC, page 478-487. ACM, (2022)Sparse Semi-Oblivious Routing: Few Random Paths Suffice., , and . PODC, page 222-232. ACM, (2023)Fast and simple algorithms for computing both $LCS_k$ and $LCS_k+$., , , , and . CoRR, (2017)Universally-Optimal Distributed Exact Min-Cut., and . PODC, page 281-291. ACM, (2022)Universally-optimal distributed algorithms for known topologies., , and . STOC, page 1166-1179. ACM, (2021)Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training., , , and . CoRR, (2020)(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing., , and . APPROX-RANDOM, volume 145 of LIPIcs, page 49:1-49:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver., , , , and . PODC, page 372-374. ACM, (2022)