• Publications
  • Influence
Renaming in an asynchronous environment
TLDR
This paper is concerned with the solvability of the problem of processor renaming in unreliable, completely asynchronous distributed systems, contradicting the widely held belief that no nontrivial problem can be solved in such a system. Expand
  • 336
  • 38
  • PDF
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
TLDR
We show that even if we allow nonuniform algorithms, an arbitrary number of processors, and arbitrary instruction sets, $\Omega (\log n)$ is a lower bound on the time required to compute various simple functions, including sorting n keys and finding the logical “or” of n bits. Expand
  • 349
  • 22
Early stopping in Byzantine agreement
TLDR
This paper deals with the number of rounds of message exchange required to reach Byzantine Agreement of either kind (BA). Expand
  • 247
  • 17
  • PDF
Bounds on information exchange for Byzantine agreement
TLDR
Byzantine Agreement has become increasingly important in establishing distributed properties when errors may exist in the systems. Expand
  • 203
  • 17
  • PDF
Probabilistic Parallel Algorithms for Sorting and Selection
TLDR
Probabilistic parallel algorithms are described to sort n keys and to select the k-smallest element among them. Expand
  • 126
  • 7
Learning Juntas in the Presence of Noise
TLDR
We show that large classes of Boolean concepts that only depend on a small fraction of their variables—so-called juntas—can be learned efficiently from uniformly distributed examples corrupted by random attribute and classification noise. Expand
  • 14
  • 5
  • PDF
A New Solution for the Byzantine Generals Problem
  • R. Reischuk
  • Computer Science, Mathematics
  • Inf. Control.
  • 1 March 1985
TLDR
We define a new model for algorithms to reach Byzantine Agreement. Expand
  • 74
  • 4
Reliable computation with noisy circuits and decision trees-a general n log n lower bound
TLDR
Boolean circuits in which gates independently make errors with probability (at most) epsilon are considered. Expand
  • 59
  • 4
  • PDF
Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs
TLDR
The time complexity of Boolean functions on abstract concurrent-read exclusive-write parallel random access machines (CREW PRAMs) is considered. Expand
  • 53
  • 4
Taschenbuch der Algorithmen
  • 10
  • 3
...
1
2
3
4
5
...