This paper proposes a non-greedy insertion strategy for linear probing hash tables, improving worst-case expected insertion time from Θ(x^2) to O(x log x).

This paper presents a lock-free linear-probing hash table with wait-free lookups, using a small amount of metadata and maintaining space efficiency.

The paper introduces and explores Truly Linear FPT (TLFPT), a complexity class defined by $O(n) + f(k)$, demonstrating that it is a strict subset of standard Linear FPT and providing new algorithms fo…

The paper introduces a robust streaming probing objective that requires multiple evidence tokens to support a prediction, significantly improving the detection of harmful intent in LLMs, especially in…

The paper introduces MafiaScope, an open testbed for measuring machine Theory of Mind in the social deduction game Mafia, where agents privately answer probe questions after every public utterance for…

The paper refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

The paper introduces the Generalized Thresholding Mechanism (GTM) to solve the generalized private testing problem in differential privacy, achieving near-optimal accuracy and sample complexity guaran…

This paper settles the complexity of three sketching problems in graphs and distributions.

This paper introduces Electric Flow Sampling (elfs) as a zero-error quantum walk primitive and uses it to derive improved quantum algorithms for various graph problems, including semi-supervised learn…

This paper systematically explores the convex polygon reconstruction problem with specified sets of features, contributing new testing algorithms and hardness results.

This paper analyzes direction-of-arrival estimation using a tunable receive-side lossless reciprocal MiLAC combiner for antenna arrays and shows it can achieve the digital Cramér-Rao bound with fewer…

The paper introduces BOUNDARY FLOW, an LLVM-based framework that enhances kernel fuzzing and analysis by extracting per-task, state-aware data-flow information (arguments and return values) at functio…