BH
Bernhard Haeupler
cs.DScs.DCcs.ITmath.ITmath.COcs.DMcs.NIcs.CCcs.AIcs.MA
On Valency
published · living versionsW_uqhr6nx7·v1 · currentpublished
Polynomial Lower Bounds for Steiner Shortcuts via Test Functions
with Aaron Bernstein, Henry Fleischmann, Gary Hoppenworth, Thatchaphol Saranurak
1 version
W_3hy3wurc·v1published
W_g9z927n8·v1published
Preprints & journals
113 papers in the corpus · 2007–2026General Constructions of Permutation-Fair Dice2610.15421v1 · Tom'as Gavenciak, Bernhard Haeupler, V'aclav Rozhon2026 · 0 citationsarXiv
Low-Stretch Spanning Trees via Smoothed Analysis of Dijkstra's Algorithm2609.35136v1 · Ioannis Dorkofikis, Bernhard Haeupler, Maximilian Probst Gutenberg et al.2026 · 0 citationsarXiv
Heaps and Their Working Sets2607.24621v1 · Bernhard Haeupler, Richard Hlad'ik, V'aclav Rozhon et al.2026 · 0 citationsarXiv
Splay trees are almost dynamically optimal2607.18498v1 · Petr Chmel, Bernhard Haeupler, Richard Hlad'ik et al.2026 · 0 citationsarXiv
Dynamic Construction of the Lovász Local Lemma2604.20836v1 · Bernhard Haeupler, Slobodan Mitrovi'c, Srikkanth Ramachandran et al.2026 · 0 citationsarXiv
Maintaining Random Assignments under Adversarial Dynamics2604.05606v1 · Bernhard Haeupler, Anton Paramonov2026 · 0 citationsarXiv
DAG Projections: Reducing Distance and Flow Problems to DAGs2604.04752v1 · Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak2026 · 0 citationsarXiv
A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures2604.01829v1 · Bernhard Haeupler, Yaowei Long, Antti Roeyskoe et al.2026 · 0 citationsarXiv
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness2602.10747v2 · Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang2026 · 0 citationsarXiv
Fast and Simple Sorting Using Partial Information.42920730 · Haeupler, Bernhard, Hladík, Richard, Iacono, John et al.2026 · 0 citationsAlgorithmica. 2026;88(3):41
Clustering with Label Consistency2512.19654v1 · Diptarka Chakraborty, Hendrik Fichtenberger, Bernhard Haeupler et al.2025 · 0 citationsarXiv
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers2511.08551v1 · Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak2025 · 0 citationsarXiv
Reviving Thorup's Shortcut Conjecture2510.24954v2 · Aaron Bernstein, Henry Fleischmann, Maximilian Probst Gutenberg et al.2025 · 0 citationsarXiv
Parallel -Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work2510.20456v1 · Bernhard Haeupler, Yonggang Jiang, Yaowei Long et al.2025 · 0 citationsarXiv
Simple Length-Constrained Expander Decompositions2510.10227v1 · Greg Bodwin, Bernhard Haeupler, D Ellis Hershkowitz et al.2025 · 0 citationsarXiv
Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation2509.24565v2 · Bernhard Haeupler, Richard Hlad'ik, Shengzhe Wang et al.2025 · 0 citationsarXiv
Reducing Shortcut and Hopset Constructions to Shallow Graphs2508.20302v1 · Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak2025 · 0 citationsarXiv
Maintaining Routing Structures under Deletions via Self-Pruning2507.13044v1 · Bernhard Haeupler, Antti Roeyskoe2025 · 0 citationsarXiv
Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric2504.03605v2 · Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg et al.2025 · 0 citationsarXiv
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts2503.23217v1 · Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak et al.2025 · 0 citationsarXiv
Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations2502.15320v3 · Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi et al.2025 · 0 citationsarXiv
Near-Optimal Directed Low-Diameter Decompositions2502.05687v1 · Karl Bringmann, Nick Fischer, Bernhard Haeupler et al.2025 · 0 citationsarXiv
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths2410.20959v1 · Nick Fischer, Bernhard Haeupler, Rustam Latypov et al.2024 · 0 citationsarXiv
Bidirectional Dijkstra's Algorithm is Instance-Optimal2410.14638v4 · Bernhard Haeupler, Richard Hlad'ik, Vaclav Rozhon et al.2024 · 3 citationsarXiv
Interactive Coding with Small Memory and Improved Rate2408.06541v1 · Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch et al.2024 · 0 citationsarXiv
Low-Step Multi-Commodity Flow Emulators2406.14384v1 · Bernhard Haeupler, D Ellis Hershkowitz, Jason Li et al.2024 · 7 citationsarXiv
New Structures and Algorithms for Length-Constrained Expander Decompositions2404.13446v2 · Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan2024 · 3 citationsarXiv
Fast and Simple Sorting Using Partial Information2404.04552v4 · Bernhard Haeupler, Richard Hlad'ik, John Iacono et al.2024 · 3 citationsarXiv
Polylog-Competitive Deterministic Local Routing and Scheduling2403.07410v2 · Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe et al.2024 · 0 citationsarXiv
Dynamic Deterministic Constant-Approximate Distance Oracles with Worst-Case Update Time2402.18541v2 · Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak2024 · 4 citationsarXiv
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps2311.11793v4 · Bernhard Haeupler, Richard Hlad'ik, V'aclav Rozhon et al.2023 · 36 citationsarXiv
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free2309.06696v1 · Greg Bodwin, Bernhard Haeupler, Merav Parter2023 · 2 citationsarXiv
Fully Dynamic Consistent -Center Clustering2307.13747v1 · Jakub \Lacki, Bernhard Haeupler, Christoph Grunau et al.2023 · 7 citationsarXiv
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights2303.00811v2 · Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao et al.2023 · 4 citationsarXiv
Sparse Semi-Oblivious Routing: Few Random Paths Suffice2301.06647v2 · Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe2023 · 5 citationsarXiv
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances2210.16351v1 · V'aclav Rozhon, Bernhard Haeupler, Anders Martinsson et al.2022 · 8 citationsarXiv
A Simple Deterministic Distributed Low-Diameter Clustering2210.11784v1 · V'aclav Rozhon, Bernhard Haeupler, Christoph Grunau2022 · 1 citationarXiv
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization2209.11669v1 · Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler et al.2022 · 15 citationsarXiv
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates2204.14086v2 · Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari et al.2022 · 6 citationsarXiv
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications2204.08254v2 · V'aclav Rozhon, Michael Elkin, Christoph Grunau et al.2022 · 6 citationsarXiv
Undirected -Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms2204.05874v2 · V'aclav Rozhon, Christoph Grunau, Bernhard Haeupler et al.2022 · 0 citationsarXiv
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast2111.01422v5 · Bernhard Haeupler, D Ellis Hershkowitz, Thatchaphol Saranurak2021 · 7 citationsarXiv
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing2110.15944v1 · Goran Zuzic, Gramoz Goranci, Mingquan Ye et al.2021 · 2 citationsarXiv
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts2109.05151v3 · Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler et al.2021 · 3 citationsarXiv
Universally-Optimal Distributed Algorithms for Known Topologies2104.03932v2 · Bernhard Haeupler, David Wajc, Goran Zuzic2021 · 27 citationsarXiv
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries2102.05168v1 · Bernhard Haeupler, D Ellis Hershkowitz, Goran Zuzic2021 · 2 citationsarXiv
Synchronization Strings and Codes for Insertions and Deletions -- a Survey2101.00711v1 · Bernhard Haeupler, Amirbehshad Shahrasbi2021 · 42 citationsarXiv
Hop-Constrained Oblivious Routing2011.10446v2 · Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic2020 · 0 citationsarXiv
Tree Embeddings for Hop-Constrained Network Design2011.06112v1 · Bernhard Haeupler, D Ellis Hershkowitz, Goran Zuzic2020 · 10 citationsarXiv
Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes2009.13307v2 · Bernhard Haeupler, Amirbehshad Shahrasbi2020 · 10 citationsarXiv
Career total: 253 works. 113 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.