Faster Algorithms for Incremental Topological Ordering. - Bernhard Haeupler; Telikepalli Kavitha; Rogers Mathew; Siddhartha Sen 001; Robert Endre Tarjan (ICALP (1), 2008)

Incremental Topological Ordering and Strong Component Maintenance - Bernhard Haeupler; Siddhartha Sen 001; Robert Endre Tarjan (CoRR, 2008)

Planarity Algorithms via PQ-Trees (Extended Abstract). - Bernhard Haeupler; Robert Endre Tarjan (Electron. Notes Discret. Math., 2008)

Finding a feasible flow in a strongly connected network. - Bernhard Haeupler; Robert Endre Tarjan (Oper. Res. Lett., 2008)

Heaps Simplified - Bernhard Haeupler; Siddhartha Sen 001; Robert Endre Tarjan (CoRR, 2009)

Robust Regulatory Networks - Arnab Bhattacharyya 001; Bernhard Haeupler (CoRR, 2009)

Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections - Karthekeyan Chandrasekaran; Navin Goyal; Bernhard Haeupler (CoRR, 2010)

One packet suffices - Highly efficient packetized Network Coding With finite memory. - Bernhard Haeupler; Muriel Médard (ISIT, 2011)

Optimality of network coding with buffers. - Bernhard Haeupler; Minji Kim 007; Muriel Médard (ITW, 2011)

Faster information dissemination in dynamic networks via network coding. - Bernhard Haeupler; David R. Karger (PODC, 2011)

Online Stochastic Weighted Matching: Improved Approximation Algorithms. - Bernhard Haeupler; Vahab S. Mirrokni; Morteza Zadimoghaddam (WINE, 2011)

Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive. - William I. Gasarch; Bernhard Haeupler (Electron. J. Comb., 2011)

Optimality of Network Coding in Packet Networks - Bernhard Haeupler; Minji Kim 007; Muriel Médard (CoRR, 2011)

Computing a Maximal Independent Set Using Beeps - Alejandro Cornejo; Bernhard Haeupler; Fabian Kuhn (CoRR, 2011)

Self-Adjusting Networks to Minimize Expected Path Length - Chen Avin; Michael Borokhovich; Bernhard Haeupler; Zvi Lotker (CoRR, 2011)

New Constructive Aspects of the Lovász Local Lemma. - Bernhard Haeupler; Barna Saha; Aravind Srinivasan (J. ACM, 2011)

Rank-Pairing Heaps. - Bernhard Haeupler; Siddhartha Sen 001; Robert Endre Tarjan (SIAM J. Comput., 2011)

Network coded gossip with correlated data. - Bernhard Haeupler; Asaf Cohen 001; Chen Avin; Muriel Médard (ISIT, 2012)

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 (STOC, 2012)

Bounded-Contention Coding for Wireless Networks in the High SNR Regime. - Keren Censor-Hillel; Bernhard Haeupler; Nancy A. Lynch; Muriel Médard (DISC, 2012)

Bounds on Contention Management in Radio Networks. - Mohsen Ghaffari 001; Bernhard Haeupler; Nancy A. Lynch; Calvin C. Newport (DISC, 2012)

Lower Bounds on Information Dissemination in Dynamic Networks. - Bernhard Haeupler; Fabian Kuhn (DISC, 2012)

Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. - Stefan Schmid 001; Chen Avin; Christian Scheideler; Bernhard Haeupler; Zvi Lotker (DISC, 2012)

The Complexity of Multi-Message Broadcast in Radio Networks with Known Topology - Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (CoRR, 2012)

Tighter Worst-Case Bounds on Algebraic Gossip. - Bernhard Haeupler (IEEE Commun. Lett., 2012)

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. - Bernhard Haeupler; Telikepalli Kavitha; Rogers Mathew; Siddhartha Sen 001; Robert Endre Tarjan (ACM Trans. Algorithms, 2012)

Locally Self-Adjusting Tree Networks. - Chen Avin; Bernhard Haeupler; Zvi Lotker; Christian Scheideler; Stefan Schmid 001 (IPDPS, 2013)

Near Optimal Leader Election in Multi-Hop Radio Networks. - Mohsen Ghaffari 001; Bernhard Haeupler (SODA, 2013)

Fast Structuring of Radio Networks Large for Multi-message Communications. - Mohsen Ghaffari 001; Bernhard Haeupler (DISC, 2013)

Efficient and Noise-Resilient rumor-spreading in Large, Anonymous Populations. - Ofer Feinerman; Bernhard Haeupler; Amos Korman (CoRR, 2013)

A Bound on the Throughput of Radio Networks - Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (CoRR, 2013)

Beeping a maximal independent set. - Yehuda Afek; Noga Alon; Ziv Bar-Joseph; Alejandro Cornejo; Bernhard Haeupler; Fabian Kuhn (Distributed Comput., 2013)

Testing Simultaneous Planarity when the Common Graph is 2-Connected. - Bernhard Haeupler; Krishnam Raju Jampani; Anna Lubiw (J. Graph Algorithms Appl., 2013)

Deterministic Algorithms for the Lovász Local Lemma. - Karthekeyan Chandrasekaran; Navin Goyal; Bernhard Haeupler (SIAM J. Comput., 2013)

Probabilistic methods for distributed information dissemination. - Bernhard Haeupler (2013)

Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. - Mohsen Ghaffari 001; Bernhard Haeupler (FOCS, 2014)

Interactive Channel Capacity Revisited. - Bernhard Haeupler (FOCS, 2014)

Repeated deletion channels. - Bernhard Haeupler; Michael Mitzenmacher (ITW, 2014)

Optimal gossip with direct addressing. - Bernhard Haeupler; Dahlia Malkhi (PODC, 2014)

Broadcast Throughput in Radio Networks: Routing vs. Network Coding. - Noga Alon; Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (SODA, 2014)

Optimal error rates for interactive coding I: adaptivity and other settings. - Mohsen Ghaffari 001; Bernhard Haeupler; Madhu Sudan 001 (STOC, 2014)

Fast Structuring of Radio Networks for Multi-Message Communications. - Mohsen Ghaffari 001; Bernhard Haeupler (CoRR, 2014)

Consistent Weighted Sampling Made Fast, Small, and Easy. - Bernhard Haeupler; Mark S. Manasse; Kunal Talwar (CoRR, 2014)

Communication with Partial Noiseless Feedback. - Bernhard Haeupler; Pritish Kamath; Ameya Velingker (APPROX-RANDOM, 2015)

Distributed Resource Discovery in Sub-Logarithmic Time. - Bernhard Haeupler; Dahlia Malkhi (PODC, 2015)

Tight Bounds on Vertex Connectivity Under Vertex Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (SODA, 2015)

Improved bounds and parallel algorithms for the Lovasz Local Lemma. - Bernhard Haeupler; David G. Harris 001 (CoRR, 2015)

Bounded-Contention Coding for the additive network model. - Keren Censor-Hillel; Bernhard Haeupler; Nancy A. Lynch; Muriel Médard (Distributed Comput., 2015)

Randomized broadcast in radio networks with collision detection. - Mohsen Ghaffari 001; Bernhard Haeupler; Majid Khabbazian (Distributed Comput., 2015)

Constant-rate coding for multiparty interactive communication is impossible. - Mark Braverman; Klim Efremenko; Ran Gelles; Bernhard Haeupler (Electron. Colloquium Comput. Complex., 2015)

Towards Optimal Deterministic Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (Electron. Colloquium Comput. Complex., 2015)

Simple, Fast and Deterministic Gossip and Rumor Spreading. - Bernhard Haeupler (J. ACM, 2015)

Network Coding Based Information Spreading in Dynamic Networks With Correlated Data. - Asaf Cohen 001; Bernhard Haeupler; Chen Avin; Muriel Médard (IEEE J. Sel. Areas Commun., 2015)

Rank-Balanced Trees. - Bernhard Haeupler; Siddhartha Sen 001; Robert Endre Tarjan (ACM Trans. Algorithms, 2015)

Self-adjusting grid networks to minimize expected path length. - Chen Avin; Michael Borokhovich; Bernhard Haeupler; Zvi Lotker (Theor. Comput. Sci., 2015)

Distributed Algorithms for Planar Networks I: Planar Embedding. - Mohsen Ghaffari 001; Bernhard Haeupler (PODC, 2016)

A Faster Distributed Radio Broadcast Primitive: Extended Abstract. - Bernhard Haeupler; David Wajc (PODC, 2016)

Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. - Mohsen Ghaffari 001; Bernhard Haeupler (SODA, 2016)

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. - Bernhard Haeupler; Taisuke Izumi; Goran Zuzic (DISC, 2016)

Bridging the Capacity Gap Between Interactive and One-Way Communication. - Bernhard Haeupler; Ameya Velingker (Electron. Colloquium Comput. Complex., 2016)

Near-Optimal BFS-Tree Construction in Radio Networks. - Mohsen Ghaffari 001; Bernhard Haeupler (IEEE Commun. Lett., 2016)

Analyzing Network Coding (Gossip) Made Easy. - Bernhard Haeupler (J. ACM, 2016)

Discovery Through Gossip. - Bernhard Haeupler; Gopal Pandurangan; David Peleg; Rajmohan Rajaraman; Zhifeng Sun (Random Struct. Algorithms, 2016)

Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback. - Klim Efremenko; Ran Gelles; Bernhard Haeupler (IEEE Trans. Inf. Theory, 2016)

SplayNet: Towards Locally Self-Adjusting Networks. - Stefan Schmid 001; Chen Avin; Christian Scheideler; Michael Borokhovich; Bernhard Haeupler; Zvi Lotker (IEEE/ACM Trans. Netw., 2016)

Broadcasting in Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (PODC, 2017)

Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. - Ofer Feinerman; Bernhard Haeupler; Amos Korman (Distributed Comput., 2017)

Rumor Spreading with No Dependence on Conductance. - Keren Censor-Hillel; Bernhard Haeupler; Jonathan A. Kelner; Petar Maymounkov (SIAM J. Comput., 2017)

Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. - Ran Gelles; Bernhard Haeupler (SIAM J. Comput., 2017)

Tight Bounds on Vertex Connectivity Under Sampling. - Keren Censor-Hillel; Mohsen Ghaffari 001; George Giakkoupis; Bernhard Haeupler; Fabian Kuhn (ACM Trans. Algorithms, 2017)

Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs. - Bernhard Haeupler; David G. Harris 001 (ACM Trans. Algorithms, 2017)

Algorithms for Noisy Broadcast with Erasures. - Ofer Grossman; Bernhard Haeupler; Sidhanth Mohanty (ICALP, 2018)

Synchronization Strings: List Decoding for Insertions and Deletions. - Bernhard Haeupler; Amirbehshad Shahrasbi; Madhu Sudan 001 (ICALP, 2018)

Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. - Bernhard Haeupler; Amirbehshad Shahrasbi; Ellen Vitercik (ICALP, 2018)

Making Asynchronous Distributed Computations Robust to Channel Noise. - Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler (ITCS, 2018)

Round- and Message-Optimal Distributed Graph Algorithms. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (PODC, 2018)

Minor Excluded Network Families Admit Fast Distributed Algorithms. - Bernhard Haeupler; Jason Li 006; Goran Zuzic (PODC, 2018)

Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. - Bernhard Haeupler; Jeet Mohapatra; Hsin-Hao Su (PODC, 2018)

Synchronization strings: explicit constructions, local decoding, and applications. - Bernhard Haeupler; Amirbehshad Shahrasbi (STOC, 2018)

Allocate-On-Use Space Complexity of Shared-Memory Algorithms. - James Aspnes; Bernhard Haeupler; Alexander Tong 001; Philipp Woelfel (DISC, 2018)

Faster Distributed Shortest Path Approximations via Shortcuts. - Bernhard Haeupler; Jason Li 006 (DISC, 2018)

Round- and Message-Optimal Distributed Part-Wise Aggregation. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (CoRR, 2018)

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. - Kuan Cheng; Bernhard Haeupler; Xin Li 006; Amirbehshad Shahrasbi; Ke Wu 001 (CoRR, 2018)

Optimal Document Exchange and New Codes for Small Number of Insertions and Deletions. - Bernhard Haeupler (CoRR, 2018)

A Computational Approach to Organizational Structure. - Bernhard Haeupler; D. Ellis Hershkowitz; Anson Kahng; Ariel D. Procaccia (CoRR, 2018)

Algorithms for Noisy Broadcast under Erasures. - Ofer Grossman; Bernhard Haeupler; Sidhanth Mohanty (CoRR, 2018)

Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing. - Bernhard Haeupler; Aviad Rubinstein; Amirbehshad Shahrasbi (CoRR, 2018)

Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. - Gil Cohen; Bernhard Haeupler; Leonard J. Schulman (Electron. Colloquium Comput. Complex., 2018)

Explicit Capacity Approaching Coding for Interactive Communication. - Ran Gelles; Bernhard Haeupler; Gillat Kol; Noga Ron-Zewi; Avi Wigderson (IEEE Trans. Inf. Theory, 2018)

Optimal Document Exchange and New Codes for Insertions and Deletions. - Bernhard Haeupler (FOCS, 2019)

Optimal Strategies for Patrolling Fences. - Bernhard Haeupler; Fabian Kuhn; Anders Martinsson; Kalina Petrova; Pascal Pfister (ICALP, 2019)

Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. - Kuan Cheng; Bernhard Haeupler; Xin Li 006; Amirbehshad Shahrasbi; Ke Wu 001 (SODA, 2019)

Writeback-Aware Caching (Brief Announcement). - Nathan Beckmann; Phillip B. Gibbons; Bernhard Haeupler; Charles McGuffey (SPAA, 2019)

Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing. - Bernhard Haeupler; Aviad Rubinstein; Amirbehshad Shahrasbi (STOC, 2019)

Erasure Correction for Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (DISC, 2019)

Reliable communication over highly connected noisy networks. - Noga Alon; Mark Braverman; Klim Efremenko; Ran Gelles; Bernhard Haeupler (Distributed Comput., 2019)

Making asynchronous distributed computations robust to noise. - Keren Censor-Hillel; Ran Gelles; Bernhard Haeupler (Distributed Comput., 2019)

Optimally Resilient Codes for List-Decoding from Insertions and Deletions. - Venkatesan Guruswami; Bernhard Haeupler; Amirbehshad Shahrasbi (Electron. Colloquium Comput. Complex., 2019)

Writeback-Aware Caching. - Nathan Beckmann; Phillip B. Gibbons; Bernhard Haeupler; Charles McGuffey (APOCS, 2020)

Network Coding Gaps for Completion Times of Multiple Unicasts. - Bernhard Haeupler; David Wajc; Goran Zuzic (FOCS, 2020)

Computation-Aware Data Aggregation. - Bernhard Haeupler; D. Ellis Hershkowitz; Anson Kahng; Ariel D. Procaccia (ITCS, 2020)

Rate-Distance Tradeoffs for List-Decodable Insertion-Deletion Codes. - Bernhard Haeupler; Amirbehshad Shahrasbi (CoRR, 2020)

Near-Optimal Schedules for Simultaneous Multicasts. - Bernhard Haeupler; D. Ellis Hershkowitz; David Wajc (ICALP, 2021)

Low-Congestion Shortcuts for Graphs Excluding Dense Minors. - Mohsen Ghaffari 001; Bernhard Haeupler (PODC, 2021)

A Time-Optimal Randomized Parallel Algorithm for MIS. - Mohsen Ghaffari 001; Bernhard Haeupler (SODA, 2021)

Hop-constrained oblivious routing. - Mohsen Ghaffari 001; Bernhard Haeupler; Goran Zuzic (STOC, 2021)

Tree embeddings for hop-constrained network design. - Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (STOC, 2021)

Universally-optimal distributed algorithms for known topologies. - Bernhard Haeupler; David Wajc; Goran Zuzic (STOC, 2021)

The Quest for Universally-Optimal Distributed Algorithms (Invited Talk). - Bernhard Haeupler (DISC, 2021)

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. - Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (CoRR, 2021)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. - Goran Zuzic; Gramoz Goranci; Mingquan Ye; Bernhard Haeupler; Xiaorui Sun (CoRR, 2021)

Fast Algorithms for Hop-Constrained Flows and Moving Cuts. - Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak (CoRR, 2021)

Low-Congestion shortcuts without embedding. - Bernhard Haeupler; Taisuke Izumi; Goran Zuzic (Distributed Comput., 2021)

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. - Bernhard Haeupler; Amirbehshad Shahrasbi (J. ACM, 2021)

Synchronization Strings and Codes for Insertions and Deletions - A Survey. - Bernhard Haeupler; Amirbehshad Shahrasbi (IEEE Trans. Inf. Theory, 2021)

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. - Václav Rozhon; Michael Elkin; Christoph Grunau; Bernhard Haeupler (FOCS, 2022)

Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes. - Bernhard Haeupler; Amirbehshad Shahrasbi (ITW, 2022)

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (PODC, 2022)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. - Goran Zuzic; Gramoz Goranci; Mingquan Ye; Bernhard Haeupler; Xiaorui Sun (SODA, 2022)

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. - Marcel Bezdrighin; Michael Elkin; Mohsen Ghaffari 001; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhon (SPAA, 2022)

Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. - Bernhard Haeupler; Harald Räcke; Mohsen Ghaffari 001 (STOC, 2022)

Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (STOC, 2022)

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (CoRR, 2022)

Circuits Resilient to Short-Circuit Errors. - Klim Efremenko; Bernhard Haeupler; Yael Kalai; Pritish Kamath; Gillat Kol; Nicolas Resch; Raghuvansh Saxena (Electron. Colloquium Comput. Complex., 2022)

Interactive Coding with Small Memory. - Klim Efremenko; Bernhard Haeupler; Gillat Kol; Nicolas Resch; Raghuvansh Saxena; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2022)

Sparse Semi-Oblivious Routing: Few Random Paths Suffice. - Goran Zuzic; Bernhard Haeupler; Antti Roeyskoe (PODC, 2023)

Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. - Mohsen Ghaffari 001; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhon (SODA, 2023)

A Simple Deterministic Distributed Low-Diameter Clustering. - Václav Rozhon; Bernhard Haeupler; Christoph Grunau (SOSA, 2023)

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. - Bernhard Haeupler; D. Ellis Hershkowitz; Thatchaphol Saranurak (STOC, 2023)

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. - Václav Rozhon; Bernhard Haeupler; Anders Martinsson; Christoph Grunau; Goran Zuzic (STOC, 2023)

Parallel and Distributed 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 (CoRR, 2023)

Parallel Greedy Spanners. - Bernhard Haeupler; D. Ellis Hershkowitz; Zihan Tan (CoRR, 2023)

Fully Dynamic Consistent k-Center Clustering. - Jakub Lacki; Bernhard Haeupler; Christoph Grunau; Václav Rozhon; Rajesh Jayaram (CoRR, 2023)

Efficient Linear and Affine Codes for Correcting Insertions/Deletions. - Kuan Cheng; Venkatesan Guruswami; Bernhard Haeupler; Xin Li 006 (SIAM J. Discret. Math., 2023)

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (Distributed Comput., 2023)

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 (ESA, 2024)

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. - Bernhard Haeupler; Richard Hladík; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (FOCS, 2024)

New Structures and Algorithms for Length-Constrained Expander Decompositions. - Bernhard Haeupler; D. Ellis Hershkowitz; Zihan Tan (FOCS, 2024)

Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. - Bernhard Haeupler; Yaowei Long; Thatchaphol Saranurak (FOCS, 2024)

Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. - Greg Bodwin; Bernhard Haeupler; Merav Parter (SODA, 2024)

Fully Dynamic Consistent k-Center Clustering. - Jakub Lacki; Bernhard Haeupler; Christoph Grunau; Rajesh Jayaram; Václav Rozhon (SODA, 2024)

Low-Step Multi-commodity Flow Emulators. - Bernhard Haeupler; D. Ellis Hershkowitz; Jason Li 006; Antti Roeyskoe; Thatchaphol Saranurak (STOC, 2024)

Polylog-Competitive Deterministic Local Routing and Scheduling. - Bernhard Haeupler; Shyamal Patel; Antti Roeyskoe; Cliff Stein 001; Goran Zuzic (STOC, 2024)

Interactive Coding with Small Memory and Improved Rate. - Dorsa Fathollahi; Bernhard Haeupler; Nicolas Resch; Mary Wootters (CoRR, 2024)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths. - Nick Fischer; Bernhard Haeupler; Rustam Latypov; Antti Roeyskoe; Aurelio L. Sulser (CoRR, 2024)

Near-Optimal Directed Low-Diameter Decompositions. - Karl Bringmann; Nick Fischer; Bernhard Haeupler; Rustam Latypov (ICALP, 2025)

A Cut-Matching Game for Constant-Hop Expanders. - Bernhard Haeupler; Jonas Hübotter; Mohsen Ghaffari 001 (SODA, 2025)

Fast and Simple Sorting Using Partial Information. - Bernhard Haeupler; Richard Hladík; John Iacono; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (SODA, 2025)

A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path. - Nick Fischer; Bernhard Haeupler; Rustam Latypov; Antti Roeyskoe; Aurelio L. Sulser (SOSA, 2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal. - Bernhard Haeupler; Richard Hladík; Václav Rozhon; Robert E. Tarjan; Jakub Tetek (SOSA, 2025)

Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations. - Bernhard Haeupler; Marc Kaufmann; Raghu Raman Ravi; Ulysse Schaller (CoRR, 2025)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. - Bernhard Haeupler; Yaowei Long; Thatchaphol Saranurak; Shengzhe Wang (CoRR, 2025)

Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. - Sudatta Bhattacharya; Sanjana Dey; Elazar Goldenberg; Mursalin Habib; Bernhard Haeupler; Karthik C. S. 001; Michal Koucký 001 (CoRR, 2025)

Maintaining Routing Structures under Deletions via Self-Pruning. - Bernhard Haeupler; Antti Roeyskoe (CoRR, 2025)