About me

Research Interests

My current focus in on distributed network optimization, but my other interests include approximation algorithms and spectral graph theory.

Biography

I am a Ph.D. student in the School of Computer Science at Carnegie Mellon University. I work on the design and analysis of algorithms as a part of the the Algorithms and Complexity Group. I am lucky to be advised by Prof. Bernhard Haeupler.

I am happy to announce that I was awarded the DFINITY Scholarship for 2018.

Publications

  • Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic. The Byzantine Secretary Problem. work in progress (in submission)
  • Domagoj Bradac, Sahil Singla, Goran Zuzic. Optimal Adaptivity Gaps for Constrained Stochastic Probing. work in progress (in submission)
  • Keren Censor-Hillel, Bernhard Haeupler, Ellis D. Hershkowitz, Goran Zuzic. Erasure Correction for Noisy Radio Networks. preprint (in submission) (PDF) (Video)
  • Bernhard Haeupler, Jason Li, Goran Zuzic. Minor Excluded Network Families Admit Fast Distributed Algorithms ACM Symposium on Principles of Distributed Computing. ACM, 2018 (PODC) (PDF)
  • Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic. Broadcasting in Noisy Radio Networks ACM Symposium on Principles of Distributed Computing. ACM, 2017 (PODC) (PDF) (Video)
  • Haeupler, Bernhard, Taisuke Izumi, and Goran Zuzic. Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. International Symposium on Distributed Computing, 2016. (DISC)
  • Haeupler, Bernhard, Taisuke Izumi, and Goran Zuzic. Low-congestion shortcuts without embedding. ACM Symposium on Principles of Distributed Computing. ACM, 2016 (PODC) (PDF) (Video) (Slides)

Contact

Office #7515 Gates Hillman Center, School of Computer Science, CMU
Email: g[my last name]@cs.cmu.edu
US mail:  
School of Computer Science
Carnegie Mellon University
5000 Forbes Avenue
Pittsburgh, PA 15213