Demo Data from EDBT 2026 / reviewers in the wild / expert
Nicholas Christman
dblp:30/7208
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% | |
| Theoretical computer science
1 paper |
Distributed computing theory · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
consensus |
0.1 | 1 | 2009 | Extracting quorum failure detectors · PODC 2009 |
Distributed computing theory › fault tolerance
failure detectors |
0.1 | 1 | 2009 | Extracting quorum failure detectors · PODC 2009 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Extracting quorum failure detectorsabstractIt is well known that the failure detector Ω is necessary and sufficient to solve consensus in asynchronous message passing systems where a majority of processes is guaranteed to be correct [1,2]. But what if the problem were to be solved in an arbitrary environment where any number of processes may fail and at any times? The answer was provided by Delporte et al who showed that a certain quorum failure detector, which they called Σ, is necessary and, together with Ω, sufficient to solve consensus in any environment [4]. Vibhor Bhatt, Nicholas Christman, Prasad Jayanti |
PODC | 2 |