Imagen de Portada

3SUM in Preprocessed Universes: Faster and Simpler

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kasliwal, Shashwat, Polak, Adam, Sharma, Pratyush
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Data Structures Meet Cryptography: 3SUM with Preprocessing
por: Golovnev, Alexander, et al.
Publicado: (2019)

Simpler and Faster Directed Low-Diameter Decompositions
por: Li, Jason
Publicado: (2025)

Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
por: Bringmann, Karl, et al.
Publicado: (2024)

Faster and Simpler Online Computation of String Net Frequency
por: Inenaga, Shunsuke
Publicado: (2024)

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

Node-Weighted Triangles: Faster and Simpler
por: Akmal, Shyan, et al.
Publicado: (2026)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
por: Nogler, Jakob, et al.
Publicado: (2024)

Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means
por: la Tour, Max Dupré, et al.
Publicado: (2024)

Sumsets, 3SUM, Subset Sum: Now for Real!
por: Fischer, Nick
Publicado: (2024)

Improved Time-Space Tradeoffs for 3SUM-Indexing
por: Dinur, Itai, et al.
Publicado: (2025)

New Applications of 3SUM-Counting in Fine-Grained Complexity and Pattern Matching
por: Fischer, Nick, et al.
Publicado: (2024)

Simpler and Improved Replacement Path Coverings
por: Bilò, Davide, et al.
Publicado: (2026)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
por: Balmaseda, Vicente, et al.
Publicado: (2024)

Simpler O(1) Query Algorithm for Level Ancestors
por: Saxena, Sanjeev
Publicado: (2022)

Non-Boolean OMv: One More Reason to Believe Lower Bounds for Dynamic Problems
por: Hu, Bingbing, et al.
Publicado: (2024)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

A Simpler Analysis for $\varepsilon$-Clairvoyant Flow Time Scheduling
por: Gupta, Anupam, et al.
Publicado: (2026)

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
por: Sharma, Vidya Sagar
Publicado: (2023)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
por: Beines, Arne, et al.
Publicado: (2024)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

k-SUM Hardness Implies Treewidth-SETH
por: Lampis, Michael
Publicado: (2025)

Faster two-dimensional pattern matching with $k$ mismatches
por: Ellert, Jonas, et al.
Publicado: (2024)

Faster ED-String Matching with $k$ Mismatches
por: Gawrychowski, Paweł, et al.
Publicado: (2025)

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
por: Parter, Merav, et al.
Publicado: (2024)

Preprocessing to Reduce the Search Space for Odd Cycle Transversal
por: Jansen, Bart M. P., et al.
Publicado: (2024)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
por: Gawrychowski, Pawel, et al.
Publicado: (2024)

Connectivity Oracles for Predictable Vertex Failures
por: Hu, Bingbing, et al.
Publicado: (2023)

Faster parameterized algorithm for 3-Hitting Set
por: Tsur, Dekel
Publicado: (2025)

Fast $k$-means Seeding Under The Manifold Hypothesis
por: Shah, Poojan, et al.
Publicado: (2026)

Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set
por: Donkers, Huib, et al.
Publicado: (2021)

Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps
por: Rutschmann, Daniel
Publicado: (2026)

Faster optimal univariate microgaggregation
por: Stamm, Felix I., et al.
Publicado: (2024)

Faster Algorithms for Graph Monopolarity
por: Philip, Geevarghese, et al.
Publicado: (2024)

Simple and Faster Algorithms for Knapsack
por: He, Qizheng, et al.
Publicado: (2023)

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

Approximation Algorithms for Combinatorial Optimization with Predictions
por: Antoniadis, Antonios, et al.
Publicado: (2024)

Improved Online Algorithms for Inventory Management Problems with Holding and Delay Costs: Riding the Wave Makes Things Simpler, Stronger, & More General
por: Shmoys, David, et al.
Publicado: (2026)

Faster Combinatorial k-Clique Algorithms
por: Abboud, Amir, et al.
Publicado: (2024)