Thomas Johnsson Department of Computing Science, Chalmers University of...  Home/Search
Context
Related
| md.chalmers.se/~jo...ithicarrays.ps.gz math.chalmers.se/~...ithicarrays.ps.gz cs.chalmers.se/~jo...ithicarrays.ps.gz 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: md.chalmers.se/~johnsson/ (more) From: math.chalmers.se/~johnsson/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper is to show how this problem, and some related ones, can be solved using a novel array creation primitive, lazier than previous ones. Thus, in section 2 we specify the array creation primitive lazyArray. In section 3 we give the solution to the graph marking and depth-first numbering problems using our lazy arrays. In section 4 we show how a related and more general problem, that of computing the transitive closure of a binary relation, can be solved in a similar manner. Graph based... (Update)
Active bibliography (related documents): More All
0.0: Parallel Haskell: The vectorisation monad - Keith Clarke (1993) (Correct)
0.0: Execution Profiling for Non-strict Functional Languages - Sansom (1994) (Correct)
0.0: Putting the Spine back in the Spineless Tagless G-Machine: An.. - Reid (1998) (Correct)
Similar documents based on text: More All
0.1: Graph Reduction, and how to avoid it (extended abstract of talk) - Johnsson (1995) (Correct)
0.1: A Data Parallel Finite Element Method for.. - Johan, Hughes.. (1992) (Correct)
0.1: Tracing and Debugging Lazy Functional Computations - Sparud (1999) (Correct)
BibTeX entry: (Update)
@article{ johnsson98efficient,
author = "Thomas Johnsson",
title = "Efficient Graph Algorithms Using Lazy Monolithic Arrays",
journal = "Journal of Functional Programming",
volume = "8",
number = "4",
pages = "323-333",
year = "1998",
url = "citeseer.ist.psu.edu/95126.html" }
Citations (may not include all citations):59 Basic Polymorphic Typechecking - Luca - 1987
19 Fixing Some Space Leaks without a Garbage Collector - Jan - 1993
Documents on the same site (http://www.md.chalmers.se/~johnsson/): More
Parallel Evaluation of Functional Programs: The G-machine approach - Johnsson (1991) (Correct)
Parallel Graph Reduction with the -machine - Augustsson, Johnsson (1989) (Correct)
The GRIN Project: A Highly Optimising Back End for Lazy.. - Boquist, Johnsson (1996) (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