scientific article; zbMATH DE number 7765381
From MaRDI portal
DOI10.4230/lipics.isaac.2020.23arXiv2010.00348MaRDI QIDQ6065422
Unnamed Author, Paweł Gawrychowski
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2010.00348
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding pattern matchings for permutations
- Pattern matching for permutations
- A fast algorithm for permutation pattern matching based on alternating runs
- Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Patterns in permutations and words.
- Finding and counting given length cycles
- Efficient computation of the Bergsma-Dassios sign covariance
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Consecutive patterns in permutations
- Generalized permutation patterns and a classification of the Mahonian statistics
- Avoidance of boxed mesh patterns on permutations
- Parallel algorithms for separable permutations
- Cycles of even length in graphs
- A consistent test of independence based on a sign covariance related to Kendall's tau
- On measures of association and a related problem
- Combinatorics of Permutations
- The computational landscape of permutation patterns
- Permutation classes
- Powers of tensors and fast matrix multiplication
- On Complexity of the Subpattern Problem
- Pattern Matching for 321-Avoiding Permutations
- Finding Even Cycles Even Faster
- The Complexity of Pattern Matching for $321$-Avoiding and Skew-Merged Permutations
- Symmetric rank covariances: a generalized framework for nonparametric measures of dependence
- Hardness of Permutation Pattern Matching
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Finding even cycles faster via capped k-walks
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- Equivalences between triangle and range query problems
- Computing quartet distance is equivalent to counting 4-cycles
- Finding Four-Node Subgraphs in Triangle Time
- Finding small patterns in permutations in linear time
- Multiplying matrices faster than coppersmith-winograd
- Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
- A NEW MEASURE OF RANK CORRELATION
- A Non-Parametric Test of Independence
- Finding and Counting Permutations via CSPs
- Restricted permutations
