Jens Gustedt
Jens Gustedt
directeur de recherches, INRIA Nancy - Grand Est
Bestätigte E-Mail-Adresse bei inria.fr
Titel
Zitiert von
Zitiert von
Jahr
Two linear time Union-Find strategies for image processing
C Fiorio, J Gustedt
Theoretical Computer Science 154 (2), 165-181, 1996
2261996
On the Pathwidth of Chordal Graphs.
J Gustedt
Discret. Appl. Math. 45 (3), 233-248, 1993
1171993
Efficient and practical algorithms for sequential modular decomposition
E Dahlhaus, J Gustedt, RM McConnell
Journal of Algorithms 41 (2), 360-387, 2001
1132001
Experimental validation in large-scale systems: a survey of methodologies
J Gustedt, E Jeannot, M Quinson
Parallel Processing Letters 19 (3), 399-418, 2009
111*2009
A pratical and efficient algorithm for substitution decomposition
E Dahlhaus, J Gustedt, RM McConnell
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms …, 1997
87*1997
Linear-time register allocation for a fixed number of registers
H Bodlaender, J Gustedt, JA Telle
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms …, 1998
551998
The treewidth of Java programs
J Gustedt, OA Mæhle, JA Telle
Workshop on Algorithm Engineering and Experimentation, 86-97, 2002
532002
Bounded arboricity to determine the local structure of sparse graphs
G Goel, J Gustedt
International Workshop on Graph-Theoretic Concepts in Computer Science, 159-167, 2006
322006
PRO: A model for the design and analysis of efficient and scalable parallel algorithms
AH Gebremedhin, J Gustedt, M Essaïdi, I Guérin Lassous, JA Telle
Nordic Journal of Computing 13 (4), 215-239, 2006
30*2006
Partially Complemented Representations of Digraphs.
E Dahlhaus, J Gustedt, RM McConnell
Discrete Mathematics & Theoretical Computer Science 5 (1), 147-168, 2002
302002
Iterative computations with ordered read-write locks
PN Clauss, J Gustedt
Journal of Parallel and Distributed Computing 70 (5), 496-504, 2010
262010
Efficient union-find for planar graphs and other sparse graph classes
J Gustedt
Graph-Theoretic Concepts in Computer Science, 181-195, 1997
261997
Efficient union-find for planar graphs and other sparse graph classes
J Gustedt
Theoretical computer science 203 (1), 123-141, 1998
241998
PRO: A Model for Parallel Resource-Optimal Computation.
AH Gebremedhin, I Guérin Lassous, J Gustedt, JA Telle
HPCS, 106-113, 2002
232002
PRO: a model for parallel resource-optimal computation
AH Gebremedhin, J Gustedt, IG Lassous, JA Telle
232001
The parXXL environment: Scalable fine grained development for large coarse grained platforms
J Gustedt, S Vialle, A De Vivo
International Workshop on Applied Parallel Computing, 1094-1104, 2006
21*2006
Portable list ranking: an experimental study
I Guérin Lassous, J Gustedt
Journal of Experimental Algorithmics (JEA) 7, 7, 2002
202002
Portable list ranking: An experimental study
I Guérin Lassous, J Gustedt
Algorithm Engineering, 111-122, 2001
20*2001
Portable list ranking: an experimental study
IG Lassous, J Gustedt
International Workshop on Algorithm Engineering, 111-122, 2000
202000
Defining and controlling the heterogeneity of a cluster: The Wrekavoc tool
LC Canon, O Dubuisson, J Gustedt, E Jeannot
Journal of Systems and Software 83 (5), 786-802, 2010
192010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20