Demo Data from EDBT 2026 / reviewers in the wild / expert
Hossein Naderibeni
dblp:347/2169
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2024
0009-0003-2061-5053ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-author · 2 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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed computing theory › synchronization primitives
compare-and-swap |
0.7 | 1 | 2023 | A Wait-free Queue with Polylogarithmic Step Complexity · PODC 2023 |
Distributed computing theory › concurrent objects
concurrent data structures |
0.7 | 1 | 2023 | A Wait-free Queue with Polylogarithmic Step Complexity · PODC 2023 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | A wait-free queue with polylogarithmic step complexity
Hossein Naderibeni, Eric Ruppert |
Distributed Comput. | 1 |
| 2023 | A Wait-free Queue with Polylogarithmic Step ComplexityabstractWe present a novel linearizable wait-free queue implementation using single-word CAS instructions. Previous lock-free queue implementations from CAS all have amortized step complexity of Ω(p) per operation in worst-case executions, where p is the number of processes that access the queue. Our new wait-free queue takes O(log p) steps per enqueue and O(log2 p + log q) steps per dequeue, where q is the size of the queue. A bounded-space version of the implementation has O(log p log(p + q)) amortized step complexity per operation. Hossein Naderibeni, Eric Ruppert |
PODC | 1 |