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.
EDBT 2026 Demo / reviewers in the wild / expert

Edward A. Lycklama

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

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

Software engineering, systems software and programming languages · 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%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Concurrent programming › synchronization
shared-memory synchronization		 0.011991
A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables · ACM Trans. Program. Lang. Syst. 1991
Concurrent programming
synchronization		 0.011991
A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables · ACM Trans. Program. Lang. Syst. 1991
Distributed computing theory
mutual exclusion		 0.011991
A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables · ACM Trans. Program. Lang. Syst. 1991

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

non-atomic shared registers · 0.0
YearPublicationVenuePosition
1991 A First-Come-First-Served Mutual-Exclusion Algorithm with Small Communication Variables
abstract
We present an algorithm for the mutual-exclusion problem that satisfies the "first-come-firstserved" property and requires only five shared bits per participant.The algorithm works in a model of concurrency that does not assume atomic operations.
Edward A. Lycklama, Vassos Hadzilacos
 ACM Trans. Program. Lang. Syst.1