This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…

The authors resolve the contradiction between deterministic crash-tolerant consensus in a fully asynchronous environment and the FLP impossibility result by demonstrating that one protocol phase separ…

Proposed an asynchronous block coordinate descent algorithm for distributed trajectory estimation in robotics, reducing communications by up to 96.9% and achieving exponential convergence.

This paper introduces Epistemic Byzantine Fault Tolerance (EBFT), a fault-tolerance model for agentic infrastructure and post-deterministic distributed systems, addressing the Honest Quorum Problem an…

The paper proposes DySCo, a dynamic trust-aware sparse consensus mechanism, to efficiently manage communication in multi-agent LLM systems by selectively connecting agents based on real-time value, th…

This paper proposes a decentralized collaborative learning paradigm for Tsetlin Machines using consensus-based inference, allowing heterogeneous agents to maintain their own private models and combine…

The paper proposes a Network Distributed Multi-Agent Reinforcement Learning (ND-MARL) framework that enables stable, scalable consensus control for large swarms of quadcopters using only local neighbo…

This paper investigates how network perturbations can alter the asymptotic agreement trajectory in distributed coordination systems, proving fragility in standard cooperative output regulation schemes…

This paper proposes improvements to rotating-leader consensus protocols and their underlying P2P networks in blockchain systems, achieving up to 7.26x peak throughput improvement.

The paper analyzes a new class of asynchronous adaptive first-order optimization methods and proves their stochastic convergence rate is O(1/sqrt{t}) for non-convex functions.

The paper presents an algorithm for updating a Directed Minimum Spanning Tree using the weighted matroid intersection algorithm and a dynamic auxiliary graph.

This paper proposes TRM-Raft, a Byzantine-resistant enhancement for Raft consensus that integrates a Blockchain-based Trust and Reputation Model to prevent election forgery and log tampering.

The paper proposes using an LLM aggregator that analyzes complete reasoning traces, demonstrating that trace-level synthesis is superior to traditional consensus methods like majority voting for solvi…

The paper introduces Post-Deterministic Distributed Systems (PDDS) as a new model to coordinate autonomous infrastructure where participants, including stochastic agents, produce divergent reasoning p…

Gatling is a new atomic broadcast protocol that achieves arbitrarily small inter-proposal times, even smaller than the network delay, by running multiple parallel instances of a black-box atomic broad…