The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jens Gustedt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  33. Validating Wrekavoc: A tool for heterogeneity emulation. [Citation Graph (, )][DBLP]


  34. Out-of-Core Wavefront Computations with Reduced Synchronization. [Citation Graph (, )][DBLP]


  35. Experimenting Iterative Computations with Ordered Read-Write Locks. [Citation Graph (, )][DBLP]


  36. Engineering Parallel In-Place Random Generation of Integer Permutations. [Citation Graph (, )][DBLP]


Search in 0.073secs, Finished in 0.374secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002