default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Haeupler
Person information
- affiliation: INSAIT, Sofia University "St. Kliment Ohridski", Bulgaria
- affiliation: ETH Zurich, Switzerland
- affiliation (former): Carnegie Mellon University, Pittsburgh, USA
SPARQL queries 
🛈 Please note that only 71% of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2020 – today
- 2026
[j37]Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. Algorithmica 88(3): 41 (2026)- [c118]Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Koucký:
Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. ICALP 2026: 32:1-32:19 - [c117]Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang:
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. ICALP 2026: 105:1-105:23 - [c116]Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller:
Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations. ITCS 2026: 74:1-74:14 - [c115]Greg Bodwin, Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
Simple Length-Constrained Expander Decompositions. SOSA 2026: 275-290 - [c114]Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
:
Reducing Shortcut and Hopset Constructions to Shallow Graphs. SOSA 2026: 385-393 - [c113]Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak:
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers. STOC 2026: 198-209 - [c112]Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller:
Reviving Thorup's Shortcut Conjecture. STOC 2026: 653-664 - [c111]Bernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol Saranurak:
A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures. STOC 2026: 1014-1024 - [c110]Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak:
DAG Projections: Reducing Distance and Flow Problems to DAGs. STOC 2026: 2266-2277 - [i117]Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang:
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness. CoRR abs/2602.10747 (2026) - [i116]Bernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol Saranurak:
A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures. CoRR abs/2604.01829 (2026) - [i115]Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak:
DAG Projections: Reducing Distance and Flow Problems to DAGs. CoRR abs/2604.04752 (2026) - [i114]Bernhard Haeupler, Anton Paramonov:
Maintaining Random Assignments under Adversarial Dynamics. CoRR abs/2604.05606 (2026) - [i113]Bernhard Haeupler, Slobodan Mitrovic, Srikkanth Ramachandran, Wen-Horng Sheu, Robert E. Tarjan:
Dynamic Construction of the Lovász Local Lemma. CoRR abs/2604.20836 (2026) - [i112]Petr Chmel, Bernhard Haeupler, Richard Hladík, Michal Koucký, Antti Roeyskoe, Václav Rozhon, Ondrej Sladký, Robert E. Tarjan:
Splay trees are almost dynamically optimal. CoRR abs/2607.18498 (2026) - [i111]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan:
Heaps and Their Working Sets. CoRR abs/2607.24621 (2026) - 2025
- [c109]Bernhard Haeupler:
Graph Decompositions and Length-Constrained Expanders (Invited Talk). ESA 2025: 1:1-1:2 - [c108]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang:
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. ESA 2025: 107:1-107:17 - [c107]Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang:
Parallel (1+ε)-Approximate Multi-Commodity Min-Cost Flow in Almost Optimal Depth and Work. FOCS 2025: 1883-1893 - [c106]Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov:
Near-Optimal Directed Low-Diameter Decompositions. ICALP 2025: 35:1-35:18 - [c105]Bernhard Haeupler, Jonas Hübotter, Mohsen Ghaffari:
A Cut-Matching Game for Constant-Hop Expanders. SODA 2025: 1651-1678 - [c104]Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. SODA 2025: 3953-3973 - [c103]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Bidirectional Dijkstra's Algorithm is Instance-Optimal. SOSA 2025: 202-215 - [c102]Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser:
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path. SOSA 2025: 216-225 - [i110]Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov:
Near-Optimal Directed Low-Diameter Decompositions. CoRR abs/2502.05687 (2025) - [i109]Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller:
Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations. CoRR abs/2502.15320 (2025) - [i108]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang:
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts. CoRR abs/2503.23217 (2025) - [i107]Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Koucký:
Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. CoRR abs/2504.03605 (2025) - [i106]Bernhard Haeupler, Antti Roeyskoe:
Maintaining Routing Structures under Deletions via Self-Pruning. CoRR abs/2507.13044 (2025) - [i105]Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak:
Reducing Shortcut and Hopset Constructions to Shallow Graphs. CoRR abs/2508.20302 (2025) - [i104]Bernhard Haeupler, Richard Hladík, Shengzhe Wang, Zhijun Zhang:
Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation. CoRR abs/2509.24565 (2025) - [i103]Greg Bodwin, Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
Simple Length-Constrained Expander Decompositions. CoRR abs/2510.10227 (2025) - [i102]Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang:
Parallel (1+ε)-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work. CoRR abs/2510.20456 (2025) - [i101]Aaron Bernstein, Henry L. Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller:
Reviving Thorup's Shortcut Conjecture. CoRR abs/2510.24954 (2025) - [i100]Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak:
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers. CoRR abs/2511.08551 (2025) - [i99]Diptarka Chakraborty, Hendrik Fichtenberger, Bernhard Haeupler, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Clustering with Label Consistency. CoRR abs/2512.19654 (2025) - 2024
- [c101]Vikrant Ashvinkumar, Aaron Bernstein, Nairen Cao, Christoph Grunau, Bernhard Haeupler, Yonggang Jiang, Danupon Nanongkai, Hsin-Hao Su:
Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights. ESA 2024: 13:1-13:15 - [c100]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
New Structures and Algorithms for Length-Constrained Expander Decompositions. FOCS 2024: 1634-1645 - [c99]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. FOCS 2024: 2033-2044 - [c98]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. FOCS 2024: 2099-2130 - [c97]Greg Bodwin, Bernhard Haeupler, Merav Parter:
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. SODA 2024: 2609-2642 - [c96]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Rajesh Jayaram, Václav Rozhon:
Fully Dynamic Consistent k-Center Clustering. SODA 2024: 3463-3484 - [c95]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-commodity Flow Emulators. STOC 2024: 71-82 - [c94]Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic:
Polylog-Competitive Deterministic Local Routing and Scheduling. STOC 2024: 812-822 - [i98]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. CoRR abs/2402.18541 (2024) - [i97]Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic:
Polylog-Competitive Deterministic Local Routing and Scheduling. CoRR abs/2403.07410 (2024) - [i96]Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Fast and Simple Sorting Using Partial Information. CoRR abs/2404.04552 (2024) - [i95]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
New Structures and Algorithms for Length-Constrained Expander Decompositions. CoRR abs/2404.13446 (2024) - [i94]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-Commodity Flow Emulators. CoRR abs/2406.14384 (2024) - [i93]Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters:
Interactive Coding with Small Memory and Improved Rate. CoRR abs/2408.06541 (2024) - [i92]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Bidirectional Dijkstra's Algorithm is Instance-Optimal. CoRR abs/2410.14638 (2024) - [i91]Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio L. Sulser:
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths. CoRR abs/2410.20959 (2024) - 2023
- [j36]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. Distributed Comput. 36(4): 475-499 (2023) - [j35]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SIAM J. Discret. Math. 37(2): 748-778 (2023) - [c93]Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe:
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. PODC 2023: 222-232 - [c92]Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA 2023: 2532-2566 - [c91]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Interactive Coding with Small Memory. SODA 2023: 3587-3613 - [c90]Václav Rozhon, Bernhard Haeupler, Christoph Grunau:
A Simple Deterministic Distributed Low-Diameter Clustering. SOSA 2023: 166-174 - [c89]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: 321-334 - [c88]Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast. STOC 2023: 1371-1383 - [i90]Goran Zuzic, Bernhard Haeupler, Antti Roeyskoe:
Sparse Semi-Oblivious Routing: Few Random Paths Suffice. CoRR abs/2301.06647 (2023) - [i89]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 abs/2303.00811 (2023) - [i88]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
Parallel Greedy Spanners. CoRR abs/2304.08892 (2023) - [i87]Jakub Lacki, Bernhard Haeupler, Christoph Grunau, Václav Rozhon, Rajesh Jayaram:
Fully Dynamic Consistent k-Center Clustering. CoRR abs/2307.13747 (2023) - [i86]Greg Bodwin, Bernhard Haeupler, Merav Parter:
Fault-Tolerant Spanners against Bounded-Degree Edge Failures: Linearly More Faults, Almost For Free. CoRR abs/2309.06696 (2023) - [i85]Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek:
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR abs/2311.11793 (2023) - 2022
- [c87]Václav Rozhon, Michael Elkin, Christoph Grunau, Bernhard Haeupler:
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. FOCS 2022: 1114-1121 - [c86]Bernhard Haeupler, Amirbehshad Shahrasbi:
Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes. ITW 2022: 470-475 - [c85]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. PODC 2022: 372-374 - [c84]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. SODA 2022: 2549-2579 - [c83]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: 1-10 - [c82]Václav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, Jason Li:
Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. STOC 2022: 478-487 - [c81]Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena:
Circuits resilient to short-circuit errors. STOC 2022: 582-594 - [c80]Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari:
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. STOC 2022: 1325-1338 - [c79]Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, Themis Gouleakis:
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. DISC 2022: 6:1-6:20 - [i84]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 abs/2204.05874 (2022) - [i83]Michael Elkin, Bernhard Haeupler, Václav Rozhon, Christoph Grunau:
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications. CoRR abs/2204.08254 (2022) - [i82]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 abs/2204.14086 (2022) - [i81]Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. CoRR abs/2209.11669 (2022) - [i80]Václav Rozhon, Bernhard Haeupler, Christoph Grunau:
A Simple Deterministic Distributed Low-Diameter Clustering. CoRR abs/2210.11784 (2022) - [i79]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 abs/2210.16351 (2022) - [i78]Bernhard Haeupler, Jonas Hübotter, Mohsen Ghaffari:
A Cut-Matching Game for Constant-Hop Expanders. CoRR abs/2211.11726 (2022) - [i77]Klim Efremenko, Bernhard Haeupler, Yael Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh Saxena:
Circuits Resilient to Short-Circuit Errors. Electron. Colloquium Comput. Complex. TR22: Article TR22-050 (2022) - [i76]Klim Efremenko, Bernhard Haeupler, Gillat Kol, Nicolas Resch, Raghuvansh Saxena, Yael Tauman Kalai:
Interactive Coding with Small Memory. Electron. Colloquium Comput. Complex. TR22: Article TR22-146 (2022) - 2021
- [j34]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion shortcuts without embedding. Distributed Comput. 34(1): 79-90 (2021) - [j33]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. J. ACM 68(5): 36:1-36:39 (2021) - [j32]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings and Codes for Insertions and Deletions - A Survey. IEEE Trans. Inf. Theory 67(6): 3190-3206 (2021) - [j31]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding From Insertions and Deletions. IEEE Trans. Inf. Theory 67(12): 7837-7856 (2021) - [c78]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. ICALP 2021: 78:1-78:19 - [c77]Mohsen Ghaffari, Bernhard Haeupler:
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. PODC 2021: 213-221 - [c76]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. SODA 2021: 1-20 - [c75]Mohsen Ghaffari, Bernhard Haeupler:
A Time-Optimal Randomized Parallel Algorithm for MIS. SODA 2021: 2892-2903 - [c74]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Tree embeddings for hop-constrained network design. STOC 2021: 356-369 - [c73]Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-optimal distributed algorithms for known topologies. STOC 2021: 1166-1179 - [c72]Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic:
Hop-constrained oblivious routing. STOC 2021: 1208-1220 - [c71]Bernhard Haeupler:
The Quest for Universally-Optimal Distributed Algorithms (Invited Talk). DISC 2021: 1:1-1:1 - [i75]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings and Codes for Insertions and Deletions - a Survey. CoRR abs/2101.00711 (2021) - [i74]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. CoRR abs/2102.05168 (2021) - [i73]Bernhard Haeupler, David Wajc, Goran Zuzic:
Universally-Optimal Distributed Algorithms for Known Topologies. CoRR abs/2104.03932 (2021) - [i72]Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun:
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. CoRR abs/2110.15944 (2021) - [i71]Bernhard Haeupler, D. Ellis Hershkowitz, Thatchaphol Saranurak:
Fast Algorithms for Hop-Constrained Flows and Moving Cuts. CoRR abs/2111.01422 (2021) - 2020
- [c70]Nathan Beckmann, Phillip B. Gibbons, Bernhard Haeupler, Charles McGuffey:
Writeback-Aware Caching. APOCS 2020: 1-15 - [c69]Bernhard Haeupler, David Wajc, Goran Zuzic:
Network Coding Gaps for Completion Times of Multiple Unicasts. FOCS 2020: 494-505 - [c68]Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia:
Computation-Aware Data Aggregation. ITCS 2020: 65:1-65:38 - [c67]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally resilient codes for list-decoding from insertions and deletions. STOC 2020: 524-537 - [i70]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Near-Optimal Schedules for Simultaneous Multicasts. CoRR abs/2001.00072 (2020) - [i69]Kuan Cheng, Venkatesan Guruswami, Bernhard Haeupler, Xin Li:
Efficient Linear and Affine Codes for Correcting Insertions/Deletions. CoRR abs/2007.09075 (2020) - [i68]Mohsen Ghaffari, Bernhard Haeupler:
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR abs/2008.03091 (2020) - [i67]Bernhard Haeupler, Amirbehshad Shahrasbi:
Rate-Distance Tradeoffs for List-Decodable Insertion-Deletion Codes. CoRR abs/2009.13307 (2020) - [i66]Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Tree Embeddings for Hop-Constrained Network Design. CoRR abs/2011.06112 (2020) - [i65]Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic:
Hop-Constrained Oblivious Routing. CoRR abs/2011.10446 (2020)
2010 – 2019
- 2019
- [j30]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making asynchronous distributed computations robust to noise. Distributed Comput. 32(5): 405-421 (2019) - [j29]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable communication over highly connected noisy networks. Distributed Comput. 32(6): 505-515 (2019) - [c66]Bernhard Haeupler:
Optimal Document Exchange and New Codes for Insertions and Deletions. FOCS 2019: 334-347 - [c65]Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister:
Optimal Strategies for Patrolling Fences. ICALP 2019: 144:1-144:13 - [c64]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Highly Efficient Deterministic Constructions over Small Alphabets. SODA 2019: 2185-2204 - [c63]Nathan Beckmann, Phillip B. Gibbons, Bernhard Haeupler, Charles McGuffey:
Writeback-Aware Caching (Brief Announcement). SPAA 2019: 345-347 - [c62]Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi:
Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing. STOC 2019: 697-708 - [c61]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. DISC 2019: 10:1-10:17 - [i64]Bernhard Haeupler, David Wajc, Goran Zuzic:
Network Coding Gaps for Completion Times of Multiple Unicasts. CoRR abs/1905.02805 (2019) - [i63]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. CoRR abs/1909.10683 (2019) - [i62]Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. Electron. Colloquium Comput. Complex. TR19: Article TR19-153 (2019) - 2018
- [j28]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. J. ACM 65(1): 4:1-4:41 (2018) - [j27]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64(10): 6546-6560 (2018) - [c60]Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik:
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. ICALP 2018: 75:1-75:14 - [c59]Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan:
Synchronization Strings: List Decoding for Insertions and Deletions. ICALP 2018: 76:1-76:14 - [c58]Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty:
Algorithms for Noisy Broadcast with Erasures. ICALP 2018: 153:1-153:12 - [c57]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Channel Noise. ITCS 2018: 50:1-50:20 - [c56]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Round- and Message-Optimal Distributed Graph Algorithms. PODC 2018: 119-128 - [c55]Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su:
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. PODC 2018: 179-188 - [c54]Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. PODC 2018: 465-474 - [c53]Gil Cohen, Bernhard Haeupler, Leonard J. Schulman:
Explicit binary tree codes with polylogarithmic size alphabet. STOC 2018: 535-544 - [c52]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization strings: explicit constructions, local decoding, and applications. STOC 2018: 841-854 - [c51]James Aspnes, Bernhard Haeupler, Alexander Tong, Philipp Woelfel:
Allocate-On-Use Space Complexity of Shared-Memory Algorithms. DISC 2018: 8:1-8:17 - [c50]Bernhard Haeupler, Jason Li:
Faster Distributed Shortest Path Approximations via Shortcuts. DISC 2018: 33:1-33:14 - [i61]Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc:
Round- and Message-Optimal Distributed Part-Wise Aggregation. CoRR abs/1801.05127 (2018) - [i60]Bernhard Haeupler, Jason Li, Goran Zuzic:
Minor Excluded Network Families Admit Fast Distributed Algorithms. CoRR abs/1801.06237 (2018) - [i59]Bernhard Haeupler, Jason Li:
Faster Distributed Shortest Path Approximations via Shortcuts. CoRR abs/1802.03671 (2018) - [i58]Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan:
Synchronization Strings: List Decoding for Insertions and Deletions. CoRR abs/1802.08663 (2018) - [i57]Kuan Cheng, Bernhard Haeupler, Xin Li, Amirbehshad Shahrasbi, Ke Wu:
Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets. CoRR abs/1803.03530 (2018) - [i56]Bernhard Haeupler:
Optimal Document Exchange and New Codes for Small Number of Insertions and Deletions. CoRR abs/1804.03604 (2018) - [i55]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Erasure Correction for Noisy Radio Networks. CoRR abs/1805.04165 (2018) - [i54]Bernhard Haeupler, D. Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia:
A Computational Approach to Organizational Structure. CoRR abs/1806.05701 (2018) - [i53]Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty:
Algorithms for Noisy Broadcast under Erasures. CoRR abs/1808.00838 (2018) - [i52]Bernhard Haeupler, Fabian Kuhn, Anders Martinsson, Kalina Petrova, Pascal Pfister:
Optimal strategies for patrolling fences. CoRR abs/1809.06727 (2018) - [i51]Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi:
Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing. CoRR abs/1810.11863 (2018) - [i50]Gil Cohen, Bernhard Haeupler, Leonard J. Schulman:
Explicit Binary Tree Codes with Polylogarithmic Size Alphabet. Electron. Colloquium Comput. Complex. TR18: Article TR18-032 (2018) - 2017
- [j26]Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. Distributed Comput. 30(5): 339-355 (2017) - [j25]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Rumor Spreading with No Dependence on Conductance. SIAM J. Comput. 46(1): 58-79 (2017) - [j24]Ran Gelles, Bernhard Haeupler:
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. SIAM J. Comput. 46(4): 1449-1472 (2017) - [j23]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13(2): 19:1-19:26 (2017) - [j22]Bernhard Haeupler, David G. Harris:
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs. ACM Trans. Algorithms 13(4): 53:1-53:25 (2017) - [c49]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. PODC 2017: 33-42 - [c48]Bernhard Haeupler, David G. Harris:
Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs. SODA 2017: 1170-1187 - [c47]Bernhard Haeupler, Ameya Velingker:
Bridging the Capacity Gap Between Interactive and One-Way Communication. SODA 2017: 2123-2142 - [c46]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization strings: codes for insertions and deletions approaching the Singleton bound. STOC 2017: 33-46 - [i49]Keren Censor-Hillel, Ran Gelles, Bernhard Haeupler:
Making Asynchronous Distributed Computations Robust to Noise. CoRR abs/1702.07403 (2017) - [i48]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound. CoRR abs/1704.00807 (2017) - [i47]Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz, Goran Zuzic:
Broadcasting in Noisy Radio Networks. CoRR abs/1705.07369 (2017) - [i46]Bernhard Haeupler, Amirbehshad Shahrasbi, Ellen Vitercik:
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions. CoRR abs/1707.04233 (2017) - [i45]Bernhard Haeupler, Amirbehshad Shahrasbi:
Synchronization Strings: Explicit Constructions, Local Decoding, and Applications. CoRR abs/1710.09795 (2017) - [i44]Bernhard Haeupler, Jeet Mohapatra, Hsin-Hao Su:
Optimal Gossip Algorithms for Exact and Approximate Quantile Computations. CoRR abs/1711.09258 (2017) - 2016
- [j21]Mohsen Ghaffari, Bernhard Haeupler:
Near-Optimal BFS-Tree Construction in Radio Networks. IEEE Commun. Lett. 20(6): 1172-1174 (2016) - [j20]Bernhard Haeupler:
Analyzing Network Coding (Gossip) Made Easy. J. ACM 63(3): 26:1-26:22 (2016) - [j19]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery Through Gossip. Random Struct. Algorithms 48(3): 565-587 (2016) - [j18]Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback. IEEE Trans. Inf. Theory 62(8): 4575-4588 (2016) - [j17]Stefan Schmid, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
SplayNet: Towards Locally Self-Adjusting Networks. IEEE/ACM Trans. Netw. 24(3): 1421-1433 (2016) - [c45]Mohsen Ghaffari, Bernhard Haeupler:
Distributed Algorithms for Planar Networks I: Planar Embedding. PODC 2016: 29-38 - [c44]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. PODC 2016: 165-173 - [c43]Bernhard Haeupler, David Wajc:
A Faster Distributed Radio Broadcast Primitive: Extended Abstract. PODC 2016: 361-370 - [c42]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. PODC 2016: 451-460 - [c41]Mohsen Ghaffari, Bernhard Haeupler:
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. SODA 2016: 202-219 - [c40]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. SODA 2016: 1922-1936 - [c39]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. STOC 2016: 999-1010 - [c38]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. DISC 2016: 158-172 - [i43]Bernhard Haeupler, Ameya Velingker:
Bridging the Capacity Gap Between Interactive and One-Way Communication. CoRR abs/1605.08792 (2016) - [i42]Bernhard Haeupler, Taisuke Izumi, Goran Zuzic:
Low-Congestion Shortcuts without Embedding. CoRR abs/1607.07553 (2016) - [i41]Bernhard Haeupler, Ameya Velingker:
Bridging the Capacity Gap Between Interactive and One-Way Communication. Electron. Colloquium Comput. Complex. TR16: Article TR16-090 (2016) - 2015
- [j16]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for the additive network model. Distributed Comput. 28(5): 297-308 (2015) - [j15]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized broadcast in radio networks with collision detection. Distributed Comput. 28(6): 407-422 (2015) - [j14]Bernhard Haeupler:
Simple, Fast and Deterministic Gossip and Rumor Spreading. J. ACM 62(6): 47:1-47:18 (2015) - [j13]Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel Médard:
Network Coding Based Information Spreading in Dynamic Networks With Correlated Data. IEEE J. Sel. Areas Commun. 33(2): 213-224 (2015) - [j12]Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Rank-Balanced Trees. ACM Trans. Algorithms 11(4): 30:1-30:26 (2015) - [j11]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting grid networks to minimize expected path length. Theor. Comput. Sci. 584: 91-102 (2015) - [c37]Bernhard Haeupler, Pritish Kamath, Ameya Velingker:
Communication with Partial Noiseless Feedback. APPROX-RANDOM 2015: 881-897 - [c36]Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. ITCS 2015: 11-20 - [c35]Bernhard Haeupler, Dahlia Malkhi:
Distributed Resource Discovery in Sub-Logarithmic Time. PODC 2015: 413-419 - [c34]Ran Gelles, Bernhard Haeupler:
Capacity of Interactive Communication over Erasure Channels and Channels with Feedback. SODA 2015: 1296-1311 - [c33]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Vertex Sampling. SODA 2015: 2006-2018 - [i40]Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback. CoRR abs/1501.00624 (2015) - [i39]Bernhard Haeupler, David G. Harris:
Improved bounds and parallel algorithms for the Lovasz Local Lemma. CoRR abs/1509.06430 (2015) - [i38]Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Reliable Communication over Highly Connected Noisy Networks. Electron. Colloquium Comput. Complex. TR15: Article TR15-014 (2015) - [i37]Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler:
Constant-rate coding for multiparty interactive communication is impossible. Electron. Colloquium Comput. Complex. TR15: Article TR15-197 (2015) - [i36]Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson:
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. TR15: Article TR15-165 (2015) - 2014
- [c32]Bernhard Haeupler:
Interactive Channel Capacity Revisited. FOCS 2014: 226-235 - [c31]Mohsen Ghaffari, Bernhard Haeupler:
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. FOCS 2014: 394-403 - [c30]Bernhard Haeupler, Michael Mitzenmacher:
Repeated deletion channels. ITW 2014: 152-156 - [c29]Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication. PODC 2014: 114-123 - [c28]Bernhard Haeupler, Dahlia Malkhi:
Optimal gossip with direct addressing. PODC 2014: 176-185 - [c27]Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Broadcast Throughput in Radio Networks: Routing vs. Network Coding. SODA 2014: 1831-1843 - [c26]Mohsen Ghaffari, Bernhard Haeupler, Madhu Sudan:
Optimal error rates for interactive coding I: adaptivity and other settings. STOC 2014: 794-803 - [i35]Bernhard Haeupler, Dahlia Malkhi:
Optimal Gossip with Direct Addressing. CoRR abs/1402.2701 (2014) - [i34]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized Broadcast in Radio Networks with Collision Detection. CoRR abs/1404.0780 (2014) - [i33]Mohsen Ghaffari, Bernhard Haeupler:
Fast Structuring of Radio Networks for Multi-Message Communications. CoRR abs/1404.2387 (2014) - [i32]Bernhard Haeupler:
Interactive Channel Capacity Revisited. CoRR abs/1408.1467 (2014) - [i31]Bernhard Haeupler, Mark S. Manasse, Kunal Talwar:
Consistent Weighted Sampling Made Fast, Small, and Easy. CoRR abs/1410.4266 (2014) - 2013
- [b1]Bernhard Haeupler:
Probabilistic methods for distributed information dissemination. Massachusetts Institute of Technology, Cambridge, MA, USA, 2013 - [j10]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a maximal independent set. Distributed Comput. 26(4): 195-208 (2013) - [j9]Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected. J. Graph Algorithms Appl. 17(3): 147-171 (2013) - [j8]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler:
Deterministic Algorithms for the Lovász Local Lemma. SIAM J. Comput. 42(6): 2132-2155 (2013) - [c25]Chen Avin, Bernhard Haeupler, Zvi Lotker, Christian Scheideler, Stefan Schmid:
Locally Self-Adjusting Tree Networks. IPDPS 2013: 395-406 - [c24]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized broadcast in radio networks with collision detection. PODC 2013: 325-334 - [c23]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-adjusting Grid Networks to Minimize Expected Path Length. SIROCCO 2013: 36-54 - [c22]Bernhard Haeupler:
Simple, Fast and Deterministic Gossip and Rumor Spreading. SODA 2013: 705-716 - [c21]Mohsen Ghaffari, Bernhard Haeupler:
Near Optimal Leader Election in Multi-Hop Radio Networks. SODA 2013: 748-766 - [c20]Mohsen Ghaffari, Bernhard Haeupler:
Fast Structuring of Radio Networks Large for Multi-message Communications. DISC 2013: 492-506 - [i30]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
A Bound on the Throughput of Radio Networks. CoRR abs/1302.0264 (2013) - [i29]Ofer Feinerman, Bernhard Haeupler, Amos Korman:
Efficient and Noise-Resilient rumor-spreading in Large, Anonymous Populations. CoRR abs/1311.3425 (2013) - [i28]Mohsen Ghaffari, Bernhard Haeupler:
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. CoRR abs/1312.1763 (2013) - [i27]Mohsen Ghaffari, Bernhard Haeupler, Madhu Sudan:
Optimal Error Rates for Interactive Coding I: Adaptivity and Other Settings. CoRR abs/1312.1764 (2013) - 2012
- [j7]Bernhard Haeupler:
Tighter Worst-Case Bounds on Algebraic Gossip. IEEE Commun. Lett. 16(8): 1274-1276 (2012) - [j6]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. ACM Trans. Algorithms 8(1): 3:1-3:33 (2012) - [c19]Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard:
Network coded gossip with correlated data. ISIT 2012: 2616-2620 - [c18]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through gossip. SPAA 2012: 140-149 - [c17]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance. STOC 2012: 961-970 - [c16]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for Wireless Networks in the High SNR Regime. DISC 2012: 91-105 - [c15]Bernhard Haeupler, Fabian Kuhn:
Lower Bounds on Information Dissemination in Dynamic Networks. DISC 2012: 166-180 - [c14]Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. DISC 2012: 223-237 - [c13]Stefan Schmid, Chen Avin, Christian Scheideler, Bernhard Haeupler, Zvi Lotker:
Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. DISC 2012: 439-440 - [i26]Bernhard Haeupler, Asaf Cohen, Chen Avin, Muriel Médard:
Network Coded Gossip with Correlated Data. CoRR abs/1202.1801 (2012) - [i25]Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun:
Discovery through Gossip. CoRR abs/1202.2092 (2012) - [i24]Bernhard Haeupler:
Tighter Worst-Case Bounds on Algebraic Gossip. CoRR abs/1205.6961 (2012) - [i23]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
The Complexity of Multi-Message Broadcast in Radio Networks with Known Topology. CoRR abs/1205.7014 (2012) - [i22]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a Maximal Independent Set. CoRR abs/1206.0150 (2012) - [i21]Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. CoRR abs/1206.0154 (2012) - [i20]Bernhard Haeupler, Fabian Kuhn:
Lower Bounds on Information Dissemination in Dynamic Networks. CoRR abs/1208.6051 (2012) - [i19]Keren Censor-Hillel, Bernhard Haeupler, Nancy A. Lynch, Muriel Médard:
Bounded-Contention Coding for Wireless Networks in the High SNR Regime. CoRR abs/1208.6125 (2012) - [i18]Bernhard Haeupler:
Simple, Fast and Deterministic Gossip and Rumor Spreading. CoRR abs/1210.1193 (2012) - [i17]Mohsen Ghaffari, Bernhard Haeupler:
Near Optimal Leader Election in Multi-Hop Radio Networks. CoRR abs/1210.8439 (2012) - 2011
- [j5]William I. Gasarch, Bernhard Haeupler:
Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive. Electron. J. Comb. 18(1) (2011) - [j4]Bernhard Haeupler, Barna Saha, Aravind Srinivasan:
New Constructive Aspects of the Lovász Local Lemma. J. ACM 58(6): 28:1-28:28 (2011) - [j3]Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Rank-Pairing Heaps. SIAM J. Comput. 40(6): 1463-1485 (2011) - [c12]Bernhard Haeupler, Muriel Médard:
One packet suffices - Highly efficient packetized Network Coding With finite memory. ISIT 2011: 1151-1155 - [c11]Bernhard Haeupler, Minji Kim, Muriel Médard:
Optimality of network coding with buffers. ITW 2011: 533-537 - [c10]Bernhard Haeupler, David R. Karger:
Faster information dissemination in dynamic networks via network coding. PODC 2011: 381-390 - [c9]Bernhard Haeupler:
Analyzing network coding gossip made easy. STOC 2011: 293-302 - [c8]Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Beeping a Maximal Independent Set. DISC 2011: 32-50 - [c7]Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE 2011: 170-181 - [i16]Bernhard Haeupler, Muriel Médard:
One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory. CoRR abs/1102.3204 (2011) - [i15]Bernhard Haeupler, Minji Kim, Muriel Médard:
Optimality of Network Coding in Packet Networks. CoRR abs/1102.3569 (2011) - [i14]Bernhard Haeupler, David R. Karger:
Faster Information Dissemination in Dynamic Networks via Network Coding. CoRR abs/1104.2527 (2011) - [i13]Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov:
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance. CoRR abs/1104.2944 (2011) - [i12]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance. CoRR abs/1105.2397 (2011) - [i11]Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn:
Computing a Maximal Independent Set Using Beeps. CoRR abs/1108.1926 (2011) - [i10]Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Lotker:
Self-Adjusting Networks to Minimize Expected Path Length. CoRR abs/1110.0196 (2011) - 2010
- [c6]Bernhard Haeupler, Barna Saha, Aravind Srinivasan:
New Constructive Aspects of the Lovasz Local Lemma. FOCS 2010: 397-406 - [c5]Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity When the Common Graph Is 2-Connected. ISAAC (2) 2010: 410-421 - [c4]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler:
Deterministic Algorithms for the Lovász Local Lemma. SODA 2010: 992-1004 - [i9]Bernhard Haeupler, Barna Saha, Aravind Srinivasan:
New Constructive Aspects of the Lovasz Local Lemma. CoRR abs/1001.1231 (2010) - [i8]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler:
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections. CoRR abs/1006.3030 (2010) - [i7]Bernhard Haeupler, Krishnam Raju Jampani, Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected. CoRR abs/1009.4517 (2010) - [i6]Bernhard Haeupler:
Analyzing Network Coding Gossip Made Easy. CoRR abs/1010.0558 (2010)
2000 – 2009
- 2009
- [c3]Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Rank-Pairing Heaps. ESA 2009: 659-670 - [c2]Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Rank-Balanced Trees. WADS 2009: 351-362 - [i5]Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Heaps Simplified. CoRR abs/0903.0116 (2009) - [i4]Arnab Bhattacharyya, Bernhard Haeupler:
Robust Regulatory Networks. CoRR abs/0904.4360 (2009) - [i3]Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler:
Deterministic Algorithms for the Lovasz Local Lemma. CoRR abs/0908.0375 (2009) - 2008
- [j2]Bernhard Haeupler, Robert Endre Tarjan:
Planarity Algorithms via PQ-Trees (Extended Abstract). Electron. Notes Discret. Math. 31: 143-149 (2008) - [j1]Bernhard Haeupler, Robert Endre Tarjan:
Finding a feasible flow in a strongly connected network. Oper. Res. Lett. 36(4): 397-398 (2008) - [c1]Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Endre Tarjan:
Faster Algorithms for Incremental Topological Ordering. ICALP (1) 2008: 421-433 - [i2]Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Incremental Topological Ordering and Strong Component Maintenance. CoRR abs/0803.0792 (2008) - 2007
- [i1]Bernhard Haeupler, Robert Endre Tarjan:
Finding a Feasible Flow in a Strongly Connected Network. CoRR abs/0711.2710 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-08-12 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
