Computing communities in large networks using random walks.
Computing Gröbner fans of toric ideals.
Computing Kazhdan-Lusztig polynomials for arbitrary Coxeter groups.
Computing nilpotent quotients in finitely presented Lie rings.
Computing parametric rational generating functions with a primal Barvinok algorithm.
Computing Strong Metric Dimension of some Special Classes of Graphs by Genetic Algorithms
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
Computing the integral closure of an affine semigroup.
Computing the period of an Ehrhart quasi-polynomial.
Computing -free NFA from regular expressions in time
Computing ϵ-Free NFA from Regular Expressions in O(n log2(n)) Time
The standard procedure to transform a regular expression of size n to an ϵ-free nondeterministic finite automaton yields automata with O(n) states and O(n2) transitions. For a long time this was supposed to be also the lower bound, but a result by Hromkovic et al. showed how to build an ϵ-free NFA with only O(n log2(n)) transitions. The current lower bound on the number of transitions is Ω(n log(n)). A rough running time estimation for the common follow sets (CFS) construction proposed...
Conception de séquences de séparation par un algorithme génétique
Congruence, Similarity, and Symmetries of Geometric Objects.
Conjugacy of subgroups of the general linear group.
Constructing Arrangements Optimally in Parallel.
Constructing canonical bases of quantized enveloping algebras.
Construction du treillis de Galois d'une relation binaire
Cet article constitue une présentation unifiée des principales méthodes de construction du treillis de Galois d'une correspondance. Nous rappelons d'abord sa définition, puis nous décrivons quatre algorithmes de construction des éléments du treillis qui sont les rectangles maximaux de la relation binaire. Ces algorithmes ne sont pas originaux. Les descriptions précises de algorithmes, le plus souvent absentes des publications originales, permettent une programmation simple, dans un langage procédural...
Construction of e-Nets.
Construction of solvable near-block designs with the aid of a computer. (Konstruktion auflösbarer Fast-Blockpläne mit Hilfe eines Computers.)
Contribution à la résolution numérique des équations de Laplace et de la chaleur