| Low-congestion shortcuts without embedding B Haeupler, T Izumi, G Zuzic Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016 | 35 | 2016 |
| Near-optimal low-congestion shortcuts on bounded parameter graphs B Haeupler, T Izumi, G Zuzic International Symposium on Distributed Computing, 158-172, 2016 | 33 | 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 | 27 | 2018 |
| Robust algorithms for the secretary problem D Bradac, A Gupta, S Singla, G Zuzic arXiv preprint arXiv:1911.07352, 2019 | 12 | 2019 |
| 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 | 12 | 2017 |
| 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 | 12 | 2014 |
| Erasure correction for noisy radio networks K Censor-Hillel, B Haeupler, DE Hershkowitz, G Zuzic arXiv preprint arXiv:1805.04165, 2018 | 9 | 2018 |
| $ LCSk $++: Practical similarity metric for long strings F Pavetić, G Žužić, M Šikić arXiv preprint arXiv:1407.2407, 2014 | 8 | 2014 |
| 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 | 7 | 2021 |
| (Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing D Bradac, S Singla, G Zuzic arXiv preprint arXiv:1902.01461, 2019 | 6 | 2019 |
| Hop-constrained oblivious routing M Ghaffari, B Haeupler, G Zuzic Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 5 | 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 | 5 | 2020 |
| 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 | 4 | 2021 |
| A simple boosting framework for transshipment G Zuzic arXiv preprint arXiv:2110.11723, 2021 | 2 | 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 | 1 | 2022 |
| Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries B Haeupler, DE Hershkowitz, G Zuzic arXiv preprint arXiv:2102.05168, 2021 | 1 | 2021 |
| Distributed optimization beyond worst-case topologies G Zuzic | 1 | 2019 |
| Undirected -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms V Rozhoň, C Grunau, B Haeupler, G Zuzic, J Li arXiv preprint arXiv:2204.05874, 2022 | | 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 | | 2020 |
| 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, 0 | | |
Bernhard HaeuplerAssociate Professor, CMUVerified email at cs.cmu.edu
