3 citations · 3 across the 10 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2026
Faster Convergence of Multidimensional Approximate Agreement via Smallest Enclosing Balls
Darya Melnyk
This work considers the multidimensional approximate agreement problem. In this problem, parties in a distributed system, up to of which may be corrupted by a Byzantine adv…
cs.DC2026
Resilient Byzantine Agreement with Predictions
Julien Dallot, Darya Melnyk, Tijana Milentijevic +2
This paper studies the Byzantine Agreement problem where the nodes have access to a predictor that flags nodes for suspicion of faulty (Byzantine) behavior. We focus on algorithmic…