Distributed Optimization Beyond Worst-Case Topologies

Project Information

DistOpt-BydWorstCase

Grant agreement ID: 949272

DOI

10.3030/949272

EC signature date 17 August 2020

Start date 1 September 2020

End date 31 January 2026

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 540 000,00

EU contribution

€ 1 540 000,00

Coordinated by

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Switzerland

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Book chapters (5)

A Cut-Matching Game for Constant-Hop Expanders

Author(s): Bernhard Haeupler, Jonas Huebotter, Mohsen Ghaffari
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 1651-1678
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.51

Bidirectional Dijkstra’s Algorithm is Instance-Optimal

Author(s): Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert E. Tarjan, Jakub Tětek
Published in: 2025 Symposium on Simplicity in Algorithms (SOSA), 2025, Page(s) 202-215
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978315.16

Fast and Simple Sorting Using Partial Information

Author(s): Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhoň, Robert E. Tarjan, Jakub Tětek
Published in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Page(s) 3953-3973
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.134

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path

Author(s): Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser
Published in: 2025 Symposium on Simplicity in Algorithms (SOSA), 2025, Page(s) 216-225
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978315.17

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free

Author(s): Greg Bodwin, Bernhard Haeupler, Merav Parter
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Page(s) 2609-2642
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.93

Conference proceedings (36)

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Author(s): Mohsen Ghaffari, Bernhard Haeupler
Published in: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2021
Publisher: ACM
DOI: 10.1145/3465084.3467935

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time

Author(s): Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 2033-2044
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00121

A Time-Optimal Randomized Parallel Algorithm for MIS

Author(s): Mohsen Ghaffari, Bernhard Haeupler
Published in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021
Publisher: ACM
DOI: 10.1137/1.9781611976465.172

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

Author(s): Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
Published in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2022
Publisher: ACM
DOI: 10.1137/1.9781611977073.100

Universally-Optimal Distributed Algorithms for Known Topologies

Author(s): Bernhard Haeupler, David Wajc, Goran Zuzic
Published in: STOC: ACM Symposium on Theory of Computing, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451081

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast

Author(s): Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak
Published in: STOC: ACM Symposium on Theory of Computing, 2023
Publisher: ACM
DOI: 10.1145/3564246.3585202

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

Author(s): Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert E. Tarjan, Jakub Tetĕk
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 2099-2130
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00125

Fully Dynamic Consistent k-Center Clustering

Author(s): Christoph Grunau, Bernhard Haeupler, Rajesh Jayaram, Jakub Lacki, Vaclav Rozhon
Published in: ACM-SIAM Symposium on Discrete Algorithms, 2024
Publisher: ACM

Near-Optimal Directed Low-Diameter Decompositions

Author(s): Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Published in: ICALP: International Colloquium on Automata, Languages and Programming, 2025
Publisher: ICALP

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights

Author(s): Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su
Published in: ESA: European Symposium on Algorithms, 2024
Publisher: ESA: European Symposium on Algorithms

Network Coding Gaps for Completion Times of Multiple Unicasts

Author(s): Bernhard Haeupler, David Wajc, Goran Zuzic
Published in: FOCS: IEEE Symposium on Foundations of Computer Science, 2020
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00053

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

Author(s): Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Published in: ESA: European Symposium on Algorithms, 2022
Publisher: Leibniz Zentrum Informatik
DOI: 10.4230/lipics.esa.2022.63

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Author(s): Goran Zuzic; Bernhard Haeupler; Antti Roeyskoe
Published in: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2023
Publisher: ACM
DOI: 10.1145/3583668.3594585

Fault-Tolerant Spanners against Bounded-Degree Edge Failures

Author(s): Greg Bodwin, Bernhard Haeupler, Merav Parter
Published in: ACM-SIAM Symposium on Discrete Algorithms, 2024
Publisher: ACM

Low-Step Multi-commodity Flow Emulators

Author(s): Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
Published in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Page(s) 71-82
Publisher: ACM
DOI: 10.1145/3618260.3649689

Hop-Constrained Oblivious Routing

Author(s): Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Published in: STOC: ACM Symposium on Theory of Computing, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451098

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Author(s): Vaclav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Published in: STOC: ACM Symposium on Theory of Computing, 2023
Publisher: ACM
DOI: 10.1145/3564246.3585235

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Author(s): Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Published in: DISC: International Symposium on Distributed Computing, 2020
Publisher: Leibnitz Zentrum Informatik
DOI: 10.4230/lipics.disc.2022.6

New Structures and Algorithms for Length-Constrained Expander Decompositions

Author(s): Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan
Published in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Page(s) 1634-1645
Publisher: IEEE
DOI: 10.1109/focs61266.2024.00102

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Author(s): Marcel Bezdrighin; Michael Elkin; Mohsen Ghaffari; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhoň
Published in: SPAA: ACM Symposium on Parallelism in Algorithms and Architectures, 2022
Publisher: ACM
DOI: 10.1145/3490148.3538565

Computation-Aware Data Aggregation

Author(s): Bernhard Haeupler, Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia
Published in: ITCS: ACM-SIGACT Innovations in Theoretical Computer Science Conference, 2020
Publisher: ACM
DOI: 10.4230/lipics.itcs.2020.65

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Author(s): Vaclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Published in: IEEE Symposium on Foundations of Computer Science, 2022
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00107

Writeback Aware Caching

Author(s): Nathan Beckmann, Phillip Gibbons, Bernhard Haeupler, Charles McGuffey
Published in: APOCS: ACM-SIAM Symposium on Algorithmic Principles of Computer Systems, 2020
Publisher: ACM
DOI: 10.1137/1.9781611976021.1

Circuits Resilient to Short-Circuit Errors

Author(s): Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Published in: STOC: ACM Symposium on Theory of Computing, 2022
Publisher: ACM
DOI: 10.1145/3519935.3520007

Near-Optimal Schedules for Simultaneous Multicasts

Author(s): Bernhard Haeupler, David Ellis Hershkowitz, David Wajc
Published in: ICALP: International Colloquium on Automata, Languages and Programming, 2021
Publisher: Leibniz-Zentrum Informatik
DOI: 10.4230/lipics.icalp.2021.78

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound

Author(s): Bernhard Haeupler, Amirbehshad Shahrasbi
Published in: JACM: Journal of the ACM, 2021
Publisher: ACM
DOI: 10.1145/3468265

A Simple Deterministic Distributed Low-Diameter Clustering

Author(s): Vaclav Rozhon, Bernhard Haeupler, Christoph Grunau
Published in: SIAM Symposium on Simplicity in Algorithms, 2023
Publisher: SIAM
DOI: 10.1137/1.9781611977585.ch16

Hop-Constrained Expander Decompositions, Oblivious Routing, and Distributed Universal Optimality

Author(s): Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari
Published in: STOC: ACM Symposium on Theory of Computing, 2022
Publisher: ACM
DOI: 10.1145/3519935.3520026

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

Author(s): Kuan Cheng, Bernhard Haeupler, Venkatesan Guruswami, Xin Li
Published in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021
Publisher: ACM
DOI: 10.1137/1.9781611976465.1

Improved Distributed Network Decomposition, Hitting Sets, and Spanners via Derandomization

Author(s): Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vaclav Rozhon
Published in: ACM-SIAM Symposium on Discrete Algorithms, 2023
Publisher: ACM
DOI: 10.1137/1.9781611977554.ch97

Optimally Resilient Codes for List-Decoding from Insertions and Deletions

Author(s): Bernhard Haeupler, Amirbehshad Shahrasbi, Venkatesan Guruswami
Published in: STOC: ACM Symposium on Theory of Computing, 2020
Publisher: ACM
DOI: 10.1145/3357713.3384262

Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes

Author(s): Haeupler, Bernhard; Shahrasbi, Amirbehshad
Published in: ITW: IEEE Information Theory Workshop, 2022
Publisher: IEEE
DOI: 10.48550/arxiv.2009.13307

Undirected (1+epsilon)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms

Author(s): Vaclav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Published in: STOC: ACM Symposium on Theory of Computing, 2022
Publisher: ACM
DOI: 10.1145/3519935.3520074

Interactive Coding with Small Memory

Author(s): Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Published in: ACM-SIAM Symposium on Discrete Algorithms, 2023
Publisher: ACM
DOI: 10.1137/1.9781611977554.ch137

Tree Embeddings for Hop-Constrained Network Design

Author(s): Bernhard Haeupler, Ellis Hershkowitz, Goran Zuzic
Published in: STOC: ACM Symposium on Theory of Computing, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451053

Polylog-Competitive Deterministic Local Routing and Scheduling

Author(s): Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic
Published in: STOC: ACM Symposium on Theory of Computing, 2024
Publisher: STOC: ACM Symposium on Theory of Computing

Peer reviewed articles (2)

Optimally Resilient Codes for List-Decoding From Insertions and Deletions

Author(s): Venkatesan Guruswami; Bernhard Haeupler; Amirbehshad Shahrasbi
Published in: IEEE Transactions on Information Theory, 2021, ISSN 1557-9654
Publisher: IEEE
DOI: 10.1109/tit.2021.3120910

Synchronization Strings and Codes for Insertions and Deletions - a Survey

Author(s): Bernhard Haeupler, Amirbehshad Shahrasbi
Published in: IEEE Transactions on Information Theory, 2021, ISSN 0018-9448
Publisher: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2021.3056317