Low-congestion shortcuts without embedding B Haeupler, T Izumi, G Zuzic
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
46 2016 Near-optimal low-congestion shortcuts on bounded parameter graphs B Haeupler, T Izumi, G Zuzic
International Symposium on Distributed Computing, 158-172, 2016
45 2016 Minor excluded network families admit fast distributed algorithms B Haeupler, J Li, G Zuzic
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing …, 2018
35 2018 Universally-optimal distributed algorithms for known topologies B Haeupler, D Wajc, G Zuzic
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
31 2021 Undirected (1+𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms V Rozhoň, C Grunau, B Haeupler, G Zuzic, J Li
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
27 2022 Robust algorithms for the secretary problem D Bradac, A Gupta, S Singla, G Zuzic
arXiv preprint arXiv:1911.07352, 2019
22 2019 Hop-constrained oblivious routing M Ghaffari, B Haeupler, G Zuzic
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
21 2021 Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1 -Oblivious Routing G Zuzic, G Goranci, M Ye, B Haeupler, X Sun
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
18 2022 Universally-optimal distributed exact min-cut M Ghaffari, G Zuzic
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022
17 2022 Tree embeddings for hop-constrained network design B Haeupler, DE Hershkowitz, G Zuzic
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
17 2021 Network coding gaps for completion times of multiple unicasts B Haeupler, D Wajc, G Zuzic
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
16 2020 Nonlinear predictive control of a tower crane using reference shaping approach T Bariša, M Bartulović, G Žužić, Š Ileš, J Matuško, F Kolonić
2014 16th International Power Electronics and Motion Control Conference and …, 2014
16 2014 Broadcasting in noisy radio networks K Censor-Hillel, B Haeupler, DE Hershkowitz, G Zuzic
Proceedings of the ACM Symposium on Principles of Distributed Computing, 33-42, 2017
15 2017 (Near) optimal adaptivity gaps for stochastic multi-value probing D Bradac, S Singla, G Zuzic
arXiv preprint arXiv:1902.01461, 2019
12 2019 Erasure correction for noisy radio networks K Censor-Hillel, B Haeupler, DE Hershkowitz, G Zuzic
arXiv preprint arXiv:1805.04165, 2018
12 2018 $ LCSk $++: Practical similarity metric for long strings F Pavetić, G Žužić, M Šikić
arXiv preprint arXiv:1407.2407, 2014
8 2014 Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances V Rozhoň, B Haeupler, A Martinsson, C Grunau, G Zuzic
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 321-334, 2023
7 2023 Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts I Anagnostides, C Lenzen, B Haeupler, G Zuzic, T Gouleakis
https://arxiv.org/abs/2109.05151, 2022
6 * 2022 A simple boosting framework for transshipment G Zuzic
arXiv preprint arXiv:2110.11723, 2021
5 2021 Fast and simple algorithms for computing both and F Pavetić, I Katanić, G Matula, G Žužić, M Šikić
arXiv preprint arXiv:1705.07279, 2017
5 2017