Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine  Home/Search
Context Related
Links: ACM DBLP | nd.edu/~jsiek/./iscope98.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nd.edu/~jsiek/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance, the corresponding implementations are typically realized with programming languages devoid of language features necessary to explicitly represent graph abstractions. Recently, generic programming has emerged as a programming paradigm capable of providing high levels of... (Update)
Context of citations to this paper: More
.... ed in this paper because of its di erent focus) which implements the minimum degree algorithm is the Generic Graph Component Library [63, 62]. This library is based on generic and object oriented programming, and its emphasis is on making algorithms for graphs independent...
Cited by: More
Concepts: Linguistic Support for Generic Programming in C++ - Douglas Gregor Dgregor (Correct)
Oolala - From Numerical Linear Algebra To Compiler Technology For .. - Moreno (2002) (Correct)
OoLaLa: an Object Oriented Analysis and Design of.. - Luján, Freeman, Gurd (2000) (Correct)
Similar documents (at the sentence level):
60.0%: Generic Graph Algorithms for Sparse Matrix Ordering - Lee, Siek, Lumsdaine (1999) (Correct)
28.7%: The High Performance Generic Graph Component Library - Lee (1999) (Correct)
16.8%: The Generic Graph Component Library - Lee, Siek, Lumsdaine (1999) (Correct)
Active bibliography (related documents): More All
0.3: An Object-Oriented Collection of Minimum Degree Algorithms.. - Kumfert, Pothen (1998) (Correct)
0.3: The Design of Sparse Direct Solvers using Object-Oriented .. - Dobrian, Kumfert, Pothen (1999) (Correct)
0.2: tal paradigm underlying the STL, was - An Important And (Correct)
Similar documents based on text: More All
0.3: Caramel: A Concept Representation System for Generic.. - Willcock, Siek, Lumsdaine (Correct)
0.3: Random LSC Functions: Scalarization - Korf, Wets (1999) (Correct)
0.2: Mayfly A Pattern for Lightweight Generic Interfaces - Siek, Lumsdaine (1999) (Correct)
Related documents from co-citation: More All
4: The Theory of Matrices Vol (context) - Gantmacher - 1959
4: An evaluation of Java for numerical computing - Blount, Chatterjee - 1998
3: Expression templates - Veldhuizen - 1995
BibTeX entry: (Update)
L.-Q. Lee, J. G. Siek, and A. Lumsdaine. Generic graph algorithms for sparse matrix ordering. In S. Matsouka, R. R. Oldehoeft, and M. Tholburn, editors, Computing in Object-Oriented Parallel Environment, Third International Symposium ISCOPE 99,volume 1732 of Lecture Notes in Computer Science. Springer-Verlag, 1999. http://citeseer.ist.psu.edu/article/lee99generic.html More
@inproceedings{ lee99generic,
author = "Lie-Quan Lee and Jeremy G. Siek and Andrew Lumsdaine",
title = "Generic Graph Algorithms for Sparse Matrix Ordering",
booktitle = "{ISCOPE}",
pages = "120-129",
year = "1999",
url = "citeseer.ist.psu.edu/article/lee99generic.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990 ACM
554 Design Patterns: Elements of Reusable Object-Oriented Softwa.. (context) - Gamma, Helm et al. - 1994
108 The standard template library - Lee, Stepanov - 1995 ACM
88 User's guide for the harwell-boeing sparse matrix collection (context) - Grimes, Lewis et al. - 1992
80 The evolution of the minimum degree ordering algorithm (context) - George, Liu - 1989 ACM
74 Modification of the minimum-degree algorithm by multiple eli.. (context) - Liu - 1985 ACM DBLP
31 Generic Programming and the STL (context) - Austern - 1998 ACM
31 The matrix template library: A generic programming approach .. - Siek, Lumsdaine - 1998 DBLP
19 Implementing layered designs with mixin layers - Samaragdakis, Batory - 1998 ACM DBLP
12 The generic graph component library - Lee, Siek et al. - 1999 ACM DBLP
11 Performance of greedy ordering heuristics for sparse Cholesk.. - amd, Raghavan ACM
5 An object-oriented collection of minimum degree algorithms - Kumfert, Pothen - 1998 ACM DBLP
4 The use of planar graph in Gaussian elimination (context) - Parter - 1961
2 An approximation minimum degree ordering algorithm (context) - Amestoy, Davis et al. - 1996
2 A sparse matrix package using the standard template library (context) - Zhong - 1996
2 Computing the minimum fill-in is NP-complete (context) - Yannanakis - 1981
Documents on the same site (http://www.lsc.nd.edu/~jsiek/): More
Concept Checking: Binding Parametric Polymorphism in C++ - Siek, Lumsdaine (2000) (Correct)
Mayfly A Pattern for Lightweight Generic Interfaces - Siek, Lumsdaine (1999) (Correct)
The Generic Graph Component Library - Siek, Lee, Lumsdaine (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC