The following pages link to William Kuszmaul (Q338582):
Displaying 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)
- Incremental Edge Orientation in Forests (Q6075896) (← links)
- (Q6126243) (← links)
- A nearly tight lower bound for the \(d\)-dimensional cow-path problem (Q6161449) (← links)
- Train tracks with gaps (Q6487591) (← links)
- Tight bounds for monotone minimal perfect hashing (Q6538548) (← links)
- Tiny pointers (Q6538549) (← links)
- Floors and ceilings in divide-and-conquer recurrences (Q6538753) (← links)
- Modern hashing made simple (Q6545134) (← links)
- Memoryless worker-task assignment with polylogarithmic switching cost (Q6560803) (← links)
- Optimal time-backlog tradeoffs for the variable-processor cup game (Q6560883) (← links)
- Optimal Bounds for Open Addressing Without Reordering (Q6760974) (← links)
- Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up (Q6760977) (← links)
- A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations (Q6761268) (← links)
