
UniversallyOptimal Distributed Algorithms for Known Topologies
Many distributed optimization algorithms achieve existentiallyoptimal r...
read it

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
Embeddings of graphs into distributions of trees that preserve distances...
read it

HopConstrained Oblivious Routing
We prove the existence of an oblivious routing scheme that is poly(log n...
read it

Tree Embeddings for HopConstrained Network Design
Network design problems aim to compute lowcost structures such as route...
read it

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training
We address the challenge of finding algorithms for online allocation (i....
read it

Robust Algorithms for the Secretary Problem
In classical secretary problems, a sequence of n elements arrive in a un...
read it

Network Coding Gaps for Completion Times of Multiple Unicasts
Arguably the most common network communication problem is multipleunica...
read it

(Near) Optimal Adaptivity Gaps for Stochastic MultiValue Probing
Consider a kidneyexchange application where we want to find a maxmatch...
read it

Erasure Correction for Noisy Radio Networks
The radio network model is a wellstudied abstraction for modeling wirel...
read it

Minor Excluded Network Families Admit Fast Distributed Algorithms
Distributed network optimization algorithms, such as minimum spanning tr...
read it
Goran Zuzic
is this you? claim profile
PhD student in the School of Computer Science at Carnegie Mellon University