This paper studies the classical contention-resolution problem with an adversarial scheduler and achieves efficiency bounds.

The paper proposes a deterministic, version-aware aggregation method that significantly outperforms existing LLM-based systems for resolving memory conflicts in fact consolidation tasks.

This paper revisits packet delay analysis in network calculus and derives a new bound that improves over the classical bound.

This paper proves that a strongly consistent solution to the Causal Observability Problem is unachievable at the observable boundary and explores the impact of instrumentation placement on monitor gua…

This paper proposes an arbiter for resolving conflicts between xApps in Open RAN by monitoring the fidelity of a network digital twin and switching between actions based on observed utility.

This paper proposes FairWave, a DAG BFT protocol that balances Sybil resistance, reward distribution fairness, and protection against persistent plutocracy.

This paper improves upon existing AI debate protocols for complex problem-solving.

This paper establishes a timing attack against network-agnostic guardians in time-triggered communication protocols, causing collisions with critical messages and remaining undetected.

The paper proposes a method to improve the performance of fine-grained offloads on servers by overlapping the offload with other requests using server-side routing.

This paper argues that idle cores on contemporary multicore processors can return compute capacity and proposes a budget-centric view of service core systems.

The paper proves that for resources with structural parallelizability (like divisibility and transferability), it is impossible to enforce a linear cost for concentrating influence, demonstrating that…

This paper introduces ARAT, a system combining RF, k-NN, and meta-model agents to mitigate correlated agreement blindness in multi-agent arbitration.

This paper proposes LMS-AR, a memory bandwidth regulation mechanism for multi-core systems using a Linux kernel module with adaptive filtering for prediction and regulation.

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…

BFTide is a protocol adaptation architecture that enables a BFT system to switch between different protocols based on network conditions.