We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Soittola's theorem characterizes R+- or N-rational formal power series in one variable among the rational formal power series with nonnegative coefficients. We present here a...
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
These are notes for a lecture given at Ohio University on June 3, 2006. An important topic in commutative algebra is the Rees algebra of an ideal in a commutative ring. The Rees al...
The Traverso-Swan theorem says that a reduced ring A is seminormal if and only if the natural homomorphism Pic A Pic A[X] is an isomorphism ([18, 17]). We give here all the detai...