:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kuszmaul, William, Qi, Qi
Format:	Preprint
Published:	2021
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2102.05077
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
by: Kuszmaul, William
Published: (2025)

Scheduling Jobs with Work-Inefficient Parallel Solutions
by: Kuszmaul, William, et al.
Published: (2024)

Tight Analyses of Ordered and Unordered Linear Probing
by: Braverman, Mark, et al.
Published: (2025)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
by: Kuszmaul, William, et al.
Published: (2025)

Fingerprint Filters Are Optimal
by: Kuszmaul, William, et al.
Published: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
by: Kuszmaul, William, et al.
Published: (2025)

Optimal Non-Oblivious Open Addressing
by: Bender, Michael A., et al.
Published: (2025)

Tight Bounds for Classical Open Addressing
by: Bender, Michael A., et al.
Published: (2024)

Optimal Bounds for Open Addressing Without Reordering
by: Farach-Colton, Martin, et al.
Published: (2025)

A Nearly Quadratic Improvement for Memory Reallocation
by: Farach-Colton, Martin, et al.
Published: (2024)

History-Independent Load Balancing
by: Bender, Michael A., et al.
Published: (2026)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
by: Kuszmaul, William, et al.
Published: (2024)

Layered List Labeling
by: Bender, Michael A., et al.
Published: (2024)

Static Retrieval Revisited: To Optimality and Beyond
by: Hu, Yang, et al.
Published: (2025)

Preprocessed 3SUM for Unknown Universes with Subquadratic Space
by: Kirkpatrick, Yael, et al.
Published: (2026)

Nearly Optimal List Labeling
by: Bender, Michael A., et al.
Published: (2024)

Strengths and Limitations of Greedy in Cup Games
by: Jasińska, Kalina, et al.
Published: (2026)

Finding 4-Additive Spanners: Faster, Stronger, and Simpler
by: Qi, Chuhan
Published: (2025)

Lookback Prophet Inequalities
by: Benomar, Ziyad, et al.
Published: (2024)

Combinatorial Philosopher Inequalities
by: Sun, Enze, et al.
Published: (2025)

Prophet Inequalities over Time
by: Abels, Andreas, et al.
Published: (2022)

Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
by: Gawrychowski, Paweł, et al.
Published: (2024)

Sample-Based Matroid Prophet Inequalities
by: Fu, Hu, et al.
Published: (2024)

An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
by: Koo, Jaehyun
Published: (2024)

The Bichromatic Two-Center Problem on Graphs
by: Sun, Qi, et al.
Published: (2025)

New Prophet Inequalities via Poissonization and Sharding
by: Harb, Elfarouk
Published: (2023)

Anytime Sorting Algorithms (Extended Version)
by: Caizergues, Emma, et al.
Published: (2024)

A Bicriterion Concentration Inequality and Prophet Inequalities for $k$-Fold Matroid Unions
by: Alon, Noga, et al.
Published: (2024)

Separating $k$-Median from the Supplier Version
by: Anand, Aditya, et al.
Published: (2024)

Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven
by: Ben-Basat, Ran, et al.
Published: (2026)

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
by: Braverman, Mark, et al.
Published: (2024)

Threshold Rules for the Classical Prophet Inequality
by: Zhang, Jiechen
Published: (2026)

Pairwise-Independent Contention Resolution
by: Gupta, Anupam, et al.
Published: (2024)

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
by: Jain, Sanjay, et al.
Published: (2026)

Deep Learning Service for Efficient Data Distribution Aware Sorting
by: Zhu, Xiaoke, et al.
Published: (2019)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
by: Jin, Ce, et al.
Published: (2024)

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
by: Kulik, Ariel, et al.
Published: (2019)

Matrix Multiplication Reductions
by: Gola, Ashish, et al.
Published: (2024)

New Diameter Approximations via Distance Oracle Techniques
by: Kirkpatrick, Yael, et al.
Published: (2026)

Optimal Protocols for 2-Party Contention Resolution
by: Wang, Dingyu
Published: (2024)