46 citations · 313 across the 68 of their papers we have counts for
12 papers · 1 filter
Near-Linear Time Insertion-Deletion Codes and (1+)-Approximating Edit Distance via Indexing
Bernhard Haeupler, Aviad Rubinstein, Amirbehshad Shahrasbi
We introduce fast-decodable indexing schemes for edit distance which can be used to speed up edit distance computations to near-linear time if one of the strings is indexed by an i…
Optimal strategies for patrolling fences
Bernhard Haeupler, Fabian Kuhn, Anders Martinsson +2
A classical multi-agent fence patrolling problem asks: What is the maximum length of a line that agents with maximum speeds can patrol if each point on the…
Algorithms for Noisy Broadcast under Erasures
Ofer Grossman, Bernhard Haeupler, Sidhanth Mohanty
The noisy broadcast model was first studied in [Gallager, TranInf'88] where an -character input is distributed among processors, so that each processor receives one input bi…
Computation-Aware Data Aggregation
Bernhard Haeupler, D Ellis Hershkowitz, Anson Kahng +1
Data aggregation is a fundamental primitive in distributed computing wherein a network computes a function of every nodes' input. However, while compute time is non-negligible in m…
Coding for Interactive Communication with Small Memory and Applications to Robust Circuits
Bernhard Haeupler, Nicolas Resch
Classically, coding theory has been concerned with the problem of transmitting a single message in a format which is robust to noise. Recently, researchers have turned their attent…
Erasure Correction for Noisy Radio Networks
Keren Censor-Hillel, Bernhard Haeupler, D Ellis Hershkowitz +1
The radio network model is a well-studied model of wireless, multi-hop networks. However, radio networks make the strong assumption that messages are delivered deterministically. T…