
AllPurpose Hashing
Despite being one of the oldest data structures in computer science, has...
read it

Incremental Edge Orientation in Forests
For any forest G = (V, E) it is possible to orient the edges E so that n...
read it

Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering
First introduced in 1954, linear probing is one of the oldest data struc...
read it

How Asymmetry Helps Buffer Management: Achieving Optimal Tail Size in Cup Games
The cup game on n cups is a multistep game with two players, a filler a...
read it

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
Azuma's inequality is a tool for proving concentration bounds on random ...
read it

Binary Dynamic Time Warping in Linear Time
Dynamic time warping distance (DTW) is a widely used distance measure be...
read it

Train Tracks with Gaps: Applying the Probabilistic Method to Trains
We identify a tradeoff curve between the number of wheels on a train car...
read it

The VariableProcessor Cup Game
The problem of scheduling tasks on p processors so that no task ever get...
read it

Algorithms and Lower Bounds for the WorkerTask Assignment Problem
We study the problem of assigning workers to tasks where each task has d...
read it

InPlace ParallelPartition Algorithms using ExclusiveReadandWrite Memory: An InPlace Algorithm With Provably Optimal Cache Behavior
We present an inplace algorithm for the parallel partition problem that...
read it

Contention Resolution Without Collision Detection
This paper focuses on the contention resolution problem on a shared comm...
read it

Achieving Optimal Backlog in the Vanilla MultiProcessor Cup Game
In each step of the pprocessor cup game on n cups, a filler distributes...
read it

Cilkmem: Algorithms for Analyzing the Memory HighWater Mark of ForkJoin Parallel Programs
Software engineers designing recursive forkjoin programs destined to ru...
read it

Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the LowDistance Regime and Approximate Evaluation
Dynamic time warping distance (DTW) is a widely used distance measure be...
read it

Achieving Optimal Backlog in MultiProcessor Cup Games
The single and multi processor cup games can be used to model natural ...
read it

The OneWay Communication Complexity of Dynamic Time Warping Distance
We resolve the randomized oneway communication complexity of Dynamic Ti...
read it

Efficiently Approximating Edit Distance Between Pseudorandom Strings
We present an algorithm for approximating the edit distance ed(x, y) bet...
read it

On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings
Edit distance is a fundamental measure of distance between strings and h...
read it
William Kuszmaul
is this you? claim profile