Image de couverture de livre

Preprocessed 3SUM for Unknown Universes with Subquadratic Space

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kirkpatrick, Yael, Kuszmaul, John, Mathialagan, Surya, Williams, Virginia Vassilevska
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Note on the Conditional Optimality of Chiba and Nishizeki's Algorithms
par: Kirkpatrick, Yael, et autres
Publié: (2024)

Shortest Paths in Multimode Graphs
par: Kirkpatrick, Yael, et autres
Publié: (2025)

Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
par: Dalirrooyfard, Mina, et autres
Publié: (2023)

New Diameter Approximations via Distance Oracle Techniques
par: Kirkpatrick, Yael, et autres
Publié: (2026)

Improved Additive Approximation Algorithms for APSP
par: Jin, Ce, et autres
Publié: (2025)

Beyond 2-approximation for k-Center in Graphs
par: Jin, Ce, et autres
Publié: (2025)

3SUM in Preprocessed Universes: Faster and Simpler
par: Kasliwal, Shashwat, et autres
Publié: (2024)

Undirected Replacement Paths: Dual Fault Reduces to Single Source
par: Nogler, Jakob, et autres
Publié: (2026)

Listing 6-Cycles in Sparse Graphs
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Data Structures Meet Cryptography: 3SUM with Preprocessing
par: Golovnev, Alexander, et autres
Publié: (2019)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate $k$-clique counts faster
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Fast Approximate Counting of Cycles
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Computing Flows in Subquadratic Space
par: Brand, Jan van den, et autres
Publié: (2026)

A Refined Laser Method and Faster Matrix Multiplication
par: Alman, Josh, et autres
Publié: (2020)

All-Hops Shortest Paths
par: Williams, Virginia Vassilevska, et autres
Publié: (2024)

Improved Time-Space Tradeoffs for 3SUM-Indexing
par: Dinur, Itai, et autres
Publié: (2025)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2024)

Approximate Distance Sensitivity Oracles in Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2023)

Faster Algorithms for Text-to-Pattern Hamming Distances
par: Chan, Timothy M., et autres
Publié: (2023)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Improved girth approximation in weighted undirected graphs
par: Kadria, Avi, et autres
Publié: (2025)

Additive Spanner Lower Bounds with Optimal Inner Graph Structure
par: Bodwin, Greg, et autres
Publié: (2024)

All-Pairs Shortest Paths with Few Weights per Node
par: Abboud, Amir, et autres
Publié: (2025)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
par: Bille, Philip, et autres
Publié: (2022)

A Simple and Combinatorial Approach to Proving Chernoff Bounds and Their Generalizations
par: Kuszmaul, William
Publié: (2025)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
par: Nogler, Jakob, et autres
Publié: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
par: Kuszmaul, William, et autres
Publié: (2024)

The Multiplicative Version of Azuma's Inequality, with an Application to Contention Analysis
par: Kuszmaul, William, et autres
Publié: (2021)

Tight Analyses of Ordered and Unordered Linear Probing
par: Braverman, Mark, et autres
Publié: (2025)

Sumsets, 3SUM, Subset Sum: Now for Real!
par: Fischer, Nick
Publié: (2024)

Weakly Approximating Knapsack in Subquadratic Time
par: Chen, Lin, et autres
Publié: (2025)

A Subquadratic Bound for Online Bisection
par: Bienkowski, Marcin, et autres
Publié: (2023)

Approximately Counting Knapsack Solutions in Subquadratic Time
par: Feng, Weiming, et autres
Publié: (2024)

Streaming Edge Coloring with Subquadratic Palette Size
par: Chechik, Shiri, et autres
Publié: (2023)

Faster Cycle Detection in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal
par: Jansen, Bart M. P., et autres
Publié: (2024)

Efficient $d$-ary Cuckoo Hashing at High Load Factors by Bubbling Up
par: Kuszmaul, William, et autres
Publié: (2025)

Subquadratic Submodular Maximization with a General Matroid Constraint
par: Kobayashi, Yusuke, et autres
Publié: (2024)

Fingerprint Filters Are Optimal
par: Kuszmaul, William, et autres
Publié: (2025)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
par: Kuszmaul, William, et autres
Publié: (2025)