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

Dalia Dauber

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

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

Theory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 67% Parallel and multicore computing · 33%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems
distributed coordination and fault tolerance		 0.011995
Wait-free made fast (Extended Abstract) · STOC 1995
Parallel and multicore computing › synchronization
non-blocking synchronization		 0.011995
Wait-free made fast (Extended Abstract) · STOC 1995
Distributed systems › concurrency control
wait-free synchronization		 0.011995
Wait-free made fast (Extended Abstract) · STOC 1995
Distributed computing theory › shared memory
shared-memory algorithms		 0.011995
Wait-free made fast (Extended Abstract) · STOC 1995

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

wait-free algorithm · 0.0consensus · 0.0
YearPublicationVenuePosition
1995 Wait-free made fast (Extended Abstract)
abstract
An implementationof an asynchronous shared-data structure is wait-free if no adversarial scheduler can stop an individual operation on the data structure from making progress (that is the implementation can tolerate a fail-stop fault of any number of processes).An implementation is non-blocking if an adversarial scheduler cannot stop the system from making progress.of the Assoc!abon of Computing Machinery.o cop otherwse, or to repubhsh, requires y '/' a fee ancf/or soecl IC oermisslon.STOC' 95, L& Veg&, Nevada, USA @ 1995 ACM 0-89791 -718-9/95/0005..$3.50 places the O(n) term of wait-free implementations with an O(k) term (or O(k~log f)).
Yehuda Afek, Dalia Dauber, Dan Touitou
 STOC2