default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGoran Zuzic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Bernhard Haeupler
, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic:
Polylog-Competitive Deterministic Local Routing and Scheduling. STOC 2024: 812-822- [i21]Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic:
Polylog-Competitive Deterministic Local Routing and Scheduling. CoRR abs/2403.07410 (2024) - 2023
- [j2]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36(4): 475-499 (2023) - [c21]Goran Zuzic:
A Simple Boosting Framework for Transshipment. ESA 2023: 104:1-104:14 - [c20]Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe:
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. PODC 2023: 222-232 - [c19]Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic:
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. STOC 2023: 321-334 - [i20]Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe:
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. CoRR abs/2301.06647 (2023) - 2022
- [c18]Bernhard Haepler, D. Ellis Hershkowitz, Goran Zuzic:
Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. ESA 2022: 63:1-63:14 - [c17]Mohsen Ghaffari, Goran Zuzic:
Universally-Optimal Distributed Exact Min-Cut. PODC 2022: 281-291 - [c16]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC 2022: 372-374 - [c15]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. SODA 2022: 2549-2579 - [c14]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC 2022: 478-487 - [c13]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC 2022: 6:1-6:20 - [i19]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. CoRR abs/2204.05874 (2022) - [i18]Mohsen Ghaffari, Goran Zuzic:
Universally-Optimal Distributed Exact Min-Cut. CoRR abs/2205.14967 (2022) - [i17]Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic:
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. CoRR abs/2210.16351 (2022) - 2021
- [j1]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion shortcuts without embedding. Distributed Comput. 34(1): 79-90 (2021) - [c12]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Tree embeddings for hop-constrained network design. STOC 2021: 356-369 - [c11]Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-optimal distributed algorithms for known topologies. STOC 2021: 1166-1179 - [c10]Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic:
Hop-constrained oblivious routing. STOC 2021: 1208-1220 - [i16]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. CoRR abs/2102.05168 (2021) - [i15]Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-Optimal Distributed Algorithms for Known Topologies. CoRR abs/2104.03932 (2021) - [i14]Goran Zuzic:
A Simple Boosting Framework for Transshipment. CoRR abs/2110.11723 (2021) - [i13]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. CoRR abs/2110.15944 (2021) - 2020
- [c9]Bernhard Haeupler, David Wajc, Goran Zuzic:
Network Coding Gaps for Completion Times of Multiple Unicasts. FOCS 2020: 494-505 - [c8]Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic:
Robust Algorithms for the Secretary Problem. ITCS 2020: 32:1-32:26 - [i12]Goran Zuzic, Di Wang, Aranyak Mehta, D. Sivakumar:
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. CoRR abs/2010.08418 (2020) - [i11]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Tree Embeddings for Hop-Constrained Network Design. CoRR abs/2011.06112 (2020) - [i10]Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic:
Hop-Constrained Oblivious Routing. CoRR abs/2011.10446 (2020)
2010 – 2019
- 2019
- [c7]Domagoj Bradac, Sahil Singla, Goran Zuzic:
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. APPROX-RANDOM 2019: 49:1-49:21 - [c6]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. DISC 2019: 10:1-10:17 - [i9]Domagoj Bradac, Sahil Singla, Goran Zuzic:
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. CoRR abs/1902.01461 (2019) - [i8]Bernhard Haeupler, David Wajc, Goran Zuzic:
Network Coding Gaps for Completion Times of Multiple Unicasts. CoRR abs/1905.02805 (2019) - [i7]Domagoj Bradac, Anupam Gupta, Sahil Singla, Goran Zuzic:
Robust Algorithms for the Secretary Problem. CoRR abs/1911.07352 (2019) - 2018
- [c5]Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. PODC 2018: 465-474 - [c4]Filip Pavetic, Ivan Katanic, Gustav Matula, Goran Zuzic, Mile Sikic:
Fast and Simple Algorithms for Computing both LCSk and LCSk+. Stringology 2018: 50-62 - [i6]Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. CoRR abs/1801.06237 (2018) - [i5]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. CoRR abs/1805.04165 (2018) - 2017
- [c3]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. PODC 2017: 33-42 - [i4]Filip Pavetic, Ivan Katanic, Gustav Matula, Goran Zuzic, Mile Sikic:
Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$. CoRR abs/1705.07279 (2017) - [i3]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. CoRR abs/1705.07369 (2017) - 2016
- [c2]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. PODC 2016: 451-460 - [c1]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. DISC 2016: 158-172 - [i2]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. CoRR abs/1607.07553 (2016) - 2014
- [i1]Filip Pavetic, Goran Zuzic, Mile Sikic:
$LCSk$++: Practical similarity metric for long strings. CoRR abs/1407.2407 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
