:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Abboud, Amir, Kumar, Rajendra
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2501.03688
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Maximum Distance Sublattice Problem and Closest Vector Problem
by: Kumar, Rajendra, et al.
Published: (2018)

Faster Algorithms for Average-Case Orthogonal Vectors and Closest Pair Problems
by: Alman, Josh, et al.
Published: (2024)

Worst-Case to Expander-Case Reductions: Derandomized and Generalized
by: Abboud, Amir, et al.
Published: (2024)

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

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
by: Aggarwal, Divesh, et al.
Published: (2020)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
by: Abboud, Amir, et al.
Published: (2025)

Triangle Detection in H-Free Graphs
by: Abboud, Amir, et al.
Published: (2025)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
by: Abboud, Amir, et al.
Published: (2023)

All-Pairs Shortest Paths with Few Weights per Node
by: Abboud, Amir, et al.
Published: (2025)

Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs
by: Abboud, Amir, et al.
Published: (2026)

From Donkeys to Kings in Tournaments
by: Abboud, Amir, et al.
Published: (2024)

Algorithms for Computing Closest Points for Segments
by: Wang, Haitao
Published: (2024)

Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)

Beating Bellman's Algorithm for Subset Sum
by: Bringmann, Karl, et al.
Published: (2024)

Deterministic Almost-Linear-Time Gomory-Hu Trees
by: Abboud, Amir, et al.
Published: (2025)

Recognizing Sumsets is NP-Complete
by: Abboud, Amir, et al.
Published: (2024)

Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair
by: Beretta, Lorenzo, et al.
Published: (2025)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
by: Banihashem, Kiarash, et al.
Published: (2025)

Online Makespan Minimization: Beat LPT by Dynamic Locking
by: Wang, Zhaozi, et al.
Published: (2023)

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection
by: Doron-Arad, Ilan, et al.
Published: (2024)

Exact (n + 2) Comparison Complexity for the N-Repeated Element Problem
by: Au, Andrew
Published: (2026)

Equitable Connected Partition and Structural Parameters Revisited: N-fold Beats Lenstra
by: Blažej, Václav, et al.
Published: (2024)

Stochastic Matching via In-n-Out Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2024)

The $\ell_p$-Subspace Sketch Problem in Small Dimensions with Applications to Support Vector Machines
by: Li, Yi, et al.
Published: (2022)

Online Stochastic Matching with Unknown Arrival Order: Beating $0.5$ against the Online Optimum
by: Sun, Enze, et al.
Published: (2025)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
by: Bessa, Aline, et al.
Published: (2023)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
by: Choudhary, Keerti, et al.
Published: (2025)

Optimising Cylindrical Algebraic Coverings for use in SMT by Solving a Set Covering Problem with Reasons
by: Babatunde, Abiola, et al.
Published: (2026)

The Contiguous Art Gallery Problem is in Θ(n log n)
by: de Berg, Sarita, et al.
Published: (2025)

The Planted Orthogonal Vectors Problem
by: Kühnemann, David, et al.
Published: (2025)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
by: Kumar, Rinku, et al.
Published: (2025)

On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
by: Gao, Yiming, et al.
Published: (2025)

Quantization for Vector Search under Streaming Updates
by: Aden-Ali, Ishaq, et al.
Published: (2025)

Hardness of Approximation for Shortest Path with Vector Costs
by: Carlson, Charlie, et al.
Published: (2025)

Catalytic Tree Evaluation From Matching Vectors
by: Henzinger, Alexandra, et al.
Published: (2026)

Sum Estimation via Vector Similarity Search
by: Mussmann, Stephen, et al.
Published: (2026)

3/2-Approximation for the Forest Augmentation Problem
by: Çivril, Ali
Published: (2024)

Faster algorithms for k-Orthogonal Vectors in low dimension
by: Dürr, Anita, et al.
Published: (2025)

Fully Dynamic Connectivity in $O(\log n(\log\log n)^2)$ Amortized Expected Time
by: Huang, Shang-En, et al.
Published: (2016)