Deterministic Consensus
Deterministic Consensus is a consensus algorithm that, given a set of inputs and system conditions, always produces the same agreement outcome without reliance on randomization or probabilistic choices.
22
Publications
901
Citations
50
Authors
33
Institutions
Publications per year
2017–2026
6
Parents
22
Deterministic Rendezvous in Graphs
Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski et al. · Algorithmica · 2006 · 179 citations
Sticky bits and universality of consensus
Serge Plotkin · 1989 · 85 citations
Lower bounds for distributed coin-flipping and randomized consensus
James Aspnes · Journal of the ACM · 1998 · 59 citations · Full text
An Extensible Consensus Algorithm Based on PBFT
1–5 of 22
50
4
h-index
3
h-index
Institut de Recherche en Informatique et Systèmes Aléatoires, France
1 publications · 11 citations
2
h-index
2
h-index
2
h-index
1–5 of 50
33
Yale University
New Haven, United States
4 h-index
4 publications
105 citations

University of Liverpool
Liverpool, United Kingdom
3 h-index
3 publications
216 citations

University of Colorado Denver
Denver, United States
2 h-index
2 publications
37 citations

University of Toronto
Toronto, Canada
2 h-index
2 publications
33 citations
Stanford University
Stanford, United States
2 h-index
3 publications
109 citations

Tel Aviv University
Tel Aviv, Israel
2 h-index
3 publications
54 citations

University of Warsaw
Warsaw, Poland
1 h-index
1 publications
27 citations
Georgetown University
Washington, United States
1 h-index
1 publications
19 citations
1–8 of 33
Repository · 1 publications · 11 citations
2
h-index
1 publications · 17 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 14 citations
1
h-index
1 publications · 179 citations
1
h-index
1–5