:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteur principal:	Garraoui, Omar
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 68W32 68P10
Accès en ligne:	https://arxiv.org/abs/2601.03271
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

String 2-Covers with No Length Restrictions
par: Boneh, Itai, et autres
Publié: (2024)

Maximizing Diversity in (near-)Median String Selection
par: Chakraborty, Diptarka, et autres
Publié: (2026)

Computing Maximal Repeating Subsequences in a String
par: Gong, Mingyang, et autres
Publié: (2026)

Naively Sorting Evolving Data is Optimal and Robust
par: Giakkoupis, George, et autres
Publié: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
par: Crochemore, Maxime, et autres
Publié: (2025)

Hairpin Completion Distance Lower Bound
par: Boneh, Itai, et autres
Publié: (2024)

Optimal Online Bipartite Matching in Degree-2 Graphs
par: Bhangale, Amey, et autres
Publié: (2025)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
par: Alpay, Faruk, et autres
Publié: (2026)

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

Checking and producing word attractors
par: Béal, Marie-Pierre, et autres
Publié: (2025)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

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

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

Near-Optimal Relative Error Streaming Quantile Estimation via Elastic Compactors
par: Gribelyuk, Elena, et autres
Publié: (2024)

Almost and Approximate EFX for Few Types of Agents
par: HV, Vishwa Prakash, et autres
Publié: (2025)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

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

A scalable clustering algorithm to approximate graph cuts
par: Suchan, Leo, et autres
Publié: (2023)

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

On Distributed Colouring of Hyperbolic Random Graphs
par: Maus, Yannic, et autres
Publié: (2025)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

Using Single-Neuron Representations for Hierarchical Concepts as Abstractions of Multi-Neuron Representations
par: Lynch, Nancy
Publié: (2024)

On the Advice Complexity of Online Unit Clustering
par: Nagy-György, Judit
Publié: (2023)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

satsuma: Structure-based Symmetry Breaking in SAT
par: Anders, Markus, et autres
Publié: (2024)

Efficient Processing of Subsequent Densest Subgraph Query
par: Hung, Chia-Yang, et autres
Publié: (2024)

Algorithms Transcending the SAT-Symmetry Interface
par: Anders, Markus, et autres
Publié: (2023)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
par: Alpay, Faruk, et autres
Publié: (2026)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

The Li-Chao Tree: Algorithm Specification and Analysis
par: Li, Chao
Publié: (2026)

Prediction-Augmented Mechanism Design for Weighted Facility Location
par: Shi, Yangguang, et autres
Publié: (2025)

Competitive Data-Structure Dynamization
par: Mathieu, Claire, et autres
Publié: (2020)

Streaming algorithms for groups and semigroups
par: Lohrey, Markus, et autres
Publié: (2022)