Publications Improving the Matrix Multiplication Exponent with Modern Optimization and AlphaEvolve Popcorning: Repurposing Write-Optimization Buffers for Faster Queries Dynamic Entropy-Encoded Arrays in O(1) Time with Nearly Optimal Space Fast Concurrent Primitives Despite Contention The Local/Global Disk Problem: How to Use Shared High-Bandwidth Storage Economically Outstanding Paper Award Local Samplers for Product Distributions Workload-Aware Incremental Reclustering in Cloud Data Warehouses Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck Fingerprint Filters Are Optimal Static Retrieval Revisited: To Optimality and Beyond Optimal Static Fully Indexable Dictionaries Optimal Non-Oblivious Open Addressing Optimal Static Dictionary with Worst-Case Constant Query Time More Asymmetry Yields Faster Matrix Multiplication Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval Tight Bounds for Classical Open Addressing Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation New Bounds for Matrix Multiplication: From Alpha to Omega Covered in Quanta Magazine ; Frontiers of Science Award 2025 Dynamic Dictionary with Subconstant Wasted Bits per Key Listing 6-Cycles Dynamic “Succincter” Faster Matrix Multiplication via Asymmetric Hashing Covered in Quanta Magazine ; Frontiers of Science Award 2025 Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries Covered in Quanta Magazine On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching 
