:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Garraoui, Omar
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 68W32 68P10
Online Access:	https://arxiv.org/abs/2601.03271
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

String 2-Covers with No Length Restrictions
by: Boneh, Itai, et al.
Published: (2024)

Maximizing Diversity in (near-)Median String Selection
by: Chakraborty, Diptarka, et al.
Published: (2026)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
by: Crochemore, Maxime, et al.
Published: (2025)

Hairpin Completion Distance Lower Bound
by: Boneh, Itai, et al.
Published: (2024)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
by: Alpay, Faruk, et al.
Published: (2026)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
by: Shlyk, Vasiliy S.
Published: (2026)

Checking and producing word attractors
by: Béal, Marie-Pierre, et al.
Published: (2025)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, 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)

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

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
by: Gribelyuk, Elena, et al.
Published: (2024)

Almost and Approximate EFX for Few Types of Agents
by: HV, Vishwa Prakash, et al.
Published: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
by: Gu, Qian-Ping, et al.
Published: (2025)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Huffman-Bucket Sketch: A Simple $O(m)$ Algorithm for Cardinality Estimation
by: Karppa, Matti
Published: (2026)

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

Improved Approximation Algorithms for the Expanding Search Problem
by: Griesbach, Svenja M., et al.
Published: (2023)

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

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
by: Lynch, Nancy
Published: (2024)

On the Advice Complexity of Online Unit Clustering
by: Nagy-György, Judit
Published: (2023)

The Telephone $k$-Multicast Problem
by: Hathcock, Daniel, et al.
Published: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
by: Anders, Markus, et al.
Published: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
by: Hung, Chia-Yang, et al.
Published: (2024)

Algorithms Transcending the SAT-Symmetry Interface
by: Anders, Markus, et al.
Published: (2023)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
by: Bai, Miao, et al.
Published: (2023)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
by: Alpay, Faruk, et al.
Published: (2026)

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

The Li-Chao Tree: Algorithm Specification and Analysis
by: Li, Chao
Published: (2026)

Prediction-Augmented Mechanism Design for Weighted Facility Location
by: Shi, Yangguang, et al.
Published: (2025)

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

Streaming algorithms for groups and semigroups
by: Lohrey, Markus, et al.
Published: (2022)