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.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Smadar Levy

dblp:132/3939 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—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

TopicWeightPapersLastEvidence papers
Distributed computing theory
mutual exclusion		 0.212013
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract · PODC 2013
Distributed computing theory › shared memory
shared-memory algorithms		 0.212013
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract · PODC 2013

Methods — techniques the papers use, named apart from their topics

local-spin algorithms · 0.2RMR complexity analysis · 0.2
YearPublicationVenuePosition
2013 An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract
abstract
Mutual exclusion is a fundamental coordination problem. Over the last 20 years, shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric.
Hagit Attiya, Danny Hendler, Smadar Levy
 PODC3