Proof-of-work is a central concept in modern cryptocurrencies and denial-ofservice
protection tools, but the requirement for fast verification so far has made it an easy prey for …

This is a survey on searching with errors, considered in the framework of two-person games.
The Responder thinks of an object in the search space, and the Questioner has to find it by …

The classic problem of searching an ordered list becomes more complicated when the
answers to queries are not reliable. In the prefix-bounded error model, the number of …

Some of the present day applications run on computer platforms with large and inexpensive
memories, which are also error-prone. Unfortunately, the appearance of even very few …

Introspective sorting is a ubiquitous sorting algorithm which underlies many large scale
distributed systems. Hardware-mediated soft errors can result in comparison and memory …

In this paper, we analyze the recursive merge sort algorithm and quantify the deviation of the
output from the correct sorted order if the outcomes of one or more comparisons are in error …

We investigate the design of algorithms resilient to memory faults, ie, algorithms that, despite
the corruption of some memory values during their execution, are able to produce a correct …

We investigate the problem of computing in the presence of faults that may arbitrarily (ie,
adversarially) corrupt memory locations. In the faulty memory model, any memory cell can …

We investigate the problem of reliable computation in the presence of faults that may
arbitrarily corrupt memory locations. In this framework, we consider the problems of sorting …

In this paper we investigate the design and analysis of algorithms resilient to memory faults.
We focus on algorithms that, despite the corruption of some memory values during their …