Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Zuzic, Goran
51  Ergebnisse:
Personensuche X
?
1

Polylog-Competitive Deterministic Local Routing and Schedul..:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Haeupler, Bernhard ; Patel, Shyamal ; Roeyskoe, Antti.. - p. 812-822 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Parallel Breadth-First Search and Exact Shortest Paths and ..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Rozhoň, Václav ; Haeupler, Bernhard ; Martinsson, Anders.. - p. 321-334 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Almost universally optimal distributed Laplacian solvers vi..:

Anagnostides, Ioannis ; Lenzen, Christoph ; Haeupler, Bernhard..
Distributed Computing.  36 (2023)  4 - p. 475-499 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Hop-Constrained Oblivious Routing:

Ghaffari, Mohsen ; Haeupler, Bernhard ; Zuzic, Goran
SIAM Journal on Computing.  , 2023
Link: https://doi.org/10.1137/..
 
?
5

Sparse Semi-Oblivious Routing: Few Random Paths Suffice:

, In: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing,
Zuzic, Goran ; Haeupler, Bernhard ; Roeyskoe, Antti - p. 222-232 , 2023
Link: https://dl.acm.org/doi/1..
 
?
6

Brief Announcement: Almost Universally Optimal Distributed ..:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
Anagnostides, Ioannis ; Lenzen, Christoph ; Haeupler, Bernhard.. - p. 372-374 , 2022
Link: https://dl.acm.org/doi/1..
 
?
7

Undirected (1+𝜀)-shortest paths via minor-aggregates: near-..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Rozhoň, Václav ; Grunau, Christoph ; Haeupler, Bernhard.. - p. 478-487 , 2022
Link: https://dl.acm.org/doi/1..
 
?
8

Universally-Optimal Distributed Exact Min-Cut:

, In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing,
Ghaffari, Mohsen ; Zuzic, Goran - p. 281-291 , 2022
Link: https://dl.acm.org/doi/1..
 
?
9

Hop-constrained oblivious routing:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Ghaffari, Mohsen ; Haeupler, Bernhard ; Zuzic, Goran - p. 1208-1220 , 2021
Link: https://dl.acm.org/doi/1..
 
?
10

Universally-optimal distributed algorithms for known topolo..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Haeupler, Bernhard ; Wajc, David ; Zuzic, Goran - p. 1166-1179 , 2021
Link: https://dl.acm.org/doi/1..
 
?
11

Tree embeddings for hop-constrained network design:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Haeupler, Bernhard ; Hershkowitz, D. Ellis ; Zuzic, Goran - p. 356-369 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Low-Congestion shortcuts without embedding:

Haeupler, Bernhard ; Izumi, Taisuke ; Zuzic, Goran
Distributed Computing.  34 (2020)  1 - p. 79-90 , 2020
Link: https://doi.org/10.1007/..
 
?
13

Network Coding Gaps for Completion Times of Multiple Unicas..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Haeupler, Bernhard ; Wajc, David ; Zuzic, Goran - p. 494-505 , 2020
Link: https://doi.org/10.1109/..
 
?
14

Minor Excluded Network Families Admit Fast Distributed Algo..:

, In: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing,
Haeupler, Bernhard ; Li, Jason ; Zuzic, Goran - p. 465-474 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Broadcasting in Noisy Radio Networks:

, In: Proceedings of the ACM Symposium on Principles of Distributed Computing,
Censor-Hillel, Keren ; Haeupler, Bernhard ; Hershkowitz, D. Ellis. - p. 33-42 , 2017
Link: https://dl.acm.org/doi/1..
 
1-15