:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Allison, Lloyd
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Programming Languages 68W30 (Primary), 03H15 (Secondary) D.1.1; G.2
Online Access:	https://arxiv.org/abs/2604.17885
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dorst-Smeulders Coding for Arbitrary Binary Words
by: De Luca, Alessandro, et al.
Published: (2025)

The Berlekamp-Massey Algorithm revisited
by: Atti, Nadia Ben, et al.
Published: (2022)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

On the on-line coloring of unit interval graphs with proper interval representation
by: Curbelo, Israel R., et al.
Published: (2024)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
by: Zhong, Xianghui
Published: (2018)

Predicting Memory Demands of BDD Operations using Maximum Graph Cuts (Extended Paper)
by: Sølvsten, Steffan Christ, et al.
Published: (2023)

Beating Posits at Their Own Game: Takum Arithmetic
by: Hunhold, Laslo
Published: (2024)

A weighted angle distance on strings
by: Molnar, Grant
Published: (2026)

Adaptive Approximation Schemes for Matching Queues
by: AmaniHamedani, Alireza, et al.
Published: (2025)

Online Trading as a Secretary Problem Variant
by: Chen, Xujin, et al.
Published: (2026)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

An arithmetic method algorithm optimizing k-nearest neighbors compared to regression algorithms and evaluated on real world data sources
by: Anagnostopoulos, Theodoros, et al.
Published: (2026)

Classification via Two-Way Comparisons
by: Chrobak, Marek, et al.
Published: (2023)

Competitive Data-Structure Dynamization
by: Mathieu, Claire, et al.
Published: (2020)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
by: Feldman, Moran, et al.
Published: (2025)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
by: Coşa, Matei Gabriel, et al.
Published: (2025)

Computability of Initial Value Problems
by: Brattka, Vasco, et al.
Published: (2024)

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
by: Bilardi, Gianfranco, et al.
Published: (2022)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

A scalable clustering algorithm to approximate graph cuts
by: Suchan, Leo, et al.
Published: (2023)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
by: Koiran, Pascal, et al.
Published: (2024)

An improved approximation algorithm for k-Median
by: Young, Neal E.
Published: (2025)

Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

Convergence of the QuickVal Residual
by: Fill, James Allen, et al.
Published: (2024)

On Distributed Colouring of Hyperbolic Random Graphs
by: Maus, Yannic, et al.
Published: (2025)

Algorithms for Generating Small Random Samples
by: Cicirello, Vincent A.
Published: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)