Demo Data from EDBT 2026 / reviewers in the wild / expert
Hanan Weisman
dblp:40/6637
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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.
| 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 computing theory › shared memory
shared-memory synchronization |
0.0 | 1 | 1993 | A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract) · PODC 1993 |
Distributed computing theory › consensus
consensus number |
0.0 | 1 | 1993 | A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract) · PODC 1993 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract)abstractWe study a class of synchronization objects in shared memory concurrent systems, which we call common2.This class contains r-ead-modify-wr-ife objects that commute (e.g.fetch-and-add), or overwrite (e.g.swap) and queue shared objects.It is known that this class is contained in the consensus number 2 class of objects [Her91a], and most of the commonly used objects with consensus number 2 are included in it.We show that any object in the common~class can implement any other object in the class, in a system with an arbitrary number of processes.In fact we show that the objects Yehuda Afek, Eytan Weisberger, Hanan Weisman |
PODC | 3 |