Skip to main content
European Commission logo print header

Distributed Optimization Beyond Worst-Case Topologies

Publikacje

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Autorzy: Mohsen Ghaffari, Bernhard Haeupler
Opublikowane w: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2021
Wydawca: ACM
DOI: 10.1145/3465084.3467935

A Time-Optimal Randomized Parallel Algorithm for MIS

Autorzy: Mohsen Ghaffari, Bernhard Haeupler
Opublikowane w: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021
Wydawca: ACM
DOI: 10.1137/1.9781611976465.172

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

Autorzy: Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
Opublikowane w: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2022
Wydawca: ACM
DOI: 10.1137/1.9781611977073.100

Universally-Optimal Distributed Algorithms for Known Topologies

Autorzy: Bernhard Haeupler, David Wajc, Goran Zuzic
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2021
Wydawca: ACM
DOI: 10.1145/3406325.3451081

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

Autorzy: Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2023
Wydawca: ACM
DOI: 10.1145/3564246.3585202

Fully Dynamic Consistent k-Center Clustering

Autorzy: Christoph Grunau, Bernhard Haeupler, Rajesh Jayaram, Jakub Lacki, Vaclav Rozhon
Opublikowane w: ACM-SIAM Symposium on Discrete Algorithms, 2024
Wydawca: ACM

Network Coding Gaps for Completion Times of Multiple Unicasts

Autorzy: Bernhard Haeupler, David Wajc, Goran Zuzic
Opublikowane w: FOCS: IEEE Symposium on Foundations of Computer Science, 2020
Wydawca: IEEE
DOI: 10.1109/focs46700.2020.00053

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

Autorzy: Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Opublikowane w: ESA: European Symposium on Algorithms, 2022
Wydawca: Leibniz Zentrum Informatik
DOI: 10.4230/lipics.esa.2022.63

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Autorzy: Goran Zuzic; Bernhard Haeupler; Antti Roeyskoe
Opublikowane w: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2023
Wydawca: ACM
DOI: 10.1145/3583668.3594585

Fault-Tolerant Spanners against Bounded-Degree Edge Failures

Autorzy: Greg Bodwin, Bernhard Haeupler, Merav Parter
Opublikowane w: ACM-SIAM Symposium on Discrete Algorithms, 2024
Wydawca: ACM

Hop-Constrained Oblivious Routing

Autorzy: Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2021
Wydawca: ACM
DOI: 10.1145/3406325.3451098

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

Autorzy: Vaclav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2023
Wydawca: ACM
DOI: 10.1145/3564246.3585235

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Autorzy: Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Opublikowane w: DISC: International Symposium on Distributed Computing, 2020
Wydawca: Leibnitz Zentrum Informatik
DOI: 10.4230/lipics.disc.2022.6

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

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

Computation-Aware Data Aggregation

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

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

Autorzy: Vaclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Opublikowane w: IEEE Symposium on Foundations of Computer Science, 2022
Wydawca: IEEE
DOI: 10.1109/focs54457.2022.00107

Writeback Aware Caching

Autorzy: Nathan Beckmann, Phillip Gibbons, Bernhard Haeupler, Charles McGuffey
Opublikowane w: APOCS: ACM-SIAM Symposium on Algorithmic Principles of Computer Systems, 2020
Wydawca: ACM
DOI: 10.1137/1.9781611976021.1

Circuits Resilient to Short-Circuit Errors

Autorzy: Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2022
Wydawca: ACM
DOI: 10.1145/3519935.3520007

Near-Optimal Schedules for Simultaneous Multicasts

Autorzy: Bernhard Haeupler, David Ellis Hershkowitz, David Wajc
Opublikowane w: ICALP: International Colloquium on Automata, Languages and Programming, 2021
Wydawca: Leibniz-Zentrum Informatik
DOI: 10.4230/lipics.icalp.2021.78

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

Autorzy: Bernhard Haeupler, Amirbehshad Shahrasbi
Opublikowane w: JACM: Journal of the ACM, 2021
Wydawca: ACM
DOI: 10.1145/3468265

A Simple Deterministic Distributed Low-Diameter Clustering

Autorzy: Vaclav Rozhon, Bernhard Haeupler, Christoph Grunau
Opublikowane w: SIAM Symposium on Simplicity in Algorithms, 2023
Wydawca: SIAM
DOI: 10.1137/1.9781611977585.ch16

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

Autorzy: Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2022
Wydawca: ACM
DOI: 10.1145/3519935.3520026

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

Autorzy: Kuan Cheng, Bernhard Haeupler, Venkatesan Guruswami, Xin Li
Opublikowane w: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021
Wydawca: ACM
DOI: 10.1137/1.9781611976465.1

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

Autorzy: Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vaclav Rozhon
Opublikowane w: ACM-SIAM Symposium on Discrete Algorithms, 2023
Wydawca: ACM
DOI: 10.1137/1.9781611977554.ch97

Optimally Resilient Codes for List-Decoding from Insertions and Deletions

Autorzy: Bernhard Haeupler, Amirbehshad Shahrasbi, Venkatesan Guruswami
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2020
Wydawca: ACM
DOI: 10.1145/3357713.3384262

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

Autorzy: Haeupler, Bernhard; Shahrasbi, Amirbehshad
Opublikowane w: ITW: IEEE Information Theory Workshop, 2022
Wydawca: IEEE
DOI: 10.48550/arxiv.2009.13307

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

Autorzy: Vaclav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2022
Wydawca: ACM
DOI: 10.1145/3519935.3520074

Interactive Coding with Small Memory

Autorzy: Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Opublikowane w: ACM-SIAM Symposium on Discrete Algorithms, 2023
Wydawca: ACM
DOI: 10.1137/1.9781611977554.ch137

Tree Embeddings for Hop-Constrained Network Design

Autorzy: Bernhard Haeupler, Ellis Hershkowitz, Goran Zuzic
Opublikowane w: STOC: ACM Symposium on Theory of Computing, 2021
Wydawca: ACM
DOI: 10.1145/3406325.3451053

Optimally Resilient Codes for List-Decoding From Insertions and Deletions

Autorzy: Venkatesan Guruswami; Bernhard Haeupler; Amirbehshad Shahrasbi
Opublikowane w: IEEE Transactions on Information Theory, 2021, ISSN 1557-9654
Wydawca: IEEE
DOI: 10.1109/tit.2021.3120910

Synchronization Strings and Codes for Insertions and Deletions - a Survey

Autorzy: Bernhard Haeupler, Amirbehshad Shahrasbi
Opublikowane w: IEEE Transactions on Information Theory, 2021, ISSN 0018-9448
Wydawca: Institute of Electrical and Electronics Engineers
DOI: 10.1109/tit.2021.3056317

Wyszukiwanie danych OpenAIRE...

Podczas wyszukiwania danych OpenAIRE wystąpił błąd

Brak wyników