The following pages link to William Kuszmaul (Q338582):
Displayed 28 items.
- Signed enumeration of upper-right corners in path shuffles (Q338583) (← links)
- Counting permutations modulo pattern-replacement equivalences for three-letter patterns (Q396920) (← links)
- Train tracks with gaps: applying the probabilistic method to trains (Q2062121) (← links)
- New results on families of pattern-replacement equivalences (Q2182197) (← links)
- Lower central series of a free associative algebra over the integers and finite fields. (Q2376697) (← links)
- Fast algorithms for finding pattern avoiders and counting pattern occurrences in permutations (Q4600719) (← links)
- (Q5002705) (← links)
- (Q5088943) (← links)
- Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation (Q5091239) (← links)
- Contention resolution without collision detection (Q5144901) (← links)
- Flushing Without Cascades (Q5146808) (← links)
- Achieving Optimal Backlog in the Vanilla Multi-Processor Cup Game (Q5146874) (← links)
- Achieving optimal backlog in multi-processor cup games (Q5212854) (← links)
- Efficiently Approximating Edit Distance Between Pseudorandom Strings (Q5236255) (← links)
- The one-way communication complexity of dynamic time warping distance (Q5854561) (← links)
- How asymmetry helps buffer management: achieving optimal tail size in cup games (Q6065249) (← links)
- Incremental Edge Orientation in Forests (Q6075896) (← links)
- On the optimal time/space tradeoff for hash tables (Q6083583) (← links)
- (Q6126243) (← links)
- (Q6147379) (← links)
- (Q6147438) (← links)
- A nearly tight lower bound for the \(d\)-dimensional cow-path problem (Q6161449) (← links)
- Equivalence Classes in $S_n$ for Three Families of Pattern-Replacement Relations (Q6241321) (← links)
- A New Approach to Enumerating Statistics Modulo $n$ (Q6249075) (← links)
- New Results on Doubly Adjacent Pattern-Replacement Equivalences (Q6249078) (← links)
- Train Tracks with Gaps: Applying the Probabilistic Method to Trains (Q6355035) (← links)
- Linear Probing Revisited: Tombstones Mark the Death of Primary Clustering (Q6371861) (← links)
- Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game (Q6398180) (← links)