| Low-congestion shortcuts without embedding B Haeupler, T Izumi, G Zuzic Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 49* | 2016 |
| Near-optimal low-congestion shortcuts on bounded parameter graphs B Haeupler, T Izumi, G Zuzic International Symposium on Distributed Computing, 158-172, 2016 | 47 | 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 | 37 | 2018 |
| 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 | 36 | 2022 |
| 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 | 36 | 2021 |
| Hop-constrained oblivious routing M Ghaffari, B Haeupler, G Zuzic Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 25 | 2021 |
| Robust algorithms for the secretary problem D Bradac, A Gupta, S Singla, G Zuzic arXiv preprint arXiv:1911.07352, 2019 | 25 | 2019 |
| 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 | 23 | 2022 |
| Universally-optimal distributed exact min-cut M Ghaffari, G Zuzic Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing …, 2022 | 22 | 2022 |
| 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 | 19 | 2014 |
| 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 | 18 | 2021 |
| 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 | 18 | 2017 |
| 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 | 17 | 2020 |
| Erasure correction for noisy radio networks K Censor-Hillel, B Haeupler, DE Hershkowitz, G Zuzic arXiv preprint arXiv:1805.04165, 2018 | 15 | 2018 |
| (Near) optimal adaptivity gaps for stochastic multi-value probing D Bradac, S Singla, G Zuzic arXiv preprint arXiv:1902.01461, 2019 | 12 | 2019 |
| 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 | 11 | 2023 |
| $ LCSk $++: Practical similarity metric for long strings F Pavetić, G Žužić, M Šikić arXiv preprint arXiv:1407.2407, 2014 | 10 | 2014 |
| 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 | 8* | 2022 |
| Learning robust algorithms for online allocation problems using adversarial training G Zuzic, D Wang, A Mehta, D Sivakumar arXiv preprint arXiv:2010.08418, 2020 | 7 | 2020 |
| A simple boosting framework for transshipment G Zuzic arXiv preprint arXiv:2110.11723, 2021 | 6 | 2021 |
Bernhard HaeuplerINSAIT (University of Sofia, Bulgaria) & ETH ZurichVerified email at insait.ai
