Sandip K. Biswas, Sampath Kannan  Home/Search
Context
Related
| upenn.edu/~sbiswas/pape...sampath.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: upenn.edu/~sbiswas...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . An important issue in the evaluation of expression trees (and more generally, directed acyclic graphs (dags)) is the order in which the nodes of the graph are evaluated. In the register sufficiency problem, the evaluation begins with none of the nodes of the dag being placed in registers. On the other hand, if an expression dag, containing variables, is being evaluated in an environment then the nodes of the graph, with out-degree zero, are variables, whose values are contained in the... (Update)
Active bibliography (related documents): More All
0.5: Order-of-evaluation Analysis for Destructive Updates in.. - Sastry, CLinger, Ariola (1993) (Correct)
0.0: Constructing Optimal Bushy Processing Trees for Join.. - Scheufele, Moerkotte (1996) (Correct)
0.0: Optimality Conditions and Exact Neighborhoods for Sequencing.. - Knust (1997) (Correct)
Similar documents based on text: More All
0.2: Stability of the iterative process x_(n+1) = Tx_n for Kannan.. - López, Juárez (Correct)
0.1: Computing the Local Consensus of Trees - Kannan, Warnow, Yooseph (1998) (Correct)
0.1: A Fast Algorithm For The Computation And Enumeration Of.. - Kannan, Warnow (1997) (Correct)
BibTeX entry: (Update)
@inproceedings{ biswas95minimizing,
author = "Sandip K. Biswas and Sampath Kannan",
title = "Minimizing Space Usage in Evaluation of Expression Trees",
booktitle = "Foundations of Software Technology and Theoretical Computer Science",
pages = "377-390",
year = "1995",
url = "citeseer.ist.psu.edu/15087.html" }
Citations (may not include all citations):521 Compiling with Continuations (context) - Appel - 1992
362 ML for the Working Programmer (context) - Paulson - 1991
316 Freeman And Company (context) - Garey, Johnson et al. - 1979
54 Complete register allocation problems (context) - Sethi - 1975
26 Sequencing with series-parallel precedence constraints (context) - Monma, Sidney - 1979
2 Pebble games for studying storage sharing (context) - Sethi - 1982
1 Testing concurrent data structures (context) - Bruno, Gibbons et al. - 1994
Documents on the same site (http://www.cis.upenn.edu/~sbiswas/publications.html):
A Demand-Driven Set-Based Analysis - Biswas (1997) (Correct)
Dynamic Slicing In Higher-Order Programming Languages - Biswas (1997) (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