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.

This paper analyzes data-access cost in a memory hierarchy and shows it scales with the fourth root of data size, predicting scalability.

This paper proposes Stringology-Based Cryptology (SBC), a novel approach that analyzes the structural properties of cryptographic outputs by treating them as symbolic sequences, offering complementary…

This paper introduces a new way to represent finite posets as subwords of finite words in categories, and characterizes the monic categories that admit this representation.

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

This paper introduces DiStash, a disaggregated transactional key-value store that enables an application to use a single transaction to manage key-value pairs across different pools of stashes, preven…

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.

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

The paper studies properties of parity based bit-counting complexity classes B|0|⊕P and B|1|⊕P, proves inclusions and closures, and shows they contain PH and are contained in CH.

This paper proposes a splay-like rotation design for concurrent binary search trees to preserve the main benefit of splaying on skewed workloads while reducing contention near the root.

This paper provides the first unified, security-focused survey that rigorously maps Layer-2 (L2) blockchain architecture to its underlying cryptographic security assumptions.

This paper presents a new nondeterministic finite automaton (NFA) for recognizing repetition-free words over a given alphabet, improving on the previous construction.

The paper introduces Heimdall, an automated pipeline that uses LLMs and formal verification to safely and automatically migrate legacy, potentially buggy eBPF programs written in C to memory-safe Rust…

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

This paper introduces a new lock-free multi-word compare-and-swap algorithm with a contention-aware helping mechanism and version embedding approach to improve efficiency and consistency, achieving up…

The paper introduces PoSME, a cryptographic primitive that enforces strict sequential memory execution by chaining data-dependent writes, providing verifiable delay and authorship attestation.

The paper establishes bijections between tree records, girth of connected endofunctions, and genesis sequences, deriving generating functions for tree and forest record numbers using Cayley's tree fun…