Distributed Optimization Beyond Worst-Case Topologies

Informazioni relative al progetto

DistOpt-BydWorstCase

ID dell’accordo di sovvenzione: 949272

DOI

10.3030/949272

Data della firma CE 17 Agosto 2020

Data di avvio 1 Settembre 2020

Data di completamento 31 Gennaio 2026

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 540 000,00

Contributo UE

€ 1 540 000,00

Coordinato da

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Switzerland

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Book chapters (5)

A Cut-Matching Game for Constant-Hop Expanders

Autori: Bernhard Haeupler, Jonas Huebotter, Mohsen Ghaffari
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 1651-1678
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611978322.51

Bidirectional Dijkstra’s Algorithm is Instance-Optimal

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

Fast and Simple Sorting Using Partial Information

Autori: Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhoň, Robert E. Tarjan, Jakub Tětek
Pubblicato in: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2025, Pagina/e 3953-3973
Editore: 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

Autori: Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser
Pubblicato in: 2025 Symposium on Simplicity in Algorithms (SOSA), 2025, Pagina/e 216-225
Editore: 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

Autori: Greg Bodwin, Bernhard Haeupler, Merav Parter
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 2609-2642
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.93

Conference proceedings (36)

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Autori: Mohsen Ghaffari, Bernhard Haeupler
Pubblicato in: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2021
Editore: ACM
DOI: 10.1145/3465084.3467935

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

Autori: Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 2033-2044
Editore: IEEE
DOI: 10.1109/focs61266.2024.00121

A Time-Optimal Randomized Parallel Algorithm for MIS

Autori: Mohsen Ghaffari, Bernhard Haeupler
Pubblicato in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021
Editore: ACM
DOI: 10.1137/1.9781611976465.172

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

Autori: Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
Pubblicato in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2022
Editore: ACM
DOI: 10.1137/1.9781611977073.100

Universally-Optimal Distributed Algorithms for Known Topologies

Autori: Bernhard Haeupler, David Wajc, Goran Zuzic
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2021
Editore: ACM
DOI: 10.1145/3406325.3451081

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

Autori: Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2023
Editore: ACM
DOI: 10.1145/3564246.3585202

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps

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

Fully Dynamic Consistent k-Center Clustering

Autori: Christoph Grunau, Bernhard Haeupler, Rajesh Jayaram, Jakub Lacki, Vaclav Rozhon
Pubblicato in: ACM-SIAM Symposium on Discrete Algorithms, 2024
Editore: ACM

Near-Optimal Directed Low-Diameter Decompositions

Autori: Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Pubblicato in: ICALP: International Colloquium on Automata, Languages and Programming, 2025
Editore: ICALP

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

Autori: Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su
Pubblicato in: ESA: European Symposium on Algorithms, 2024
Editore: ESA: European Symposium on Algorithms

Network Coding Gaps for Completion Times of Multiple Unicasts

Autori: Bernhard Haeupler, David Wajc, Goran Zuzic
Pubblicato in: FOCS: IEEE Symposium on Foundations of Computer Science, 2020
Editore: IEEE
DOI: 10.1109/focs46700.2020.00053

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

Autori: Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Pubblicato in: ESA: European Symposium on Algorithms, 2022
Editore: Leibniz Zentrum Informatik
DOI: 10.4230/lipics.esa.2022.63

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Autori: Goran Zuzic; Bernhard Haeupler; Antti Roeyskoe
Pubblicato in: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2023
Editore: ACM
DOI: 10.1145/3583668.3594585

Fault-Tolerant Spanners against Bounded-Degree Edge Failures

Autori: Greg Bodwin, Bernhard Haeupler, Merav Parter
Pubblicato in: ACM-SIAM Symposium on Discrete Algorithms, 2024
Editore: ACM

Low-Step Multi-commodity Flow Emulators

Autori: Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Pagina/e 71-82
Editore: ACM
DOI: 10.1145/3618260.3649689

Hop-Constrained Oblivious Routing

Autori: Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2021
Editore: ACM
DOI: 10.1145/3406325.3451098

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

Autori: Vaclav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2023
Editore: ACM
DOI: 10.1145/3564246.3585235

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Autori: Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Pubblicato in: DISC: International Symposium on Distributed Computing, 2020
Editore: Leibnitz Zentrum Informatik
DOI: 10.4230/lipics.disc.2022.6

New Structures and Algorithms for Length-Constrained Expander Decompositions

Autori: Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan
Pubblicato in: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), 2024, Pagina/e 1634-1645
Editore: IEEE
DOI: 10.1109/focs61266.2024.00102

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Autori: Marcel Bezdrighin; Michael Elkin; Mohsen Ghaffari; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhoň
Pubblicato in: SPAA: ACM Symposium on Parallelism in Algorithms and Architectures, 2022
Editore: ACM
DOI: 10.1145/3490148.3538565

Computation-Aware Data Aggregation

Autori: Bernhard Haeupler, Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia
Pubblicato in: ITCS: ACM-SIGACT Innovations in Theoretical Computer Science Conference, 2020
Editore: ACM
DOI: 10.4230/lipics.itcs.2020.65

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

Autori: Vaclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Pubblicato in: IEEE Symposium on Foundations of Computer Science, 2022
Editore: IEEE
DOI: 10.1109/focs54457.2022.00107

Writeback Aware Caching

Autori: Nathan Beckmann, Phillip Gibbons, Bernhard Haeupler, Charles McGuffey
Pubblicato in: APOCS: ACM-SIAM Symposium on Algorithmic Principles of Computer Systems, 2020
Editore: ACM
DOI: 10.1137/1.9781611976021.1

Circuits Resilient to Short-Circuit Errors

Autori: Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2022
Editore: ACM
DOI: 10.1145/3519935.3520007

Near-Optimal Schedules for Simultaneous Multicasts

Autori: Bernhard Haeupler, David Ellis Hershkowitz, David Wajc
Pubblicato in: ICALP: International Colloquium on Automata, Languages and Programming, 2021
Editore: Leibniz-Zentrum Informatik
DOI: 10.4230/lipics.icalp.2021.78

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

Autori: Bernhard Haeupler, Amirbehshad Shahrasbi
Pubblicato in: JACM: Journal of the ACM, 2021
Editore: ACM
DOI: 10.1145/3468265

A Simple Deterministic Distributed Low-Diameter Clustering

Autori: Vaclav Rozhon, Bernhard Haeupler, Christoph Grunau
Pubblicato in: SIAM Symposium on Simplicity in Algorithms, 2023
Editore: SIAM
DOI: 10.1137/1.9781611977585.ch16

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

Autori: Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2022
Editore: ACM
DOI: 10.1145/3519935.3520026

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

Autori: Kuan Cheng, Bernhard Haeupler, Venkatesan Guruswami, Xin Li
Pubblicato in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021
Editore: ACM
DOI: 10.1137/1.9781611976465.1

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

Autori: Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vaclav Rozhon
Pubblicato in: ACM-SIAM Symposium on Discrete Algorithms, 2023
Editore: ACM
DOI: 10.1137/1.9781611977554.ch97

Optimally Resilient Codes for List-Decoding from Insertions and Deletions

Autori: Bernhard Haeupler, Amirbehshad Shahrasbi, Venkatesan Guruswami
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2020
Editore: ACM
DOI: 10.1145/3357713.3384262

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

Autori: Haeupler, Bernhard; Shahrasbi, Amirbehshad
Pubblicato in: ITW: IEEE Information Theory Workshop, 2022
Editore: IEEE
DOI: 10.48550/arxiv.2009.13307

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

Autori: Vaclav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2022
Editore: ACM
DOI: 10.1145/3519935.3520074

Interactive Coding with Small Memory

Autori: Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Pubblicato in: ACM-SIAM Symposium on Discrete Algorithms, 2023
Editore: ACM
DOI: 10.1137/1.9781611977554.ch137

Tree Embeddings for Hop-Constrained Network Design

Autori: Bernhard Haeupler, Ellis Hershkowitz, Goran Zuzic
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2021
Editore: ACM
DOI: 10.1145/3406325.3451053

Polylog-Competitive Deterministic Local Routing and Scheduling

Autori: Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic
Pubblicato in: STOC: ACM Symposium on Theory of Computing, 2024
Editore: STOC: ACM Symposium on Theory of Computing

Peer reviewed articles (2)

Optimally Resilient Codes for List-Decoding From Insertions and Deletions

Autori: Venkatesan Guruswami; Bernhard Haeupler; Amirbehshad Shahrasbi
Pubblicato in: IEEE Transactions on Information Theory, 2021, ISSN 1557-9654
Editore: IEEE
DOI: 10.1109/tit.2021.3120910

Synchronization Strings and Codes for Insertions and Deletions - a Survey

Autori: Bernhard Haeupler, Amirbehshad Shahrasbi
Pubblicato in: IEEE Transactions on Information Theory, 2021, ISSN 0018-9448
Editore: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2021.3056317