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…

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 develops a formal economic framework to assess the security of VDF-based randomness beacons, demonstrating that many proposed delays are economically insecure due to rational, profit-motiva…

The paper provides a tight, transparent, and closed-form analysis of the trade-off function for Differentially Private SGD using random shuffling, significantly improving upon previous methods and est…

This paper investigates the necessity of interaction for order-optimal 1-bit mean estimation in nonparametric finite-moment classes.

The paper develops a stochastic framework using Laplace-Carson transforms to model and quantify optimal proactive defense timing against a single cyberattack, providing closed-form solutions for defen…

The paper develops a unified theoretical framework to systematically characterize the optimal privacy-utility trade-off (PUT) and optimal Local Differential Privacy (LDP) channels for general statisti…

This paper proposes a reliability-aware framework to solve the fuzzy shortest path problem in directed graphs, optimizing routes based not only on cost but also on the reliability of the associated fu…

This paper presents a local computation algorithm to approximate the top eigenvector of a symmetric matrix with entries between -1 and 1, building on Swartworth and Woodruff's work.

This paper introduces approximation-preserving coresets, which provide weaker guarantees than strong coresets but stronger guarantees than weak coresets for preserving the costs of good solutions in b…

This paper investigates the tradeoff between parameter estimation and predictive accuracy in probabilistic temporal graphs, proposing a causal framework for evaluation.

This paper introduces online assignment policies for stochastic matching on hypergraphs, which are maximally stable and allow for the derivation of necessary and sufficient stability criteria.

This paper studies the autarky problem of scheduling energy-consuming jobs with time windows using a battery and an energy forecast, and shows NP-hardness, polynomial-time solvability, and fixed-param…

The paper introduces CaDDTree, a cost-aware method that optimizes token throughput by jointly selecting the tree structure and node budget for speculative decoding, outperforming existing methods like…