Image de couverture de livre

Compressed Game Solving

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Considine, Jeffrey
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An Objective Improvement Approach to Solving Discounted Payoff Games
par: Dell'Erba, Daniele, et autres
Publié: (2024)

Compressed Index with Construction in Compressed Space
par: Kosolobov, Dmitry
Publié: (2026)

LZ78 Substring Compression in Compressed Space
par: Shibata, Hiroki, et autres
Publié: (2025)

Entrywise Approximate Laplacian Solving
par: Chen, Jingbang, et autres
Publié: (2024)

On Solving Linear Systems in Sublinear Time
par: Andoni, Alexandr, et autres
Publié: (2018)

Solving Linear Programs with Differential Privacy
par: Ene, Alina, et autres
Publié: (2025)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
par: Kempa, Dominik, et autres
Publié: (2023)

Solving Positive Linear Programs with Differential Privacy
par: Ene, Alina, et autres
Publié: (2026)

Solving the Correlation Cluster LP in Sublinear Time
par: Cao, Nairen, et autres
Publié: (2025)

Sketching and Streaming for Dictionary Compression
par: Becker, Ruben, et autres
Publié: (2023)

String Indexing with Compressed Patterns
par: Bille, Philip, et autres
Publié: (2019)

Solving Hypergraph Laplacian Systems in Almost-Linear Time
par: Yoshida, Yuichi
Publié: (2026)

Tolerant Testing for Unique Games
par: Yoshida, Yuichi
Publié: (2026)

Compressing Hypergraphs using Suffix Sorting
par: Adler, Enno, et autres
Publié: (2025)

Word Break on SLP-Compressed Texts
par: De, Rajat, et autres
Publié: (2025)

Revisiting the Sparse Matrix Compression Problem
par: Jugé, Vincent, et autres
Publié: (2026)

Compressing Suffix Trees by Path Decompositions
par: Becker, Ruben, et autres
Publié: (2025)

DNA Probe Computing System for Solving NP-Complete Problems
par: Xu, Jin, et autres
Publié: (2025)

On Differential Privacy for Adaptively Solving Search Problems via Sketching
par: Feng, Shiyuan, et autres
Publié: (2025)

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
par: Kwok, Tsz Chiu, et autres
Publié: (2025)

Substring Compression Variations and LZ78-Derivates
par: Köppl, Dominik
Publié: (2024)

Dynamic Suffix Array in Optimal Compressed Space
par: Nishimoto, Takaaki, et autres
Publié: (2024)

LZD-style Compression Scheme with Truncation and Repetitions
par: Götz, Linus, et autres
Publié: (2025)

Compressed Set Representations based on Set Difference
par: Gagie, Travis, et autres
Publié: (2026)

Fast Practical Compression of Deterministic Finite Automata
par: Bille, Philip, et autres
Publié: (2023)

Solving Random Planted CSPs below the $n^{k/2}$ Threshold
par: Basu, Arpon, et autres
Publié: (2025)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
par: Cleary, Alan M., et autres
Publié: (2024)

Compressed Dictionary Matching on Run-Length Encoded Strings
par: Bille, Philip, et autres
Publié: (2025)

Optimal-Time Mapping in Run-Length Compressed PBWT
par: Bonizzoni, Paola, et autres
Publié: (2026)

A Dynamic Working Set Method for Compressed Sensing
par: Cheng, Siu-Wing, et autres
Publié: (2025)

Output-Sparse Matrix Multiplication Using Compressed Sensing
par: Bennett, Huck, et autres
Publié: (2025)

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
par: Domingues, Gabriel Marques
Publié: (2026)

Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
par: Cleary, Alan M., et autres
Publié: (2024)

Tight Lower Bounds for Central String Queries in Compressed Space
par: Kempa, Dominik, et autres
Publié: (2025)

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
par: Ferragina, Paolo, et autres
Publié: (2025)

QuaRs: A Transform for Better Lossless Compression of Integers
par: Matt, Jonas G.
Publié: (2025)

Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
par: Nishimoto, Takaaki, et autres
Publié: (2026)

Solving Co-Path/Cycle Packing and Co-Path Packing Faster Than $3^k$
par: Liu, Yuxi, et autres
Publié: (2024)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
par: Tayal, Mumuksh
Publié: (2025)