A broadcasting algorithm with time and message optimum on arrangement graphs.
A Left-First Search Algorithm for Planar Graphs.
A note concerning the limit distribution of the quicksort algorithm
Acceleration of Le Bail fitting method on parallel platforms
Le Bail fitting method is procedure used in the applied crystallography mainly during the crystal structure determination. As in many other applications, there is a need for a great performance and short execution time. In this paper, we describe utilization of parallel computing for mathematical operations used in Le Bail fitting. We present an algorithm implementing this method with highlighted possible approaches to its aforementioned parallelization. Then, we propose a sample parallel version...
Addressing the stochastic nature of scientific computations via dynamic loop scheduling.
Algorithme quadratique de calcul de la solution générale d'équations en mots à une variable
Algorithmische Transformation von Papierstrukturen - Ein Beitrag zur Verallgemeinerung des Konstruktionsbegriffes
An additive Schwarz preconditioner for the spectral element ocean model formulation of the shallow water equations.
An Efficient Algorithm for Guard Placement in Polygons with Holes.
An intrinsically non minimal-time Minsky-like 6-states solution to the Firing Squad synchronization problem
Here is presented a 6-states non minimal-time solution which is intrinsically Minsky-like and solves the three following problems: unrestricted version on a line, with one initiator at each end of a line and the problem on a ring. We also give a complete proof of correctness of our solution, which was never done in a publication for Minsky's solutions.
Analysis of an approximation algorithm for scheduling indepentent parallel tasks.
Analysis of quickselect : an algorithm for order statistics
Applications of nonlinear diffusion in image processing and computer vision.
Assignment of Distributed Processing Software: A Comparative Study
Comments on the analysis of parameters in a Random Graph Model
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
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
Construction of e-Nets.