Ergodic Properties of Certain Surjective Cellular Automata.
Establishing Order in Planar Subdivisions.
Estimation of the algorithmic complexity of classes of computable models.
Estudio de algunas secuencias pseudoaleatorias de aplicación criptográfica.
Pseudorandom binary sequences are required in stream ciphers and other applications of modern communication systems. In the first case it is essential that the sequences be unpredictable. The linear complexity of a sequence is the amount of it required to define the remainder. This work addresses the problem of the analysis and computation of the linear complexity of certain pseudorandom binary sequences. Finally we conclude some characteristics of the nonlinear function that produces the sequences...
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie II
Étude des spécifications modulaires : constructions de colimites finies, diagrammes, isomorphismes. Partie III
Étude et implémentation d'un système de déduction pour logique algorithmique
Étude spectrale de la multiplication -adique
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
E-unification by means of tree tuple synchronized grammars.
Even kernels.
Every commutative quasirational language is regular
Exact bounds on the complexity of sequential string matching algorithms. (Des bornes exactes de la complexité des algorithmes séquentiels de recherche d'un motif.)
Exact double domination in graphs
In a graph a vertex is said to dominate itself and all its neighbours. A doubly dominating set of a graph G is a subset of vertices that dominates every vertex of G at least twice. A doubly dominating set is exact if every vertex of G is dominated exactly twice. We prove that the existence of an exact doubly dominating set is an NP-complete problem. We show that if an exact double dominating set exists then all such sets have the same size, and we establish bounds on this size. We give a constructive...
Executable specifications for data-type constructors
Exemples de classes d'automates cellulaires
Lorsqu'on observe des orbites de certains automates cellulaires, on peut penser qu'elles apparaissent comme des mélanges d'orbites d'autres automates (composants). Dans cet article, nous tentons de comprendre ce phénomène en construisant un hybride de deux automates au moyen d'un troisième. Deux types d'automates cellulaires sont introduits : les captifs et les foulards. Nous comparons des propriétés de ces hybrides dans le cadre des classifications algébriques introduites par [B. Martin...
Experiments with the fixed-parameter approach for two-layer planarization.
Expletives in languages and middle units in semigroups.
Exploiting the structure of conflict graphs in high level synthesis
In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.