Two linear time Union-Find strategies for image processing C Fiorio, J Gustedt Theoretical Computer Science 154 (2), 165-181, 1996 | 276 | 1996 |
Efficient and practical algorithms for sequential modular decomposition E Dahlhaus, J Gustedt, RM McConnell Journal of Algorithms 41 (2), 360-387, 2001 | 190 | 2001 |
On the Pathwidth of Chordal Graphs. J Gustedt Discret. Appl. Math. 45 (3), 233-248, 1993 | 127 | 1993 |
Experimental methodologies for large-scale systems: a survey J Gustedt, E Jeannot, M Quinson Parallel Processing Letters 19 (03), 399-418, 2009 | 123* | 2009 |
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 | 70 | 1998 |
The treewidth of Java programs J Gustedt, OA Mæhle, JA Telle Workshop on Algorithm Engineering and Experimentation, 86-97, 2002 | 63 | 2002 |
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 | 40 | 2006 |
Partially Complemented Representations of Digraphs. E Dahlhaus, J Gustedt, RM McConnell Discrete Mathematics & Theoretical Computer Science 5 (1), 147-168, 2002 | 32 | 2002 |
PRO: A Model for Parallel Resource-Optimal Computation. AH Gebremedhin, I Guérin Lassous, J Gustedt, JA Telle HPCS, 106-113, 2002 | 31 | 2002 |
Iterative computations with ordered read-write locks PN Clauss, J Gustedt Journal of Parallel and Distributed Computing 70 (5), 496-504, 2010 | 27 | 2010 |
Efficient union-find for planar graphs and other sparse graph classes J Gustedt Theoretical computer science 203 (1), 123-141, 1998 | 27 | 1998 |
Efficient union-find for planar graphs and other sparse graph classes J Gustedt Graph-Theoretic Concepts in Computer Science, 181-195, 1997 | 27 | 1997 |
The parXXL Environment: Scalable Fine Grained Development for Large Coarse Grained Platforms J Gustedt, S Vialle, A De Vivo Applied Parallel Computing. State of the Art in Scientific Computing: 8th …, 2007 | 25* | 2007 |
Portable list ranking: An experimental study I Guérin Lassous, J Gustedt Algorithm Engineering, 111-122, 2001 | 22* | 2001 |
Graph coloring on a coarse grained multiprocessor A Gebremedhin, I Guérin Lassous, J Gustedt, J Telle Graph-Theoretic Concepts in Computer Science, 59-88, 2000 | 21 | 2000 |
Portable list ranking: an experimental study I Guérin Lassous, J Gustedt Journal of Experimental Algorithmics (JEA) 7, 7, 2002 | 20 | 2002 |
EPISCIENCES-an overlay publication platform C Berthaud, L Capelli, J Gustedt, C Kirchner, L Kevin, A Magron, ... ELPUB2014-International Conference on Electronic Publishing, 2014 | 19 | 2014 |
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 | 19 | 2010 |
Randomized permutations in a coarse grained parallel environment J Gustedt Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and …, 2003 | 17 | 2003 |
SSCRAP: An environment for coarse grained algorithms M Essaïdi, I Guérin Lassous, J Gustedt 14th IASTED International Conference on Parallel and Distributed Computing …, 2002 | 17 | 2002 |