dblp.uni-trier.dewww.uni-trier.de

Jens Gustedt Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
37EEOlivier Dubuisson, Jens Gustedt, Emmanuel Jeannot: Validating Wrekavoc: A tool for heterogeneity emulation. IPDPS 2009: 1-12
2008
36EEPierre-Nicolas Clauss, Jens Gustedt, Frédéric Suter: Out-of-Core Wavefront Computations with Reduced Synchronization. PDP 2008: 293-300
35EEJens Gustedt: Engineering Parallel In-Place Random Generation of Integer Permutations. WEA 2008: 129-141
34EEJens Gustedt: Efficient sampling of random permutations. J. Discrete Algorithms 6(1): 125-139 (2008)
2006
33EEJens Gustedt, Stéphane Vialle, Amelia De Vivo: The parXXL Environment: Scalable Fine Grained Development for Large Coarse Grained Platforms. PARA 2006: 1094-1104
32EEMohamed Essaïdi, Jens Gustedt: An Experimental Validation of the PRO Model for Parallel and Distributed Computation. PDP 2006: 449-456
31EEGaurav 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
29EEJens Gustedt: Data Handover: Reconciling Message Passing and Shared Memory. Foundations of Global Computing 2005
2003
28EEJens Gustedt: Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm. ICCSA (2) 2003: 269-278
27EEJens Gustedt, Jan Arne Telle: A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. ICTCS 2003: 125-136
26EEJens Gustedt: Randomized permutations in a coarse grained parallel environment. SPAA 2003: 248-249
25EEAssefaw 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)
24EEKarell Bertet, Jens Gustedt, Michel Morvan: Weak-order extensions of an order. Theor. Comput. Sci. 1-3(304): 249-268 (2003)
2002
23EEJens Gustedt, Ole A. Mæhle, Jan Arne Telle: The Treewidth of Java Programs. ALENEX 2002: 86-97
22EEAssefaw 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
20EEIsabelle Guérin Lassous, Jens Gustedt: Portable List Ranking: An Experimental Study. ACM Journal of Experimental Algorithmics 7: 7 (2002)
19EEElias Dahlhaus, Jens Gustedt, Ross M. McConnell: Partially Complemented Representations of Digraphs. Discrete Mathematics & Theoretical Computer Science 5(1): 147-168 (2002)
2001
18EEElias Dahlhaus, Jens Gustedt, Ross M. McConnell: Efficient and Practical Algorithms for Sequential Modular Decomposition. J. Algorithms 41(2): 360-387 (2001)
2000
17EEIsabelle Guérin Lassous, Jens Gustedt: Portable List Ranking: An Experimental Study. Algorithm Engineering 2000: 111-122
16EEIsabelle 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
15EEAssefaw 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
13EEJens Gustedt: Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel. STACS 1998: 421-431
12EEJens 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
10EEChristophe Fiorio, Jens Gustedt: Memory Management for Union-Find Algorithms. STACS 1997: 67-79
9EEKarell Bertet, Jens Gustedt, Michel Morvan: Weak-Order Extensions of an Order. WG 1997: 65-77
1996
8EEJens Gustedt: Efficient Union-Find for Planar Graphs and other Sparse Graph Classes (Extended Abstract). WG 1996: 181-195
7EEChristophe Fiorio, Jens Gustedt: Two Linear Time Union-Find Strategies for Image Processing. Theor. Comput. Sci. 154(2): 165-181 (1996)
1995
6EEJens Gustedt, Michel Morvan, Laurent Viennot: A Compact Data Structure and Parallel Algorithms for Permutation Graphs. WG 1995: 372-380
5EEJens 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
3EEStefan Felsner, Jens Gustedt, Michel Morvan, Jean-Xavier Rampon: Constructing Colorings for Diagrams. Discrete Applied Mathematics 51(1-2): 85-93 (1994)
1993
2EEJens 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

Coauthor Index

1Karell Bertet [9] [24]
2Hans L. Bodlaender [14]
3Pierre-Nicolas Clauss [36]
4Elias Dahlhaus [11] [18] [19]
5Olivier Dubuisson [37]
6Mohamed Essaïdi [21] [30] [32]
7Stefan Felsner [3]
8Christophe Fiorio [7] [10]
9Assefaw Hadish Gebremedhin [15] [22] [25] [30]
10Gaurav Goel [31]
11Emmanuel Jeannot [37]
12Isabelle Guérin Lassous [15] [16] [17] [20] [21] [22] [25] [30]
13Ole A. Mæhle [23]
14Ross M. McConnell [11] [18] [19]
15Michel Morvan [3] [6] [9] [16] [24]
16Jean-Xavier Rampon [3]
17Angelika Steger [4]
18Frédéric Suter [36]
19Jan Arne Telle [14] [15] [22] [23] [25] [27] [30]
20Stéphane Vialle [33]
21Laurent Viennot [6]
22Amelia De Vivo [33]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)