Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
EDBT 2026 Demo / reviewers in the wild / expert

Kayman Brusse

dblp:297/7923 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

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.

Theoretical computer science
1 paper
Distributed computing theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed computing theory
impossibility results		 0.512021
Reductions and Extension-Based Proofs · PODC 2021
Distributed computing theory › consensus
k-set agreement		 0.112021
Reductions and Extension-Based Proofs · PODC 2021
Distributed computing theory › concurrent objects
wait-free algorithms		 0.112021
Reductions and Extension-Based Proofs · PODC 2021
YearPublicationVenuePosition
2021 Reductions and Extension-Based Proofs
abstract
In the theory of distributed computing, the notion of a reduction is a common tool for proving impossibility results. If task T reduces to task S, and T is impossible to solve, then so is S. Extension-based proofs demonstrate the impossibility of solving a task in a wait-free manner by constructing an infinite execution. It is known that extension-based proofs are limited in power: there is no extension-based proof of the impossibility of a wait-free protocol in the NIS model for k-set agreement among n > k ≥ 2 processes.
Kayman Brusse, Faith Ellen
 PODC1