Goran Zuzic

is this you? claim profile

∙ 0 followers
Carnegie Mellon University

PhD student in the School of Computer Science at Carnegie Mellon University

Universally-Optimal Distributed Algorithms for Known Topologies

Many distributed optimization algorithms achieve existentially-optimal r...
04/08/2021 ∙ by Bernhard Haeupler, et al. ∙ 0 ∙ share

read it
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries

Embeddings of graphs into distributions of trees that preserve distances...
02/09/2021 ∙ by Bernhard Haeupler, et al. ∙ 0 ∙ share

read it
Hop-Constrained Oblivious Routing

We prove the existence of an oblivious routing scheme that is poly(log n...
11/20/2020 ∙ by Mohsen Ghaffari, et al. ∙ 0 ∙ share

read it
Tree Embeddings for Hop-Constrained Network Design

Network design problems aim to compute low-cost structures such as route...
11/11/2020 ∙ by Bernhard Haeupler, et al. ∙ 0 ∙ share

read it
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training

We address the challenge of finding algorithms for online allocation (i....
10/16/2020 ∙ by Goran Zuzic, et al. ∙ 0 ∙ share

read it
Robust Algorithms for the Secretary Problem

In classical secretary problems, a sequence of n elements arrive in a un...
11/17/2019 ∙ by Domagoj Bradac, et al. ∙ 0 ∙ share

read it
Network Coding Gaps for Completion Times of Multiple Unicasts

Arguably the most common network communication problem is multiple-unica...
05/07/2019 ∙ by Bernhard Haeupler, et al. ∙ 0 ∙ share

read it
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing

Consider a kidney-exchange application where we want to find a max-match...
02/04/2019 ∙ by Domagoj Bradac, et al. ∙ 0 ∙ share

read it
Erasure Correction for Noisy Radio Networks

The radio network model is a well-studied abstraction for modeling wirel...
05/10/2018 ∙ by Keren Censor-Hillel, et al. ∙ 0 ∙ share

read it
Minor Excluded Network Families Admit Fast Distributed Algorithms

Distributed network optimization algorithms, such as minimum spanning tr...
01/18/2018 ∙ by Bernhard Haeupler, et al. ∙ 0 ∙ share

read it

Goran Zuzic

Featured Co-authors

Di Wang

Jason Li

Anupam Gupta

Sahil Singla

Bernhard Haeupler

Keren Censor-Hillel

Mohsen Ghaffari

David Wajc

D. Ellis Hershkowitz

Aranyak Mehta

D. Sivakumar

Universally-Optimal Distributed Algorithms for Known Topologies

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries

Hop-Constrained Oblivious Routing

Tree Embeddings for Hop-Constrained Network Design

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training

Robust Algorithms for the Secretary Problem

Network Coding Gaps for Completion Times of Multiple Unicasts

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing

Erasure Correction for Noisy Radio Networks

Minor Excluded Network Families Admit Fast Distributed Algorithms