Bernhard Haeupler

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 152

Top Venues

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
Low-Step Multi-commodity Flow Emulators. STOC (2024)
Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak
Low-Step Multi-Commodity Flow Emulators. CoRR (2024)
Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic
Polylog-Competitive Deterministic Local Routing and Scheduling. STOC (2024)
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon
-Center Clustering. SODA (2024)
Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Fast and Simple Sorting Using Partial Information. CoRR (2024)
Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic
Polylog-Competitive Deterministic Local Routing and Scheduling. CoRR (2024)
Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
Worst-Case Update Time. CoRR (2024)
Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan
New Structures and Algorithms for Length-Constrained Expander Decompositions. CoRR (2024)
Greg Bodwin, Bernhard Haeupler, Merav Parter
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. SODA (2024)
Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR (2023)
Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA (2023)
Václav Rozhon, Bernhard Haeupler, Christoph Grunau
A Simple Deterministic Distributed Low-Diameter Clustering. SOSA (2023)
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Interactive Coding with Small Memory. SODA (2023)
Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. CoRR (2023)
Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. STOC (2023)
Greg Bodwin, Bernhard Haeupler, Merav Parter
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. CoRR (2023)
Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. STOC (2023)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36 (4) (2023)
Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SIAM J. Discret. Math. 37 (2) (2023)
Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. PODC (2023)
Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan
Parallel Greedy Spanners. CoRR (2023)
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Hop-Constrained Oblivious Routing. SIAM J. Comput. 52 (1) (2023)
Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram
Fully Dynamic Consistent k-Center Clustering. CoRR (2023)
Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su
Parallel and Distributed Exact Single-Source Shortest Paths with Negative Edge Weights. CoRR (2023)
Bernhard Haeupler, Jonas Hübotter, Mohsen Ghaffari
A Cut-Matching Game for Constant-Hop Expanders. CoRR (2022)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC (2022)
Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. SPAA (2022)
Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
-Oblivious Routing. SODA (2022)
Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. STOC (2022)
Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. CoRR (2022)
Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC (2022)
Klim Efremenko, Bernhard Haeupler, Yael Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh Saxena
Circuits Resilient to Short-Circuit Errors. Electron. Colloquium Comput. Complex. (2022)
Michael Elkin, Bernhard Haeupler, Václav Rozhon, Christoph Grunau
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. CoRR (2022)
Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. CoRR (2022)
Klim Efremenko, Bernhard Haeupler, Gillat Kol, Nicolas Resch, Raghuvansh Saxena, Yael Tauman Kalai
Interactive Coding with Small Memory. Electron. Colloquium Comput. Complex. (2022)
Václav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. FOCS (2022)
Bernhard Haeupler, Amirbehshad Shahrasbi
Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes. ITW (2022)
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Circuits resilient to short-circuit errors. STOC (2022)
Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC (2022)
Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. CoRR (2022)
Václav Rozhon, Bernhard Haeupler, Christoph Grunau
A Simple Deterministic Distributed Low-Diameter Clustering. CoRR (2022)
Václav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. CoRR (2022)
Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. CoRR (2021)
Mohsen Ghaffari, Bernhard Haeupler
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. PODC (2021)
Mohsen Ghaffari, Bernhard Haeupler
A Time-Optimal Randomized Parallel Algorithm for MIS. SODA (2021)
Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc
Near-Optimal Schedules for Simultaneous Multicasts. ICALP (2021)
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Hop-constrained oblivious routing. STOC (2021)
Bernhard Haeupler, Amirbehshad Shahrasbi
Synchronization Strings and Codes for Insertions and Deletions - A Survey. IEEE Trans. Inf. Theory 67 (6) (2021)
Bernhard Haeupler, Amirbehshad Shahrasbi
Synchronization Strings and Codes for Insertions and Deletions - a Survey. CoRR (2021)
Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak
Fast Algorithms for Hop-Constrained Flows and Moving Cuts. CoRR (2021)
Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. CoRR (2021)
Bernhard Haeupler
The Quest for Universally-Optimal Distributed Algorithms (Invited Talk). DISC (2021)
Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi
Optimally Resilient Codes for List-Decoding From Insertions and Deletions. IEEE Trans. Inf. Theory 67 (12) (2021)
Bernhard Haeupler, David Wajc, Goran Zuzic
Universally-Optimal Distributed Algorithms for Known Topologies. CoRR (2021)
Bernhard Haeupler, David Wajc, Goran Zuzic
Universally-optimal distributed algorithms for known topologies. STOC (2021)
Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SODA (2021)
Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Tree embeddings for hop-constrained network design. STOC (2021)
Bernhard Haeupler, Taisuke Izumi, Goran Zuzic
Low-Congestion shortcuts without embedding. Distributed Comput. 34 (1) (2021)
Bernhard Haeupler, Amirbehshad Shahrasbi
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. J. ACM 68 (5) (2021)
Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi
Optimally resilient codes for list-decoding from insertions and deletions. STOC (2020)
Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc
Near-Optimal Schedules for Simultaneous Multicasts. CoRR (2020)
Bernhard Haeupler, David Wajc, Goran Zuzic
Network Coding Gaps for Completion Times of Multiple Unicasts. FOCS (2020)
Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. CoRR (2020)
Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Tree Embeddings for Hop-Constrained Network Design. CoRR (2020)
Bernhard Haeupler, Amirbehshad Shahrasbi
Rate-Distance Tradeoffs for List-Decodable Insertion-Deletion Codes. CoRR (2020)
Mohsen Ghaffari, Bernhard Haeupler
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR (2020)
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Hop-Constrained Oblivious Routing. CoRR (2020)
Nathan Beckmann, Phillip B. Gibbons, Bernhard Haeupler, Charles McGuffey
Writeback-Aware Caching. APOCS (2020)
Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia
Computation-Aware Data Aggregation. ITCS (2020)
Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler
Making asynchronous distributed computations robust to noise. Distributed Comput. 32 (5) (2019)
Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi
)-approximating edit distance via indexing. STOC (2019)
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Erasure Correction for Noisy Radio Networks. DISC (2019)
Bernhard Haeupler, David Wajc, Goran Zuzic
Network Coding Gaps for Completion Times of Multiple Unicasts. CoRR (2019)
Nathan Beckmann, Phillip B. Gibbons, Bernhard Haeupler, Charles McGuffey
Writeback-Aware Caching (Brief Announcement). SPAA (2019)
Bernhard Haeupler
Optimal Document Exchange and New Codes for Insertions and Deletions. FOCS (2019)
Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. Electron. Colloquium Comput. Complex. 26 (2019)
Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. SODA (2019)
Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
Reliable communication over highly connected noisy networks. Distributed Comput. 32 (6) (2019)
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister
Optimal Strategies for Patrolling Fences. ICALP (2019)
Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. CoRR (2019)
Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan
Synchronization Strings: List Decoding for Insertions and Deletions. CoRR (2018)
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister
Optimal strategies for patrolling fences. CoRR (2018)
Bernhard Haeupler
Optimal Document Exchange and New Codes for Small Number of Insertions and Deletions. CoRR (2018)
Bernhard Haeupler, Jason Li
Faster Distributed Shortest Path Approximations via Shortcuts. DISC (2018)
Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan
Synchronization Strings: List Decoding for Insertions and Deletions. ICALP (2018)
Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia
A Computational Approach to Organizational Structure. CoRR (2018)
Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. CoRR (2018)
Bernhard Haeupler, Jason Li, Goran Zuzic
Minor Excluded Network Families Admit Fast Distributed Algorithms. CoRR (2018)
Gil Cohen, Bernhard Haeupler, Leonard J. Schulman
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. Electron. Colloquium Comput. Complex. 25 (2018)
Bernhard Haeupler, Amirbehshad Shahrasbi
Synchronization strings: explicit constructions, local decoding, and applications. STOC (2018)
Bernhard Haeupler, Jason Li, Goran Zuzic
Minor Excluded Network Families Admit Fast Distributed Algorithms. PODC (2018)
Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc
Round- and Message-Optimal Distributed Graph Algorithms. PODC (2018)
Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. PODC (2018)
James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC (2018)
Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic
Erasure Correction for Noisy Radio Networks. CoRR (2018)
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64 (10) (2018)
Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler
Making Asynchronous Distributed Computations Robust to Channel Noise. ITCS (2018)
Bernhard Haeupler, Jason Li
Faster Distributed Shortest Path Approximations via Shortcuts. CoRR (2018)
Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. J. ACM 65 (1) (2018)
Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty
Algorithms for Noisy Broadcast under Erasures. CoRR (2018)

Bernhard Haeupler.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernhard Haeupler