This paper proves that no single-pass semi-streaming algorithm can achieve a better-than-half approximation to the maximum matching problem, implying the optimality of the naive greedy algorithm.

The paper develops a new framework for proving lower bounds for the maximum matching problem in the semi-streaming model, improving upon the previous best known bounds.

This paper presents two techniques, dynamic checkpointing and progress-aware load redistribution, to maintain forward progress and balanced execution in real-time scientific workflows using the produc…

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 proposes a compact semantics for nonterminating computation residuals using tail-clusters in the Stone-Cech compactification, providing a common framework for various types of recurrence an…

This paper introduces a streaming model with catalytic memory and shows dramatic space savings for data stream algorithms, providing exact computation of frequency moments using multi-pass algorithms…

The paper introduces an efficient, novel algorithm for incremental Byte Pair Encoding (BPE) tokenization that processes input text prefix by prefix, achieving significant speedups and enabling streami…

This paper proposes a framework for federated learning with limited client memory and time-varying sampling costs, and develops an Active-Constraint Drift-Plus-Penalty (ACDPP) policy to minimize the c…

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…

The paper introduces StreamMA, a streaming multi-agent reasoning system that significantly reduces latency and improves effectiveness by passing reasoning steps to downstream agents as they are genera…

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.

The paper proposes a novel method to automatically enforce differential privacy in stream-based runtime monitoring specifications by analyzing temporal dependencies and injecting calibrated noise.

The paper presents Dyserve, a workflow-aware serving layer for agentic AI applications that compiles per-node model and verifier choices into an integer linear program, allowing for efficient model se…

SANA-Streaming introduces a novel, efficient framework that enables real-time, high-resolution streaming video-to-video editing by combining a hybrid diffusion transformer with specialized training an…

CALIBURN introduces a novel, five-component streaming pipeline for intrusion detection that allows operators to specify alerting behavior using cost and budget constraints, achieving state-of-the-art…

The paper analyzes transaction fee mechanisms in modern blockchains that use parallel execution and contingency, proving an inherent trade-off between minimizing risks for users and maximizing revenue…

This paper explores five methods for making a linked list work efficiently with multiple threads, from using one big lock to a lock-free design.

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…

The paper analyzes Ethereum builder transactions to show that builder centralization is an emergent property of the Proposer-Builder Separation (PBS) architecture, driven by specific order flow and ME…