3 papers
cs.DC2025
Strong Linearizability without Compare&Swap: The Case of Bags
Faith Ellen, Gal Sela
Because strongly-linearizable objects provide stronger guarantees than linearizability, they serve as valuable building blocks for the design of concurrent data structures. Yet, ma…
cs.DC2025
Distributed Graph Algorithms with Predictions
Joan Boyar, Faith Ellen, Kim S. Larsen
We initiate the study of deterministic distributed graph algorithms with predictions in synchronous message passing systems. The process at each node in the graph is given a predic…
cs.DC2025
Byzantine Agreement with Predictions
Naama Ben-David, Muhammad Ayaz Dzulfikar, Faith Ellen +1
In this paper, we study the problem of \emph{Byzantine Agreement with predictions}. Along with a proposal, each process is also given a prediction, i.e., extra information which is…