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

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..
 
?
2

Maximum Length-Constrained Flows and Disjoint Paths: Distri..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Haeupler, Bernhard ; Hershkowitz, D. Ellis ; Saranurak, Thatchaphol - p. 1371-1383 , 2023
Link: https://dl.acm.org/doi/1..
 
?
3

Efficient Linear and Affine Codes for Correcting Insertions..:

Cheng, Kuan ; Guruswami, Venkatesan ; Haeupler, Bernhard.
SIAM Journal on Discrete Mathematics.  37 (2023)  2 - p. 748-778 , 2023
Link: https://doi.org/10.1137/..
 
?
4

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/..
 
?
5

Hop-Constrained Oblivious Routing:

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

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..
 
?
7

Circuits resilient to short-circuit errors:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Efremenko, Klim ; Haeupler, Bernhard ; Kalai, Yael Tauman... - p. 582-594 , 2022
Link: https://dl.acm.org/doi/1..
 
?
8

Deterministic Distributed Sparse and Ultra-Sparse Spanners ..:

, In: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures,
Bezdrighin, Marcel ; Elkin, Michael ; Ghaffari, Mohsen... - p. 1-10 , 2022
Link: https://dl.acm.org/doi/1..
 
?
9

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..
 
?
10

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..
 
?
11

Hop-constrained expander decompositions, oblivious routing,..:

, In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing,
Haeupler, Bernhard ; Räcke, Harald ; Ghaffari, Mohsen - p. 1325-1338 , 2022
Link: https://dl.acm.org/doi/1..
 
?
12

Deterministic Low-Diameter Decompositions for Weighted Grap..:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Rozhon, Vaclav ; Elkin, Michael ; Grunau, Christoph. - p. 1114-1121 , 2022
Link: https://doi.org/10.1109/..
 
?
13

Rate-Distance Trade-offs for List-Decodable Insertion-Delet..:

, In: 2022 IEEE Information Theory Workshop (ITW),
Haeupler, Bernhard ; Shahrasbi, Amirbehshad - p. 470-475 , 2022
Link: https://doi.org/10.1109/..
 
?
14

Low-Congestion Shortcuts for Graphs Excluding Dense Minors:

, In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing,
Ghaffari, Mohsen ; Haeupler, Bernhard - p. 213-221 , 2021
Link: https://dl.acm.org/doi/1..
 
?
15

A time-optimal randomized parallel algorithm for MIS:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Ghaffari, Mohsen ; Haeupler, Bernhard - p. 2892-2903 , 2021
Link: https://dl.acm.org/doi/1..
 
1-15