Search
-
Constructor Equivalent Term Rewriting Systems are Strongly Sequential: a direct proof
(Information Processing Letters. vol. 52, pp. 137--145, 1994)Article de revue -
Constructor Equivalent Term Rewriting Systems
(Information Processing Letters. vol. 47, pp. 131--137, 1993)Article de revue -
Bounded, Strongly Sequential and Forward-branching Term Rewriting Systems
(Journal of Symbolic Computation. vol. 18, pp. 319--352, 1994)Article de revue -
PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems
(Parallel Computing. vol. 28, n° 2, pp. 301--321, 2002)Article de revue -
On finding approximate supernodes for an efficient ILU(k) factorization
(Parallel Computing. vol. 34, pp. 345--362, 2008)Article de revue -
Compact Labelings For Efficient First-Order Model-Checking
(Journal of Combinatorial Optimization. vol. 21, n° 1, pp. 19--46, 2011-01-07)Article de revue -
On the Complexity of Distributed Graph Coloring with Local Minimality Constraints
(Networks. vol. 54, n° 1, pp. 12--19, 2009-08)Article de revue -
From Balls and Bins to Points and Vertices
(Algorithmic Operations Research. vol. 4, n° 2, pp. 133--143, 2009)Article de revue -
Approximation bounds for Black Hole Search problems
(Networks. vol. 52, n° 4, pp. 216--226, 2008-12)Article de revue -
On the Complexity of Bandwidth Allocation in Radio Networks
(Theoretical Computer Science. vol. 406, n° 3, pp. 225--239, 2008-10)Article de revue