Goran Zuzic

Available identifiers

Publication	Date of Publication	Type
A simple boosting framework for transshipment	2025-01-06	Paper
Universally-optimal distributed shortest paths and transshipment via graph-based \(\ell_1\)-oblivious routing	2024-07-19	Paper
Parallel breadth-first search and exact shortest paths and stronger notions for approximate distances	2024-05-08	Paper
Universally-Optimal Distributed Exact Min-Cut	2024-03-26	Paper
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver	2024-03-26	Paper
Sparse Semi-Oblivious Routing: Few Random Paths Suffice	2024-03-26	Paper
Undirected (1+ 𝜀 )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms	2023-12-08	Paper
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts	2023-11-21	Paper
Hop-constrained oblivious routing	2023-11-14	Paper
Universally-optimal distributed algorithms for known topologies	2023-11-14	Paper
Tree embeddings for hop-constrained network design	2023-11-14	Paper
Erasure correction for noisy radio networks	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875506	2023-02-03	Paper
Robust Algorithms for the Secretary Problem	2023-02-03	Paper
Low-congestion shortcuts without embedding	2021-03-12	Paper
Minor Excluded Network Families Admit Fast Distributed Algorithms	2019-09-19	Paper
Near-optimal low-congestion shortcuts on bounded parameter graphs	2018-08-16	Paper
Broadcasting in Noisy Radio Networks	2017-10-11	Paper
Low-Congestion Shortcuts without Embedding	2017-09-29	Paper

This page was built for person: Goran Zuzic