| 2008 |
|---|
| 36 | EE | Pierre-Nicolas Clauss,
Jens Gustedt,
Frédéric Suter:
Out-of-Core Wavefront Computations with Reduced Synchronization.
PDP 2008: 293-300 |
| 35 | EE | Jens Gustedt:
Engineering Parallel In-Place Random Generation of Integer Permutations.
WEA 2008: 129-141 |
| 34 | EE | Jens Gustedt:
Efficient sampling of random permutations.
J. Discrete Algorithms 6(1): 125-139 (2008) |
| 2006 |
|---|
| 33 | EE | Jens Gustedt,
Stéphane Vialle,
Amelia De Vivo:
The parXXL Environment: Scalable Fine Grained Development for Large Coarse Grained Platforms.
PARA 2006: 1094-1104 |
| 32 | EE | Mohamed Essaïdi,
Jens Gustedt:
An Experimental Validation of the PRO Model for Parallel and Distributed Computation.
PDP 2006: 449-456 |
| 31 | EE | Gaurav Goel,
Jens Gustedt:
Bounded Arboricity to Determine the Local Structure of Sparse Graphs.
WG 2006: 159-167 |
| 30 | | Assefaw Hadish Gebremedhin,
Mohamed Essaïdi,
Isabelle Guérin Lassous,
Jens Gustedt,
Jan Arne Telle:
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms.
Nord. J. Comput. 13(4): 215-239 (2006) |
| 2005 |
|---|
| 29 | EE | Jens Gustedt:
Data Handover: Reconciling Message Passing and Shared Memory.
Foundations of Global Computing 2005 |
| 2003 |
|---|
| 28 | EE | Jens Gustedt:
Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm.
ICCSA (2) 2003: 269-278 |
| 27 | EE | Jens Gustedt,
Jan Arne Telle:
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set.
ICTCS 2003: 125-136 |
| 26 | EE | Jens Gustedt:
Randomized permutations in a coarse grained parallel environment.
SPAA 2003: 248-249 |
| 25 | EE | Assefaw Hadish Gebremedhin,
Isabelle Guérin Lassous,
Jens Gustedt,
Jan Arne Telle:
Graph coloring on coarse grained multicomputers.
Discrete Applied Mathematics 131(1): 179-198 (2003) |
| 24 | EE | Karell Bertet,
Jens Gustedt,
Michel Morvan:
Weak-order extensions of an order.
Theor. Comput. Sci. 1-3(304): 249-268 (2003) |
| 2002 |
|---|
| 23 | EE | Jens Gustedt,
Ole A. Mæhle,
Jan Arne Telle:
The Treewidth of Java Programs.
ALENEX 2002: 86-97 |
| 22 | EE | Assefaw Hadish Gebremedhin,
Isabelle Guérin Lassous,
Jens Gustedt,
Jan Arne Telle:
PRO: A Model for Parallel Resource-Optimal Computation.
HPCS 2002: 106-113 |
| 21 | | Mohamed Essaïdi,
Isabelle Guérin Lassous,
Jens Gustedt:
SSCRAP: An Environment for Coarse Grained Algorithms.
IASTED PDCS 2002: 393-398 |
| 20 | EE | Isabelle Guérin Lassous,
Jens Gustedt:
Portable List Ranking: An Experimental Study.
ACM Journal of Experimental Algorithmics 7: 7 (2002) |
| 19 | EE | Elias Dahlhaus,
Jens Gustedt,
Ross M. McConnell:
Partially Complemented Representations of Digraphs.
Discrete Mathematics & Theoretical Computer Science 5(1): 147-168 (2002) |
| 2001 |
|---|
| 18 | EE | Elias Dahlhaus,
Jens Gustedt,
Ross M. McConnell:
Efficient and Practical Algorithms for Sequential Modular Decomposition.
J. Algorithms 41(2): 360-387 (2001) |
| 2000 |
|---|
| 17 | EE | Isabelle Guérin Lassous,
Jens Gustedt:
Portable List Ranking: An Experimental Study.
Algorithm Engineering 2000: 111-122 |
| 16 | EE | Isabelle Guérin Lassous,
Jens Gustedt,
Michel Morvan:
Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI.
PVM/MPI 2000: 72-79 |
| 15 | EE | Assefaw Hadish Gebremedhin,
Isabelle Guérin Lassous,
Jens Gustedt,
Jan Arne Telle:
Graph Coloring on a Coarse Grained Multiprocessor.
WG 2000: 184-195 |
| 1998 |
|---|
| 14 | | Hans L. Bodlaender,
Jens Gustedt,
Jan Arne Telle:
Linear-Time Register Allocation for a Fixed Number of Registers.
SODA 1998: 574-583 |
| 13 | | Jens Gustedt:
Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel.
STACS 1998: 421-431 |
| 12 | EE | Jens Gustedt:
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes.
Theor. Comput. Sci. 203(1): 123-141 (1998) |
| 1997 |
|---|
| 11 | | Elias Dahlhaus,
Jens Gustedt,
Ross M. McConnell:
Efficient and Practical Modular Decomposition.
SODA 1997: 26-35 |
| 10 | | Christophe Fiorio,
Jens Gustedt:
Memory Management for Union-Find Algorithms.
STACS 1997: 67-79 |
| 9 | | Karell Bertet,
Jens Gustedt,
Michel Morvan:
Weak-Order Extensions of an Order.
WG 1997: 65-77 |
| 1996 |
|---|
| 8 | | Jens Gustedt:
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract).
WG 1996: 181-195 |
| 7 | EE | Christophe Fiorio,
Jens Gustedt:
Two Linear Time Union-Find Strategies for Image Processing.
Theor. Comput. Sci. 154(2): 165-181 (1996) |
| 1995 |
|---|
| 6 | | Jens Gustedt,
Michel Morvan,
Laurent Viennot:
A Compact Data Structure and Parallel Algorithms for Permutation Graphs.
WG 1995: 372-380 |
| 5 | EE | Jens Gustedt:
Well Quasi Ordering Finite Posets and Formal Languages.
J. Comb. Theory, Ser. B 65(1): 111-124 (1995) |
| 1994 |
|---|
| 4 | | Jens Gustedt,
Angelika Steger:
Testing Hereditary Properties Efficiently on Average.
ORDAL 1994: 100-116 |
| 3 | EE | Stefan Felsner,
Jens Gustedt,
Michel Morvan,
Jean-Xavier Rampon:
Constructing Colorings for Diagrams.
Discrete Applied Mathematics 51(1-2): 85-93 (1994) |
| 1993 |
|---|
| 2 | EE | Jens Gustedt:
On the Pathwidth of Chordal Graphs.
Discrete Applied Mathematics 45(3): 233-248 (1993) |
| 1991 |
|---|
| 1 | | Jens Gustedt:
Well-quasi-ordering finite posets.
Graph Structure Theory 1991: 511-516 |
