R
Rüdiger Reischuk
Researcher at University of Lübeck
Publications - 127
Citations - 2181
Rüdiger Reischuk is an academic researcher from University of Lübeck. The author has contributed to research in topics: Boolean function & Time complexity. The author has an hindex of 21, co-authored 126 publications receiving 2096 citations. Previous affiliations of Rüdiger Reischuk include Darmstadt University of Applied Sciences & Saarland University.
Papers
More filters
Journal ArticleDOI
Renaming in an asynchronous environment
TL;DR: This paper shows that problems of processor renaming can be solved even in the presence of up to up to 2 faulty processors, contradicting the widely held belief that no nontrivial problem can be solve in such a system.
Journal ArticleDOI
Bounds on information exchange for Byzantine agreement
Danny Dolev,Rüdiger Reischuk +1 more
TL;DR: The amount of information exchange necessary to ensure Byzantine Agreement is studied and a lower bound is shown for the number of signatures for any algorithm using authentication and algorithms that achieve this bound are presented.
Journal ArticleDOI
Probabilistic Parallel Algorithms for Sorting and Selection
TL;DR: Probabilistic parallel algorithms are described to sort n keys and to select the k-smallest element among them to meet the information theoretic lower bounds.
Journal ArticleDOI
On alternation
TL;DR: For wellbehaved functions t(n) every nondeterministic t( n)-time bounded 1-tape Turing machine can be simulated by a deterministic ((nlogn)1/2 + (t(n))1/ 2)-tape bounded off-line Turing machine.
Journal ArticleDOI
A new solution for the byzantine generals problem
TL;DR: A deterministic algorithm is presented that exhibits early stopping by phase 2f+4 in the worst case, where f is the actual number of faults, under less stringent conditions than the ones of previous algorithms.