The paper introduces AsyncTool, a new benchmark designed to evaluate LLM agents' ability to handle multiple, concurrent tasks with delayed tool feedback, demonstrating that asynchronous coordination i…

This paper introduces Retriever, an asynchronous decision model and runtime system for building long-horizon robot agents with explicit clock and input-consumption semantics.

An R package named rush is introduced, which provides a shared-state coordination layer for asynchronously parallelized iterative algorithms using a Redis database.

This paper introduces the FedSaSync strategy for Semi-Asynchronous Federated Learning in the Flower framework, improving robustness and reducing idle time in heterogeneous environments.

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

This paper presents an automated verification technique for safety properties of affine distributed protocols with an unbounded number of actors.

SecureAFL introduces a robust framework to secure asynchronous Federated Learning against poisoning attacks by detecting anomalous updates, estimating missing client contributions, and using Byzantine…

The paper introduces new benchmarks for complex asynchronous planning and demonstrates that general constraint satisfaction formalizers (like CP-SAT) significantly outperform direct LLM planning or tr…

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

RACE-Sched is an asynchronous agentic framework that successfully integrates low-latency, real-time scheduling decisions with advanced, long-horizon reasoning provided by Large Language Models.

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…

A new lock, SemanticLock, is proposed based on conflict graphs between operations, demonstrated effective in two applications: a toy data structure and ConcurrentHashMap.

The paper presents an approach for verifying stateful and unbounded cryptographic protocols using compositional type-based reasoning and trace-based reasoning.

This paper proposes Synchronization-Free All-Reduce (SiFAR) to reduce All-Reduce latency and improve end-to-end throughput in low-latency inference systems.

The paper presents BigBag, an agentic framework that generates reusable fixing transformations for third-party library breaking API changes, achieving a compilable transformation rate of 94.3% and a f…