| 2026 | ICALP | Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. | Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Kouck |
| 2026 | ICALP | Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. | Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang |
| 2026 | STOC | Reviving Thorup's Shortcut Conjecture. | Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller |
| 2026 | STOC | Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers. | Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak |
| 2026 | STOC | DAG Projections: Reducing Distance and Flow Problems to DAGs. | Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak |
| 2026 | STOC | A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures. | Bernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol Saranurak |
| 2025 | ESA | Graph Decompositions and Length-Constrained Expanders (Invited Talk). | Bernhard Haeupler |
| 2025 | ESA | Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. | Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | FOCS | Parallel (1+ε)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work. | Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang |
| 2025 | ICALP | Near-Optimal Directed Low-Diameter Decompositions. | Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov |
| 2025 | SODA | A Cut-Matching Game for Constant-Hop Expanders. | Bernhard Haeupler, Jonas Hbotter, Mohsen Ghaffari |
| 2025 | SODA | Fast and Simple Sorting Using Partial Information. | Bernhard Haeupler, Richard Hladk, John Iacono, Vclav Rozhon, Robert E. Tarjan, Jakub Tetek |
| 2024 | ESA | Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. | Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su |
| 2024 | FOCS | Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. | Bernhard Haeupler, Richard Hladk, Vclav Rozhon, Robert E. Tarjan, Jakub Tetek |
| 2024 | FOCS | New Structures and Algorithms for Length-Constrained Expander Decompositions. | Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan |
| 2024 | FOCS | Dynamic Deterministic Constant-Approximate Distance Oracles with n | Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak |
| 2024 | SODA | Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. | Greg Bodwin, Bernhard Haeupler, Merav Parter |
| 2024 | SODA | Fully Dynamic Consistent | Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Vclav Rozhon |
| 2024 | STOC | Low-Step Multi-commodity Flow Emulators. | Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak |
| 2024 | STOC | Polylog-Competitive Deterministic Local Routing and Scheduling. | Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic |
| 2023 | PODC | Sparse Semi-Oblivious Routing: Few Random Paths Suffice. | Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe |
| 2023 | SODA | Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. | Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vclav Rozhon |
| 2023 | SODA | Interactive Coding with Small Memory. | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
| 2023 | STOC | Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. | Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak |
| 2023 | STOC | Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. | Vclav Rozhon, Bernhard Haeupler, Anders Martinsson, Christoph Grunau, Goran Zuzic |
| 2022 | FOCS | Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. | Vclav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler |
| 2022 | ITW | Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes. | Bernhard Haeupler, Amirbehshad Shahrasbi |
| 2022 | PODC | Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. | Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis |
| 2022 | SODA | Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ | Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun |
| 2022 | STOC | Circuits resilient to short-circuit errors. | Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena |
| 2022 | STOC | Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. | Bernhard Haeupler, Harald Rcke, Mohsen Ghaffari |
| 2022 | STOC | Undirected (1+ | Vclav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li |
| 2022 | SPAA | Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. | Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Vclav Rozhon |
| 2021 | ICALP | Near-Optimal Schedules for Simultaneous Multicasts. | Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc |
| 2021 | PODC | Low-Congestion Shortcuts for Graphs Excluding Dense Minors. | Mohsen Ghaffari, Bernhard Haeupler |
| 2021 | SODA | Efficient Linear and Affine Codes for Correcting Insertions/Deletions. | Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li |
| 2021 | SODA | A Time-Optimal Randomized Parallel Algorithm for MIS. | Mohsen Ghaffari, Bernhard Haeupler |
| 2021 | STOC | Hop-constrained oblivious routing. | Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic |
| 2021 | STOC | Tree embeddings for hop-constrained network design. | Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic |
| 2021 | STOC | Universally-optimal distributed algorithms for known topologies. | Bernhard Haeupler, David Wajc, Goran Zuzic |
| 2020 | FOCS | Network Coding Gaps for Completion Times of Multiple Unicasts. | Bernhard Haeupler, David Wajc, Goran Zuzic |
| 2020 | STOC | Optimally resilient codes for list-decoding from insertions and deletions. | Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi |
| 2019 | FOCS | Optimal Document Exchange and New Codes for Insertions and Deletions. | Bernhard Haeupler |
| 2019 | ICALP | Optimal Strategies for Patrolling Fences. | Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister |
| 2019 | SODA | Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. | Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu |
| 2019 | STOC | Near-linear time insertion-deletion codes and (1+ | Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi |
| 2019 | SPAA | Writeback-Aware Caching (Brief Announcement). | Nathan Beckmann, Phillip B. Gibbons, Bernhard Haeupler, Charles McGuffey |
| 2018 | ICALP | Algorithms for Noisy Broadcast with Erasures. | Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty |
| 2018 | ICALP | Synchronization Strings: List Decoding for Insertions and Deletions. | Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan |
| 2018 | ICALP | Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. | Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik |
| 2018 | PODC | Round- and Message-Optimal Distributed Graph Algorithms. | Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc |
| 2018 | PODC | Minor Excluded Network Families Admit Fast Distributed Algorithms. | Bernhard Haeupler, Jason Li, Goran Zuzic |
| 2018 | PODC | Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. | Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su |
| 2018 | STOC | Explicit binary tree codes with polylogarithmic size alphabet. | Gil Cohen, Bernhard Haeupler, Leonard J. Schulman |
| 2018 | STOC | Synchronization strings: explicit constructions, local decoding, and applications. | Bernhard Haeupler, Amirbehshad Shahrasbi |
| 2017 | PODC | Broadcasting in Noisy Radio Networks. | Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic |
| 2017 | SODA | Parallel algorithms and concentration bounds for the Lovsz Local Lemma via witness-DAGs. | Bernhard Haeupler, David G. Harris |
| 2017 | SODA | Bridging the Capacity Gap Between Interactive and One-Way Communication. | Bernhard Haeupler, Ameya Velingker |
| 2017 | STOC | Synchronization strings: codes for insertions and deletions approaching the Singleton bound. | Bernhard Haeupler, Amirbehshad Shahrasbi |
| 2016 | PODC | Reliable Communication over Highly Connected Noisy Networks. | Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler |
| 2016 | PODC | Distributed Algorithms for Planar Networks I: Planar Embedding. | Mohsen Ghaffari, Bernhard Haeupler |
| 2016 | PODC | Low-Congestion Shortcuts without Embedding. | Bernhard Haeupler, Taisuke Izumi, Goran Zuzic |
| 2016 | PODC | A Faster Distributed Radio Broadcast Primitive: Extended Abstract. | Bernhard Haeupler, David Wajc |
| 2016 | SODA | Towards Optimal Deterministic Coding for Interactive Communication. | Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson |
| 2016 | SODA | Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. | Mohsen Ghaffari, Bernhard Haeupler |
| 2016 | STOC | Constant-rate coding for multiparty interactive communication is impossible. | Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler |
| 2015 | PODC | Distributed Resource Discovery in Sub-Logarithmic Time. | Bernhard Haeupler, Dahlia Malkhi |
| 2015 | SODA | Tight Bounds on Vertex Connectivity Under Vertex Sampling. | Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn |
| 2015 | SODA | Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. | Ran Gelles, Bernhard Haeupler |
| 2014 | FOCS | Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. | Mohsen Ghaffari, Bernhard Haeupler |
| 2014 | FOCS | Interactive Channel Capacity Revisited. | Bernhard Haeupler |
| 2014 | ITW | Repeated deletion channels. | Bernhard Haeupler, Michael Mitzenmacher |
| 2014 | PODC | Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. | Ofer Feinerman, Bernhard Haeupler, Amos Korman |
| 2014 | PODC | Optimal gossip with direct addressing. | Bernhard Haeupler, Dahlia Malkhi |
| 2014 | SODA | Broadcast Throughput in Radio Networks: Routing vs. Network Coding. | Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian |
| 2014 | STOC | Optimal error rates for interactive coding I: adaptivity and other settings. | Mohsen Ghaffari, Bernhard Haeupler, Madhu Sudan |
| 2013 | PODC | Randomized broadcast in radio networks with collision detection. | Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian |
| 2013 | SODA | Near Optimal Leader Election in Multi-Hop Radio Networks. | Mohsen Ghaffari, Bernhard Haeupler |
| 2013 | SODA | Simple, Fast and Deterministic Gossip and Rumor Spreading. | Bernhard Haeupler |
| 2013 | SIROCCO | Self-adjusting Grid Networks to Minimize Expected Path Length. | Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker |
| 2012 | ISIT | Network coded gossip with correlated data. | Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Mdard |
| 2012 | STOC | Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. | Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov |
| 2012 | SPAA | Discovery through gossip. | Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun |
| 2011 | ISIT | One packet suffices - Highly efficient packetized Network Coding With finite memory. | Bernhard Haeupler, Muriel Mdard |
| 2011 | ITW | Optimality of network coding with buffers. | Bernhard Haeupler, Minji Kim, Muriel Mdard |
| 2011 | PODC | Faster information dissemination in dynamic networks via network coding. | Bernhard Haeupler, David R. Karger |
| 2011 | STOC | Analyzing network coding gossip made easy. | Bernhard Haeupler |
| 2010 | FOCS | New Constructive Aspects of the Lovasz Local Lemma. | Bernhard Haeupler, Barna Saha, Aravind Srinivasan |
| 2010 | ISAAC | Testing Simultaneous Planarity When the Common Graph Is 2-Connected. | Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw |
| 2010 | SODA | Deterministic Algorithms for the Lovsz Local Lemma. | Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler |
| 2009 | ESA | Rank-Pairing Heaps. | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan |
| 2009 | WADS | Rank-Balanced Trees. | Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan |
| 2008 | ICALP | Faster Algorithms for Incremental Topological Ordering. | Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan |