Goran Zuzic

Orcid: 0000-0002-9322-6329

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Polylog-Competitive Deterministic Local Routing and Scheduling.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts.
Distributed Comput., December, 2023

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Sparse Semi-Oblivious Routing: Few Random Paths Suffice.
Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing, 2023

A Simple Boosting Framework for Transshipment.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

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

Undirected (1+<i>ε</i>)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms.
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 ℓ<sub>1</sub>-Oblivious Routing.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver.
Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Universally-Optimal Distributed Exact Min-Cut.
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.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
Low-Congestion shortcuts without embedding.
Distributed Comput., 2021

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

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries.
CoRR, 2021

Universally-optimal distributed algorithms for known topologies.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Tree embeddings for hop-constrained network design.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Hop-constrained oblivious routing.
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.
CoRR, 2020

Robust Algorithms for the Secretary Problem.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Network Coding Gaps for Completion Times of Multiple Unicasts.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Erasure Correction for Noisy Radio Networks.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing.
Proceedings of the Approximation, 2019

2018
Fast and Simple Algorithms for Computing both LCS<sub>k</sub> and LCS<sub>k+</sub>.
Proceedings of the Prague Stringology Conference 2018, 2018

Minor Excluded Network Families Admit Fast Distributed Algorithms.
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+}$.
CoRR, 2017

Broadcasting in Noisy Radio Networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2014
$LCSk$++: Practical similarity metric for long strings.
CoRR, 2014


  Loading...