Demo Data from EDBT 2026 / reviewers in the wild / expert
Pazi Boxer
dblp:74/4002
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2000
—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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed computing theory › shared memory
multi-writer registers |
0.0 | 1 | 2000 | Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract) · PODC 2000 |
Distributed computing theory
shared memory |
0.0 | 1 | 2000 | Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract) · PODC 2000 |
Distributed computing theory › shared memory
shared-memory synchronization |
0.0 | 1 | 2000 | Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract) · PODC 2000 |
Methods — techniques the papers use, named apart from their topics
lower bound analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract)abstractIn this paper we prove: For any constant d there is a large enough n such that there is no long-lived adaptive implementation of collect or renaming in the read write model with n processes that uses d or less MWMR registers. Yehuda Afek, Pazi Boxer, Dan Touitou |
PODC | 2 |