In the regular Monday seminar of the G²OAT group, Michal Opler will present a deterministic matching-based algorithm that sorts sequences avoiding a fixed permutation π in linear time, even if π is not known a priori.
In the regular Monday seminar of the G²OAT group, Michal Opler will present a deterministic matching-based algorithm that sorts sequences avoiding a fixed permutation π in linear time, even if π is not known a priori.
The person responsible for the content of this page: Bc. Veronika Dvořáková