Construction of solvable near-block designs with the aid of a computer. (Konstruktion auflösbarer Fast-Blockpläne mit Hilfe eines Computers.)
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
Efficient Improvement of Brain-Tharp's Algorithm
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
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.)
Exhaustive List-Scheduling Heuristic for Dense Task Graphs
Faster backtracking algorithms for the generation of symmetry-invariant permutations.
Implementing an interior point method for linear programs on a CPU-GPU system.
Integrated Design of an Active Flow Control System Using a Time-Dependent Adjoint Method
An exploratory study is performed to investigate the use of a time-dependent discrete adjoint methodology for design optimization of a high-lift wing configuration augmented with an active flow control system. The location and blowing parameters associated with a series of jet actuation orifices are used as design variables. In addition, a geometric parameterization scheme is developed to provide a compact set of design variables describing the wing...
Introduction à l'algorithmique des objets partagés
Measuring the performance for parallel matrix multiplication algorithm.
On Shank's algorithm for modular square roots.
On the behaviour of learning algorithms in a changing environment with application to data network routing problem
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
On the distributed decision-making complexity of the minimum vertex cover problem
On the parallel complexity of the alternating hamiltonian cycle problem
On the parallel complexity of the alternating Hamiltonian cycle problem
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges differ in color. The problem of finding such a cycle, even for 2-edge-colored graphs, is trivially NP-complete, while it is known to be polynomial for 2-edge-colored complete graphs. In this paper we study the parallel complexity of finding such a cycle, if any, in 2-edge-colored complete graphs. We give a new characterization for such a graph admitting an alternating Hamiltonian cycle which allows...
On the proper intervalization of colored caterpillar trees
This paper studies the computational complexity of the proper interval colored graph problem (PICG), when the input graph is a colored caterpillar, parameterized by hair length. In order prove our result we establish a close relationship between the PICG and a graph layout problem the proper colored layout problem (PCLP). We show a dichotomy: the PICG and the PCLP are NP-complete for colored caterpillars of hair length ≥2, while both problems are in P for colored caterpillars of hair length <2. For...
On-line computations of the ideal lattice of posets
On-line evaluation of powers using Euclid's algorithm