Tootfinder

Fault-Tolerant Decentralized Distributed Asynchronous Federated Learning with Adaptive Termination Detection
Phani Sahasra Akkinepally, Manaswini Piduguralla, Sushant Joshi, Sathya Peri, Sandeep Kulkarni
https://arxiv.org/abs/2509.02186

Fault-Tolerant Decentralized Distributed Asynchronous Federated Learning with Adaptive Termination Detection
Federated Learning (FL) facilitates collaborative model training across distributed clients while ensuring data privacy. Traditionally, FL relies on a centralized server to coordinate learning, which creates bottlenecks and a single point of failure. Decentralized FL architectures eliminate the need for a central server and can operate in either synchronous or asynchronous modes. Synchronous FL requires all clients to compute updates and wait for one another before aggregation, guaranteeing con…

Quantum computing on encrypted data with arbitrary rotation gates
Mohit Joshi, Manoj Kumar Mishra, S. Karthikeyan
https://arxiv.org/abs/2508.18811 https://…

Quantum computing on encrypted data with arbitrary rotation gates
An efficient technique of computing on encrypted data allows a client with limited capability to perform complex operations on a remote fault-tolerant server without leaking anything about the input or output. Quantum computing provides information-theoretic security to solve such a problem, and many such techniques have been proposed under the premises of half-blind quantum computation. However, they are dependent on a fixed non-parametric resource set that comprises some universal combination…

Wait-free Replicated Data Types and Fair Reconciliation
Petr Kuznetsov, Maxence Perion, Sara Tucci-Piergiovanni
https://arxiv.org/abs/2508.18193 https://ar…

Wait-free Replicated Data Types and Fair Reconciliation
Replication is a standard way to maintain availability of shared data in fault-prone distributed systems. To make sure that the data replicas are up-to-date, they need to synchronize, which typically means engaging the replicas in waiting for coherent responses from each other. The amount of waiting depends on the consistency and availability guarantees we impose on the system. The folklore CAP theory states that strong consistency (the set of replicas create an illusion of one correct server) …