1 citations · 2 across the 15 of their papers we have counts for
5 papers · 1 filter
Fast and simple multiplication of bounded twin-width matrices
László Kozma, Michal Opler
Matrix multiplication is a fundamental task in almost all computational fields, including machine learning and optimization, computer graphics, signal processing, and graph algorit…
Inapproximability of Counting Permutation Patterns
Michal Opler
Detecting and counting copies of permutation patterns are fundamental algorithmic problems, with applications in the analysis of rankings, nonparametric statistics, and property te…
Compact representations of pattern-avoiding permutations
László Kozma, Michal Opler
Pattern-avoiding permutations are a central object of study in both combinatorics and theoretical computer science. In this paper we design a data structure that can store any size…
An Optimal Algorithm for Sorting Pattern-Avoiding Sequences
Michal Opler
We present a deterministic comparison-based algorithm that sorts sequences avoiding a fixed permutation in linear time, even if is a priori unkown. Moreover, the dependence…
Optimization with pattern-avoiding input
Benjamin Aram Berendsohn, László Kozma, Michal Opler
Permutation pattern-avoidance is a central concept of both enumerative and extremal combinatorics. In this paper we study the effect of permutation pattern-avoidance on the complex…