Publications Conference proceedings (13) Low-Congestion Shortcuts for Graphs Excluding Dense Minors Author(s): Mohsen Ghaffari, Bernhard Haeupler Published in: PODC: ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2021 Publisher: ACM DOI: 10.1145/3465084.3467935 A Time-Optimal Randomized Parallel Algorithm for MIS Author(s): Mohsen Ghaffari, Bernhard Haeupler Published in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021 Publisher: ACM DOI: 10.1137/1.9781611976465.172 Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing Author(s): Goran Zuzic, Gramoz Goranci, Mingquan Ye, Bernhard Haeupler, Xiaorui Sun Published in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2022 Publisher: ACM DOI: 10.1137/1.9781611977073.100 Universally-Optimal Distributed Algorithms for Known Topologies Author(s): Bernhard Haeupler, David Wajc, Goran Zuzic Published in: STOC: ACM Symposium on Theory of Computing, 2021 Publisher: ACM DOI: 10.1145/3406325.3451081 Network Coding Gaps for Completion Times of Multiple Unicasts Author(s): Bernhard Haeupler, David Wajc, Goran Zuzic Published in: FOCS: IEEE Symposium on Foundations of Computer Science, 2020 Publisher: IEEE DOI: 10.1109/focs46700.2020.00053 Hop-Constrained Oblivious Routing Author(s): Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic Published in: STOC: ACM Symposium on Theory of Computing, 2021 Publisher: ACM DOI: 10.1145/3406325.3451098 Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates Author(s): Marcel Bezdrighin; Michael Elkin; Mohsen Ghaffari; Christoph Grunau; Bernhard Haeupler; Saeed Ilchi; Václav Rozhoň Published in: SPAA: ACM Symposium on Parallelism in Algorithms and Architectures, 2022 Publisher: ACM DOI: 10.1145/3490148.3538565 Computation-Aware Data Aggregation Author(s): Bernhard Haeupler, Ellis Hershkowitz, Anson Kahng, Ariel D. Procaccia Published in: ITCS: ACM-SIGACT Innovations in Theoretical Computer Science Conference, 2020 Publisher: ACM DOI: 10.4230/lipics.itcs.2020.65 Writeback Aware Caching Author(s): Nathan Beckmann, Phillip Gibbons, Bernhard Haeupler, Charles McGuffey Published in: APOCS: ACM-SIAM Symposium on Algorithmic Principles of Computer Systems, 2020 Publisher: ACM DOI: 10.1137/1.9781611976021.1 Efficient Linear and Affine Codes for Correcting Insertions/Deletions Author(s): Kuan Cheng, Bernhard Haeupler, Venkatesan Guruswami, Xin Li Published in: SODA: ACM-SIAM Symposium on Discrete Algorithms, 2021 Publisher: ACM DOI: 10.1137/1.9781611976465.1 Optimally Resilient Codes for List-Decoding from Insertions and Deletions Author(s): Bernhard Haeupler, Amirbehshad Shahrasbi, Venkatesan Guruswami Published in: STOC: ACM Symposium on Theory of Computing, 2020 Publisher: ACM DOI: 10.1145/3357713.3384262 Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes Author(s): Haeupler, Bernhard; Shahrasbi, Amirbehshad Published in: ITW: IEEE Information Theory Workshop, 2022 Publisher: IEEE DOI: 10.48550/arxiv.2009.13307 Tree Embeddings for Hop-Constrained Network Design Author(s): Bernhard Haeupler, Ellis Hershkowitz, Goran Zuzic Published in: STOC: ACM Symposium on Theory of Computing, 2021 Publisher: ACM DOI: 10.1145/3406325.3451053 Peer reviewed articles (1) Synchronization Strings and Codes for Insertions and Deletions - a Survey Author(s): Bernhard Haeupler, Amirbehshad Shahrasbi Published in: IEEE Transactions on Information Theory, 2021, ISSN 0018-9448 Publisher: Institute of Electrical and Electronics Engineers DOI: 10.1109/tit.2021.3056317 Searching for OpenAIRE data... There was an error trying to search data from OpenAIRE No results available
