Follow
Goran Zuzic
Goran Zuzic
Verified email at inf.ethz.ch - Homepage
Title
Cited by
Cited by
Year
Low-congestion shortcuts without embedding
B Haeupler, T Izumi, G Zuzic
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
372016
Near-optimal low-congestion shortcuts on bounded parameter graphs
B Haeupler, T Izumi, G Zuzic
International Symposium on Distributed Computing, 158-172, 2016
352016
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
302018
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
142014
Robust algorithms for the secretary problem
D Bradac, A Gupta, S Singla, G Zuzic
arXiv preprint arXiv:1911.07352, 2019
132019
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
122017
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
102021
Erasure correction for noisy radio networks
K Censor-Hillel, B Haeupler, DE Hershkowitz, G Zuzic
arXiv preprint arXiv:1805.04165, 2018
102018
$ LCSk $++: Practical similarity metric for long strings
F Pavetić, G Žužić, M Šikić
arXiv preprint arXiv:1407.2407, 2014
82014
Hop-constrained oblivious routing
M Ghaffari, B Haeupler, G Zuzic
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
72021
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
62020
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing
D Bradac, S Singla, G Zuzic
arXiv preprint arXiv:1902.01461, 2019
62019
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
52021
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
42022
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
42017
A simple boosting framework for transshipment
G Zuzic
arXiv preprint arXiv:2110.11723, 2021
32021
Universally-Optimal Distributed Exact Min-Cut
M Ghaffari, G Zuzic
arXiv preprint arXiv:2205.14967, 2022
12022
Deterministic tree embeddings with copies for algorithms against adaptive adversaries
B Haeupler, DE Hershkowitz, G Zuzic
arXiv preprint arXiv:2102.05168, 2021
12021
Distributed optimization beyond worst-case topologies
G Zuzic
12019
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
2022
The system can't perform the operation now. Try again later.
Articles 1–20