From the 1 of 11 linked papers with an AI index.
11 papers
Privacy Attacks on Stable Marriage
Stephan A. Fahrenkrog-Petersen, Aleksander Figiel, Darya Melnyk +2
The paper shows that repeated interactions with the Gale‑Shapley stable marriage algorithm can leak the private preference lists of participants, and it identifies conditions under…
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…
BSB: Towards Demand-Aware Peer Selection With XOR-based Routing
Qingyun Ji, Darya Melnyk, Arash Pourdamghani +1
Peer-to-peer networks, as a key enabler of modern networked and distributed systems, rely on peer-selection algorithms to optimize their scalability and performance. Peer-selection…