3 citations · 3 across the 12 of their papers we have counts for
6 papers · 1 filter
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…
Privacy Attacks on Stable Marriage
Stephan A. Fahrenkrog-Petersen, Aleksander Figiel, Darya Melnyk +2
The stable marriage problem appears in many privacy-sensitive domains, for example in the National Resident Matching Program in the US. In such applications, preserving the privacy…
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…
Online Graph Embedding in Star Graphs
Julien Dallot, Darya Melnyk, Maciej Pacut +1
Graph embedding is a fundamental problem of mapping nodes of a guest graph into a host graph while minimizing the distance distortion, with broad applications, including virtual ne…
Practical Validity Conditions for Byzantine-Tolerant Federated Learning
Mélanie Cambus, Darya Melnyk, Tijana Milentijević +1
Robust aggregation is the core operation in Byzantine-tolerant federated learning. To ensure the quality of aggregation independently of data distribution or attacks, validity cond…
The Carrier Pigeon Internet Protocol: An Algorithmic (and Lighthearted) Perspective
Matthias Bentert, Shay Kutten, Darya Melnyk +2
The theoretical model behind the pigeon post as a link layer in a communication network was introduced by Shannon (under the guise of studying One-Time Pads for cryptography). That…