Goran Zuzic

According to our database, Goran Zuzic authored at least 28 papers between 2014 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Polylog-Competitive Deterministic Local Routing and Scheduling.

Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic

CoRR, 2024

2023

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts.

Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis

Distributed Comput., December, 2023

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.

Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Sparse Semi-Oblivious Routing: Few Random Paths Suffice.

Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe

Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

A Simple Boosting Framework for Transshipment.

Goran Zuzic

Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms.

Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li

CoRR, 2022

Undirected (1+<i>ε</i>)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms.

Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ₁-Oblivious Routing.

Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver.

Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Universally-Optimal Distributed Exact Min-Cut.

Mohsen Ghaffari, Goran Zuzic

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings.

Bernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021

Low-Congestion shortcuts without embedding.

Bernhard Haeupler, Taisuke Izumi, Goran Zuzic

Distributed Comput., 2021

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing.

Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun

CoRR, 2021

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries.

Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic

CoRR, 2021

Universally-optimal distributed algorithms for known topologies.

Bernhard Haeupler, David Wajc, Goran Zuzic

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Tree embeddings for hop-constrained network design.

Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Hop-constrained oblivious routing.

Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training.

Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar

CoRR, 2020

Robust Algorithms for the Secretary Problem.

Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Network Coding Gaps for Completion Times of Multiple Unicasts.

Bernhard Haeupler, David Wajc, Goran Zuzic

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Erasure Correction for Noisy Radio Networks.

Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

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

Domagoj Bradac, Sahil Singla, Goran Zuzic

Proceedings of the Approximation, 2019

2018

Fast and Simple Algorithms for Computing both LCS_k and LCS_k+.

Filip Pavetic, Ivan Katanic, Gustav Matula, Goran Zuzic, Mile Sikic

Proceedings of the Prague Stringology Conference 2018, 2018

Minor Excluded Network Families Admit Fast Distributed Algorithms.

Bernhard Haeupler, Jason Li, Goran Zuzic

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017

Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$.

Filip Pavetic, Ivan Katanic, Gustav Matula, Goran Zuzic, Mile Sikic

CoRR, 2017

Broadcasting in Noisy Radio Networks.

Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs.

Bernhard Haeupler, Taisuke Izumi, Goran Zuzic

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2014

$LCSk$++: Practical similarity metric for long strings.

Filip Pavetic, Goran Zuzic, Mile Sikic

CoRR, 2014