About me

Research Interests

My current focus in on the principles of distributed computing: I want to understand the fundamental properties of networks that limit how efficiently we can solve various distributed tasks (e.g., solving optimization problems such as the minimum spanning tree on a network). My other interests include approximation algorithms and leveraging continuous optimization for discrete problems.

Short Biography

I am a postdoc at ETH Zurich, in the research group of Prof. Mohsen Ghaffari. I received my Ph.D. from the School of Computer Science at Carnegie Mellon University under the advisorship of Prof. Bernhard Haeupler with the thesis titled Towards Universal Optimality in Distributed Optimization. Earlier, I obtained my B.Sc. and M.Sc. from University of Zagreb under the advisorship of Prof. Mile Šikić.

I am extremely honored to have received the 2021 ACM-EATCS Principles of Distributed Computing Doctoral Dissertation Award. Earlier, I was also awarded the 2018 DFINITY Scholarship.

Links:     my CV     my fledgling blog

Publications

  • Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. In submission. (PDF)
  • Bernhard Haeupler, David Wajc, Goran Zuzic. Universally-Optimal Distributed Algorithms for Known Topologies. ACM Symposium on Theory of Computing (STOC 2021). (PDF) (Slides) (Poster) (Video)
  • Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic. Hop-Constrained Oblivious Routing. ACM Symposium on Theory of Computing (STOC 2021). (PDF)
  • Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. Tree Embeddings for Hop-Constrained Network Design. ACM Symposium on Theory of Computing. (STOC 2021) (PDF)
  • Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar. Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. In submission. (PDF)
  • Bernhard Haepler, David Wajc, Goran Zuzic. Network Coding Gaps for Completion Times of Multiple Unicasts. IEEE Symposium on Foundations of Computer Science. (FOCS 2020) (PDF) (Video)
  • Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic. Robust Algorithms for the Secretary Problem. Innovations in Theoretical Computer Science. (ITCS 2020) (PDF) (Video)
  • Domagoj Bradac, Sahil Singla, Goran Zuzic. Optimal Adaptivity Gaps for Constrained Stochastic Probing. International Conference on Randomization and Computation. (RANDOM 2019) (PDF) (Slides)
  • Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. Erasure Correction for Noisy Radio Networks. International Symposium on Distributed Computing. (DISC 2019) (PDF) (Video)
  • Bernhard Haeupler, Jason Li, Goran Zuzic. Minor Excluded Network Families Admit Fast Distributed Algorithms. ACM Symposium on Principles of Distributed Computing. (PODC 2018) (PDF)
  • Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. Broadcasting in Noisy Radio Networks. ACM Symposium on Principles of Distributed Computing. (PODC 2017) (PDF) (Video)
  • Haeupler, Bernhard, Taisuke Izumi, and Goran Zuzic. Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. International Symposium on Distributed Computing. (DISC 2016)
  • Haeupler, Bernhard, Taisuke Izumi, and Goran Zuzic. Low-congestion shortcuts without embedding.
    Conference version: ACM Symposium on Principles of Distributed Computing. ACM, 2016 (PODC).
    Journal version: Distributed Computing (DIST 2020) (PDF) (Video) (Slides)

Contact

Office: CAB G31.2, Universitatstrasse 6, 8092 Zurich.
Email: (my first name).zuzic@inf.ethz.ch