:: Library Catalog

Image de couverture de livre

Enregistré dans:

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

Documents similaires

Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
par: Amir, Amihood, et autres
Publié: (2024)

Asymptotically Optimal Representation of Palindromic Structure
par: Itzhaki, Michael
Publié: (2024)

On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
par: Amir, Amihood, et autres
Publié: (2026)

Maximal Palindromes in MPC: Simple and Optimal
par: Pissis, Solon P.
Publié: (2025)

Online Computation of Palindromes and Suffix Trees on Tries
par: Shibata, Hiroki, et autres
Publié: (2026)

Small Space Encoding and Recognition of $k$-Palindromic Prefixes
par: Bathie, Gabriel, et autres
Publié: (2024)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
par: Bathie, Gabriel, et autres
Publié: (2023)

Lawler-Moore Speedups via Additive Combinatorics
par: Bringmann, Karl, et autres
Publié: (2026)

Double-Ended Palindromic Trees in Linear Time
par: Wang, Qisheng, et autres
Publié: (2022)

Quantum Property Testing Algorithm for the Concatenation of Two Palindromes Language
par: Khadiev, Kamil, et autres
Publié: (2024)

Fair Repetitive Interval Scheduling
par: Heeger, Klaus, et autres
Publié: (2024)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Near-Optimal Fault Tolerance for Efficient Batch Matrix Multiplication via an Additive Combinatorics Lens
par: Censor-Hillel, Keren, et autres
Publié: (2023)

Self-referential instances of the dominating set problem are irreducible
par: Zhou, Guangyan
Publié: (2026)

Spanning and Metric Tree Covers Parameterized by Treewidth
par: Elkin, Michael, et autres
Publié: (2025)

Controlling tail risk in two-slope ski rental
par: Cui, Qiming, et autres
Publié: (2025)

Singing a MIS
par: Irani, Sandy, et autres
Publié: (2025)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Time, Message and Memory-Optimal Distributed Minimum Spanning Tree and Partwise Aggregation
par: Goldenfeld, Michael Elkin Tanya
Publié: (2026)

Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n loglog n)
par: Elkin, Michael, et autres
Publié: (2023)

Almost Linear Size Edit Distance Sketch
par: Koucký, Michal, et autres
Publié: (2024)

Tree Search With Predictions
par: Dinitz, Michael, et autres
Publié: (2026)

Deterministic Simple $(Δ+\varepsilonα)$-Edge-Coloring in Near-Linear Time
par: Elkin, Michael, et autres
Publié: (2024)

Faster optimal univariate microgaggregation
par: Stamm, Felix I., et autres
Publié: (2024)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
par: Neuwohner, Meike, et autres
Publié: (2025)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
par: Elberfeld, Michael, et autres
Publié: (2025)

Approximating optimization problems in graphs with locational uncertainty
par: Bougeret, Marin, et autres
Publié: (2022)

On the adversarial robustness of Locality-Sensitive Hashing in Hamming space
par: Kapralov, Michael, et autres
Publié: (2024)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
par: Gila, Ofek, et autres
Publié: (2026)

Approximating Prize-Collecting Variants of TSP
par: Alimi, Morteza, et autres
Publié: (2024)

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
par: Charikar, Moses, et autres
Publié: (2024)

GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
par: Jananthan, Hayden, et autres
Publié: (2025)

Nearly Optimal List Labeling
par: Bender, Michael A., et autres
Publié: (2024)

Optimal Non-Oblivious Open Addressing
par: Bender, Michael A., et autres
Publié: (2025)

Learning-Augmented Online Algorithms for Nonclairvoyant Joint Replenishment Problem with Deadlines
par: Dinitz, Michael, et autres
Publié: (2025)

Spectral Clustering in Birthday Paradox Time
par: Kapralov, Michael, et autres
Publié: (2026)

Tight Bounds for Classical Open Addressing
par: Bender, Michael A., et autres
Publié: (2024)

Recovering Communities in Structured Random Graphs
par: Kapralov, Michael, et autres
Publié: (2026)