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

Or Ostrovsky

dblp:259/0106 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

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.

Software engineering, system software, and programming languages
1 paper
Concurrent programming · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Concurrent programming
concurrent data structures		 0.412020
Scaling concurrent queues by using HTM to profit from failed atomic operations · PPoPP 2020
Concurrent programming › concurrent data structures
concurrent queue		 0.412020
Scaling concurrent queues by using HTM to profit from failed atomic operations · PPoPP 2020
Concurrent programming
synchronization		 0.412020
Scaling concurrent queues by using HTM to profit from failed atomic operations · PPoPP 2020

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

hardware transactional memory · 0.4
YearPublicationVenuePosition
2020 Scaling concurrent queues by using HTM to profit from failed atomic operations
abstract
Queues are fundamental concurrent data structures, but despite years of research, even the state-of-the-art queues scale poorly. This poor scalability occurs because of contended atomic read-modify-write (RMW) operations.
Or Ostrovsky, Adam Morrison 0001
 PPoPP1