Counting permutation patterns with multidimensional trees

DOI10.4230/LIPICS.ICALP.2025.24MaRDI QIDQ7346455zbMATH OpenFDO

Authors Nir Lavee

Publication date 10 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.24

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A combinatorial problem in geometry.
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Combinatory analysis. Vol. 1
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Faster matrix multiplication via asymmetric hashing
• Finding and counting permutations via CSPs
• Finding even cycles faster via capped k-walks
• Finding four-node subgraphs in triangle time
• Finding small patterns in permutations in linear time
• How balanced can permutations be?
• scientific article; zbMATH DE number 3492580 (Why is no real title available?)
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 2081004 (Why is no real title available?)
• Linear space data structures for two types of range search
• On Complexity of the Subpattern Problem
• Pattern matching for permutations
• Patterns in random permutations
• Restricted permutations
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• Tree clustering for constraint networks

This page was built for publication: Counting permutation patterns with multidimensional trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346455)