default search action
Bernhard Haeupler
Person information
- affiliation: ETH Zurich, Switzerland
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c98]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 - [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 - [i96]Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak:
Dynamic Deterministic Constant-Approximate Distance Oracles with nε Worst-Case Update Time. CoRR abs/2402.18541 (2024) - [i95]Bernhard Haeupler, Shyamal Patel, Antti Roeyskoe, Cliff Stein, Goran Zuzic:
Polylog-Competitive Deterministic Local Routing and Scheduling. CoRR abs/2403.07410 (2024) - [i94]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) - [i93]Bernhard Haeupler, D. Ellis Hershkowitz, Zihan Tan:
New Structures and Algorithms for Length-Constrained Expander Decompositions. CoRR abs/2404.13446 (2024) - [i92]Bernhard Haeupler, D. Ellis Hershkowitz, Jason Li, Antti Roeyskoe, Thatchaphol Saranurak:
Low-Step Multi-Commodity Flow Emulators. CoRR abs/2406.14384 (2024) - [i91]Dorsa Fathollahi, Bernhard Haeupler, Nicolas Resch, Mary Wootters:
Interactive Coding with Small Memory and Improved Rate. CoRR abs/2408.06541 (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 (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 (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 (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 (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]