Cover Image

Compact representations of pattern-avoiding permutations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kozma, László, Opler, Michal
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimization with pattern-avoiding input
by: Berendsohn, Benjamin Aram, et al.
Published: (2023)

Fast and simple multiplication of bounded twin-width matrices
by: Kozma, László, et al.
Published: (2026)

Inapproximability of Counting Permutation Patterns
by: Opler, Michal
Published: (2026)

An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
by: Opler, Michal
Published: (2024)

Non-adaptive Bellman-Ford: Yen's improvement is optimal
by: Hu, Jialu, et al.
Published: (2024)

Improved space-time tradeoff for TSP via extremal set systems
by: Dallant, Justin, et al.
Published: (2026)

Faster exponential algorithms for cut problems via geometric data structures
by: Kozma, László, et al.
Published: (2025)

Theoretical Analysis of Byte-Pair Encoding
by: Kozma, László, et al.
Published: (2024)

Approximate counting of permutation patterns
by: Ben-Eliezer, Omri, et al.
Published: (2024)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

Pathfinding in Self-Deleting Graphs
by: Dvořák, Michal, et al.
Published: (2025)

Precoloring extension with demands on paths
by: Das, Arun Kumar, et al.
Published: (2025)

Designing Compact ILPs via Fast Witness Verification
by: Włodarczyk, Michał
Published: (2025)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Exact Algorithms for Distance to Unique Vertex Cover
by: Fioravantes, Foivos, et al.
Published: (2025)

Sampling permutations satisfying constraints within the lopsided local lemma regime
by: He, Kun, et al.
Published: (2024)

Local Computation Algorithms for Knapsack: impossibility results, and how to avoid them
by: Canonne, Clément L., et al.
Published: (2025)

An Optimal Randomized Algorithm for Finding the Saddlepoint
by: Dallant, Justin, et al.
Published: (2024)

Compact Parallel Hash Tables on the GPU
by: Hegeman, Steef, et al.
Published: (2024)

Packing Compact Subgraphs with Applications to Districting
by: Chen, Ho-Lin, et al.
Published: (2026)

Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
by: Pilipczuk, Michał, et al.
Published: (2025)

Going Beyond Surfaces in Diameter Approximation
by: Włodarczyk, Michał
Published: (2025)

Algorithms for Efficient, Compact Online Data Stream Curation
by: Moreno, Matthew Andres, et al.
Published: (2024)

Min-Sum Set Cover on Parallel Machines
by: Szyfelbein, Michał
Published: (2026)

Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
by: Wlodarczyk, Michal
Published: (2023)

Losing Treewidth In The Presence Of Weights
by: Włodarczyk, Michał
Published: (2024)

Constant Approximating Disjoint Paths on Acyclic Digraphs is W[1]-hard
by: Włodarczyk, Michał
Published: (2024)

Permutation patterns in streams
by: Berendsohn, Benjamin Aram
Published: (2025)

Almost succinct representation of maximal palindromes
by: Mieno, Takuya, et al.
Published: (2025)

From Incremental Transitive Cover to Strongly Polynomial Maximum Flow
by: Dadush, Daniel, et al.
Published: (2025)

Depth first representations of $k^2$-trees
by: Carmona, Gabriel, et al.
Published: (2025)

Dynamic Detours
by: Dadush, Daniel, et al.
Published: (2026)

Testing Intersectingness of Uniform Families
by: Haviv, Ishay, et al.
Published: (2024)

SquareSort: a cache-oblivious sorting algorithm
by: Koucký, Michal, et al.
Published: (2024)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
by: Sharma, Roohani, et al.
Published: (2026)

Almost Linear Size Edit Distance Sketch
by: Koucký, Michal, et al.
Published: (2024)

INTACT: Compact Storage of Data Streams in Mobile Devices to Unlock User Privacy at the Edge
by: Raes, Rémy, et al.
Published: (2025)

LimTDD: A Compact Decision Diagram Integrating Tensor and Local Invertible Map Representations
by: Hong, Xin, et al.
Published: (2025)

Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, et al.
Published: (2024)