-
Cube polynomial of Fibonacci and Lucas cube
The cube polynomial of a graph is the counting polynomial for the number of induced $k$-dimensional hypercubes ($k\ge 0$). We determine the cube polynomial of... -
WIENER INDEX AND HOSOYA POLYNOMIAL OF FIBONACCI AND LUCAS CUBES
In the language of mathematical chemistry, Fibonacci cubes can be defined as the resonance graphs of fibonacenes. Lucas cubes form a symmetrization of Fibonacci cubes... -
Walks and animals: applications of the theory of heaps of pieces
The goal of this thesis is to establish enumerative results on several classes of paths and animals. These results are applications of the theory of heaps of pieces... -
Stationary Solution to the Fluid Queue Fed by an M/M/1 Queue
We consider an infinite capacity buffer receiving fluid at a rate depending on the state of an M/M/1 queue. We obtain a new analytic expression for the joint... -
Attribute grammars and automatic complexity analysis
Decomposable combinatorial structures have been well studied and a systematic manner for determining generating function equations is well known. Attribute grammars... -
Analysis of Mobile Ad-hoc Network Routing Protocols in Random Graph Models
We analyze the performance of ad-hoc routing as defined in MANet IETF working group in the random graph model. In particular we analyze the performance of a reactive... -
On Generating Functions of Generating Trees
Generating trees describe conveniently certain families of combinatorial objects: each node of the tree corresponds to an object, and the branch leading to the node... -
Motif Statistics
We present a complete analysis of the statistics of number of occurrences of a regular expression pattern in a random text. This covers «motifs» widely used in... -
The algebraic combinatorics of snakes
International audience -
Combinatorial specification of permutation classes
International audience -
Generating functions of timed languages
International audience -
Explicit formula for the generating series of diagonal 3D rook paths
International audience -
Algorithms, words and random texts
In this memoir , I examine different aspects of a simple but ubiquitous computer object: the string or sequence of symbols. The string of characters concept is at the... -
Non-D-finite excursions in the quarter plane
International audience -
Average Case Analysis of Unification Algorithms
International audience -
Beyond the worst case evaluation: Comparison and average evaluation of optimi...
The complexity theory distinguishes between problems that are known to be solved in polynomial time in the size of the data ( which can be described as reasonable ) ,... -
The Width of Galton-Watson Trees Conditioned by the Size
International audience -
On an open problem of Green and Losonczy: exact enumeration of freely braided...
International audience -
The absence of a pattern and the occurrences of another
International audience
