This paper presents an epistemic logic framework for studying randomized algorithms in distributed computation.

Convergence time of 3-Majority and 2-Choices dynamics on complete graph in synchronous model

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…

A new algorithm is developed for distributed optimization in networked nonlinear systems with input delays and consensus constraints.

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 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…

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…

This paper introduces the Organizational Consensus Algorithm (OCA) for internal negotiation and decision coordination in organizational structures, modeling inter-departmental conflict as a dynamic ga…

This paper studies the wait-free solvability of approximate agreement among asynchronous processes with shared read-write registers.

The paper proves that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting.

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…

This paper presents lemmas on the structure of temporal connectivity in temporal graphs.