Demo Data from EDBT 2026 / reviewers in the wild / expert
Ciprian Manolescu
dblp:129/1519
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · unresolved
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.
| Theoretical computer science
1 paper |
Distributed computing theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed computing theory
asynchronous computability |
0.2 | 1 | 2014 | A generalized asynchronous computability theorem · PODC 2014 |
Distributed computing theory › asynchronous computability
asynchronous computability theorem |
0.2 | 1 | 2014 | A generalized asynchronous computability theorem · PODC 2014 |
Distributed computing theory › asynchronous computability
immediate snapshot |
0.2 | 1 | 2014 | A generalized asynchronous computability theorem · PODC 2014 |
Methods — techniques the papers use, named apart from their topics
algebraic topology · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | A generalized asynchronous computability theoremabstractWe consider the models of distributed computation defined as subsets of the runs of the iterated immediate snapshot model. Given a task T and a model M, we provide topological conditions for T to be solvable in M. When applied to the wait-free model, our conditions result in the celebrated Asynchronous Computability Theorem (ACT) of Herlihy and Shavit. Eli Gafni, Petr Kuznetsov, Ciprian Manolescu |
PODC | 3 |