:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Popov, Andrey A.
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Computation
Online Access:	https://arxiv.org/abs/2604.01356
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum divide and conquer
by: Childs, Andrew M., et al.
Published: (2022)

On the quantum time complexity of divide and conquer
by: Allcock, Jonathan, et al.
Published: (2023)

ZOR filters: fast and smaller than fuse filters
by: Limasset, Antoine
Published: (2026)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
by: Bhore, Sujoy, et al.
Published: (2024)

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
by: Prokopenko, Andrey, et al.
Published: (2024)

Algorithmic strategies for finding the best TSP 2-OPT move in average sub-quadratic time
by: Lancia, Giuseppe, et al.
Published: (2024)

A more efficient algorithm to compute the Rand Index for change-point problems
by: Prates, Lucas de Oliveira
Published: (2021)

A Simple Proof that Ricochet Robots is PSPACE-Complete
by: Balanza-Martinez, Jose, et al.
Published: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
by: Bai, Tian, et al.
Published: (2026)

Faster Hamiltonian Monte Carlo by Learning Leapfrog Scale: a self-calibrated randomized solution
by: Wu, Changye, et al.
Published: (2018)

Fast Matrix Multiplication via Ternary Meta Flip Graphs
by: Perminov, A. I.
Published: (2025)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
by: Tate, Elise, et al.
Published: (2025)

Learning Functions of Halfspaces
by: Alman, Josh, et al.
Published: (2026)

Search-space Reduction for Boolean MinCSPs via Essential Constraints
by: Jansen, Bart M. P., et al.
Published: (2026)

DNF formulas are efficiently testable with relative error
by: Chen, Xi, et al.
Published: (2026)

Detecting Low-Degree Truncation
by: De, Anindya, et al.
Published: (2024)

A Deterministic Partition Tree and Applications
by: Wang, Haitao
Published: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
by: Laekhanukit, Bundit, et al.
Published: (2026)

Testing noisy low-degree polynomials for sparsity
by: Bao, Yiqiao, et al.
Published: (2025)

From Chinese Postman to Salesman and Beyond I: Approximating Shortest Tours $δ$-Covering All Points on All Edges
by: Frei, Fabian, et al.
Published: (2024)

From Chinese Postman to Salesman and Beyond II: Inapproximability and Parameterized Complexity
by: Frei, Fabian, et al.
Published: (2025)

Lower Bounds for Convexity Testing
by: Chen, Xi, et al.
Published: (2024)

A Dichotomy Theorem for Multi-Pass Streaming CSPs
by: Fei, Yumou, et al.
Published: (2025)

A Space-space Trade-off for Directed st-Connectivity
by: Edenhofer, Roman
Published: (2026)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
by: de Berg, Sarita, et al.
Published: (2026)

Flashback: A Reversible Bilateral Run-Peeling Decomposition of Strings
by: Konstantinovsky, Thomas, et al.
Published: (2026)

Tight Parameterized (In)tractability of Layered Crossing Minimization: Subexponential Algorithms and Kernelization
by: Fomin, Fedor V., et al.
Published: (2025)

Parameterized Geometric Graph Modification with Disk Scaling
by: Fomin, Fedor V., et al.
Published: (2024)

Hybrid k-Clustering: Blending k-Median and k-Center
by: Fomin, Fedor V., et al.
Published: (2024)

A Faster Randomized Algorithm for Vertex Cover: An Automated Approach
by: Clinch, Katie, et al.
Published: (2025)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
by: Lehner, Lisa, et al.
Published: (2025)

Sublinear-query relative-error testing of halfspaces
by: Chen, Xi, et al.
Published: (2026)

Sliding Cubes in Parallel
by: Akitaya, Hugo A., et al.
Published: (2026)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
by: Ducoffe, Guillaume
Published: (2026)

A data structure for monomial ideals with applications to signature Gröbner bases
by: Lairez, Pierre, et al.
Published: (2026)

A Unified Approach to Memory-Sample Tradeoffs for Detecting Planted Structures
by: Garg, Sumegha, et al.
Published: (2026)

Algorithms and Hardness for Estimating Statistical Similarity
by: Bhattacharyya, Arnab, et al.
Published: (2025)

Computational Explorations of Total Variation Distance
by: Bhattacharyya, Arnab, et al.
Published: (2024)

Halfspaces are hard to test with relative error
by: Chen, Xi, et al.
Published: (2025)