B. Haeupler

Most-cited papers

Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
M. Ghaffari, B. Haeupler
2016ACM-SIAM Symposium on Discrete Algorithms115 citations Open access
Semantic Scholar
Synchronization strings: codes for insertions and deletions approaching the Singleton bound
B. Haeupler, Amirbehshad Shahrasbi
2017Symposium on the Theory of Computing100 citations Open access
Semantic Scholar
SplayNet: Towards Locally Self-Adjusting Networks
S. Schmid, C. Avin, C. Scheideler, Michael Borokhovich +2 more
2016IEEE/ACM Transactions on Networking80 citations Open access
Semantic Scholar
Optimal Document Exchange and New Codes for Insertions and Deletions
B. Haeupler
2018IEEE Annual Symposium on Foundations of Computer Science76 citations Open access
Semantic Scholar
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps
B. Haeupler, Richard Hladík, Václav Rozhoň, R. Tarjan +1 more
2023IEEE Annual Symposium on Foundations of Computer Science72 citations Open access
Semantic Scholar
Synchronization Strings and Codes for Insertions and Deletions—A Survey
B. Haeupler, Amirbehshad Shahrasbi
2021IEEE Transactions on Information Theory55 citations Open access
Semantic Scholar
Round- and Message-Optimal Distributed Graph Algorithms
B. Haeupler, D. Hershkowitz, David Wajc
2018ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing54 citations Open access
Semantic Scholar
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
K. Efremenko, R. Gelles, B. Haeupler
2015IEEE Transactions on Information Theory54 citations Open access
Semantic Scholar
Synchronization Strings: List Decoding for Insertions and Deletions
B. Haeupler, Amirbehshad Shahrasbi, M. Sudan
2018International Colloquium on Automata, Languages and Programming53 citations
Semantic Scholar
Universally-optimal distributed algorithms for known topologies
B. Haeupler, David Wajc, Goran Zuzic
2021Symposium on the Theory of Computing48 citations Open access
Semantic Scholar
Optimally Resilient Codes for List-Decoding From Insertions and Deletions
V. Guruswami, B. Haeupler, Amirbehshad Shahrasbi
2019IEEE Transactions on Information Theory47 citations Open access
Semantic Scholar
Synchronization strings: explicit constructions, local decoding, and applications
B. Haeupler, Amirbehshad Shahrasbi
2017Symposium on the Theory of Computing46 citations Open access
Semantic Scholar
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality
B. Haeupler, H. Räcke, M. Ghaffari
2022Symposium on the Theory of Computing45 citations
Semantic Scholar
Low-Congestion shortcuts without embedding
B. Haeupler, Taisuke Izumi, Goran Zuzic
2016Distributed computing44 citations Open access
Semantic Scholar
Reliable communication over highly connected noisy networks
N. Alon, M. Braverman, K. Efremenko, R. Gelles +1 more
2016Distributed computing44 citations Open access
Semantic Scholar
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs
B. Haeupler, Taisuke Izumi, Goran Zuzic
2016International Symposium on Distributed Computing43 citations
Semantic Scholar
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
R. Gelles, B. Haeupler
2015SIAM journal on computing (Print)43 citations
Semantic Scholar
Efficient Linear and Affine Codes for Correcting Insertions/Deletions
Kuan Cheng, V. Guruswami, B. Haeupler, Xin Li
2020ACM-SIAM Symposium on Discrete Algorithms41 citations
Semantic Scholar
Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing
B. Haeupler, A. Rubinstein, Amirbehshad Shahrasbi
2018Symposium on the Theory of Computing40 citations Open access
Semantic Scholar
Faster Distributed Shortest Path Approximations via Shortcuts
B. Haeupler, Jason Li
2018International Symposium on Distributed Computing38 citations
Semantic Scholar
Distributed Algorithms for Planar Networks I: Planar Embedding
M. Ghaffari, B. Haeupler
2016ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing38 citations
Semantic Scholar
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization
M. Ghaffari, C. Grunau, B. Haeupler, S. Ilchi +1 more
2022ACM-SIAM Symposium on Discrete Algorithms37 citations Open access
Semantic Scholar
Constant-rate coding for multiparty interactive communication is impossible
M. Braverman, K. Efremenko, R. Gelles, B. Haeupler
2016Symposium on the Theory of Computing37 citations Open access
Semantic Scholar
Consistent Weighted Sampling Made Fast, Small, and Easy
B. Haeupler, M. Manasse, Kunal Talwar
2014arXiv.org36 citations
Semantic Scholar
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
B. Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik
2017International Colloquium on Automata, Languages and Programming35 citations
Semantic Scholar
Towards Optimal Deterministic Coding for Interactive Communication
R. Gelles, B. Haeupler, Gillat Kol, Noga Ron-Zewi +1 more
2016ACM-SIAM Symposium on Discrete Algorithms35 citations
Semantic Scholar
Minor Excluded Network Families Admit Fast Distributed Algorithms
B. Haeupler, Jason Li, Goran Zuzic
2018ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing33 citations Open access
Semantic Scholar
Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhoň, C. Grunau, B. Haeupler, Goran Zuzic +1 more
2022arXiv.org32 citations Open access
Semantic Scholar
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing
Goran Zuzic, Gramoz Goranci, Mingquan Ye, B. Haeupler +1 more
2021ACM-SIAM Symposium on Discrete Algorithms31 citations Open access
Semantic Scholar
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets
Kuan Cheng, B. Haeupler, X. Li, Amirbehshad Shahrasbi +1 more
2019ACM-SIAM Symposium on Discrete Algorithms31 citations Open access
Semantic Scholar
Hop-constrained oblivious routing
M. Ghaffari, B. Haeupler, Goran Zuzic
2020Symposium on the Theory of Computing30 citations
Semantic Scholar
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
M. Ghaffari, B. Haeupler
2020ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing29 citations Open access
Semantic Scholar
A Faster Distributed Radio Broadcast Primitive: Extended Abstract
B. Haeupler, David Wajc
2016ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing28 citations Open access
Semantic Scholar
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs
B. Haeupler, David G. Harris
2015ACM-SIAM Symposium on Discrete Algorithms27 citations Open access
Semantic Scholar
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances
Václav Rozhoň, B. Haeupler, A. Martinsson, C. Grunau +1 more
2022Symposium on the Theory of Computing26 citations Open access
Semantic Scholar
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications
Václav Rozhoň, Michael Elkin, C. Grunau, B. Haeupler
2022IEEE Annual Symposium on Foundations of Computer Science26 citations Open access
Semantic Scholar
Tree embeddings for hop-constrained network design
B. Haeupler, D. Hershkowitz, Goran Zuzic
2020Symposium on the Theory of Computing23 citations Open access
Semantic Scholar
Fully Dynamic Consistent k-Center Clustering
J. Lacki, B. Haeupler, C. Grunau, Václav Rozhoň +1 more
2023ACM-SIAM Symposium on Discrete Algorithms22 citations Open access
Semantic Scholar
Communication with Partial Noiseless Feedback
B. Haeupler, Pritish Kamath, A. Velingker
2015International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques22 citations
Semantic Scholar
Network Coding Gaps for Completion Times of Multiple Unicasts
B. Haeupler, David Wajc, Goran Zuzic
2019IEEE Annual Symposium on Foundations of Computer Science20 citations Open access
Semantic Scholar
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast
B. Haeupler, D. Hershkowitz, Thatchaphol Saranurak
2021Symposium on the Theory of Computing18 citations Open access
Semantic Scholar
Making asynchronous distributed computations robust to noise
K. Censor-Hillel, R. Gelles, B. Haeupler
2017Distributed computing18 citations
Semantic Scholar
Explicit binary tree codes with polylogarithmic size alphabet
Gil Cohen, B. Haeupler, L. Schulman
2018Electron. Colloquium Comput. Complex.17 citations
Semantic Scholar
Broadcasting in Noisy Radio Networks
K. Censor-Hillel, B. Haeupler, D. Hershkowitz, Goran Zuzic
2017ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing17 citations Open access
Semantic Scholar
A Cut-Matching Game for Constant-Hop Expanders
B. Haeupler, Jonas Hübotter, M. Ghaffari
2022ACM-SIAM Symposium on Discrete Algorithms16 citations Open access
Semantic Scholar
Optimal Document Exchange and New Codes for Small Number of Insertions and Deletions
B. Haeupler
2018arXiv.org16 citations
Semantic Scholar
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations
B. Haeupler, Jeet Mohapatra, Hsin-Hao Su
2017ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing16 citations Open access
Semantic Scholar
Explicit Capacity Approaching Coding for Interactive Communication
R. Gelles, B. Haeupler, Gillat Kol, Noga Ron-Zewi +1 more
2018IEEE Transactions on Information Theory14 citations Open access
Semantic Scholar
Bridging the Capacity Gap Between Interactive and One-Way Communication
B. Haeupler, A. Velingker
2016ACM-SIAM Symposium on Discrete Algorithms14 citations
Semantic Scholar
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets
Kuan Cheng, B. Haeupler, Xin Li, Amirbehshad Shahrasbi +1 more
2017arXiv.org13 citations
Semantic Scholar