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 VLDB 2026 / reviewers in the wild / expert

Laura S. Sabel

dblp:92/4302 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorSecurity and privacy · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 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
Distributed systems
distributed coordination and fault tolerance		 0.011994
Simulating Fail-Stop in Asynchronous Distributed Systems · PODC 1994
Distributed systems › fault tolerance › failure models
fail-stop errors		 0.011994
Simulating Fail-Stop in Asynchronous Distributed Systems · PODC 1994
Distributed computing theory
asynchronous systems		 0.011994
Simulating Fail-Stop in Asynchronous Distributed Systems · PODC 1994
YearPublicationVenuePosition
1994 Simulating Fail-Stop in Asynchronous Distributed Systems
abstract
No abstract available.
Laura S. Sabel, Keith Marzullo
 PODC1
1994 Simulating Fail-Stop in Asynchronous Distributed Systems
abstract
The fail-stop failure model appears frequently in the distributed systems literature. However, in an asynchronous distributed system, the fail-stop model cannot be implemented. In particular, it is impossible to reliably detect crash failures in an asynchronous system. In this paper, we show that it is possible to specify and implement a failure model that is indistinguishable from the fail-stop model from the point of view of any process within an asynchronous system. We give necessary conditions for a failure model to be indistinguishable from the fail-stop model, and derive lower bounds on the amount of process replication needed to implement such a failure model. We present a simple one-round protocol for implementing one such failure model, which we call simulated fail-stop.>
Laura S. Sabel, Keith Marzullo
 SRDS1
1994 Efficient Detection of a Class of Stable Properties
Keith Marzullo, Laura S. Sabel
 Distributed Comput.2