17 citations · 21 across the 7 of their papers we have counts for
7 papers
On level-induced suborders
Laurent Lyaudet
In this article, we characterize orders that are level-induced suborders anytime they are induced suborders of a superorder. We also characterize orders that are consecutive level-…
Erratum to "On Operations and Linear Extensions of Well Partially Ordered Sets"
Laurent Lyaudet
In this article, we give a counter-example to Lemma 12 of the article "On Operations and Linear Extensions of Well Partially Ordered Sets" by Maciej Malicki and Aleksander Rutkowsk…
On finite width questionable representations of orders
Laurent Lyaudet
In this article, we study "questionable representations" of (partial or total) orders, introduced in our previous article "A class of orders with linear? time sorting algorithm". (…
A class of orders with linear? time sorting algorithm
Laurent Lyaudet
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a varian…
Partitions versus sets : a case of duality
Laurent Lyaudet, Frédéric Mazoit, Stephan Thomasse
In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all know…
On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth
Uffe Flarup, Laurent Lyaudet
Some 25 years ago Valiant introduced an algebraic model of computation in order to study the complexity of evaluating families of polynomials. The theory was introduced along with…