Minimizing space usage in evaluation of expression trees

DOI10.1007/3-540-60692-0_62MaRDI QIDQ2956697zbMATH OpenOpenAlexFDO

Authors Sandip Biswas, Sampath Kannan

Publication date 19 January 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60692-0_62

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Optimal contiguous expression DAG evaluations
• scientific article; zbMATH DE number 512911
• Scheduling expression DAGs for minimal register need
• Memory-optimal evaluation of expression trees involving large objects
• Sublinear-space evaluation algorithms for attribute grammars

Cited in

(6)

• On sparse evaluation representations
• scientific article; zbMATH DE number 177816 (Why is no real title available?)
• Optimal contiguous expression DAG evaluations
• Space saving by dynamic algebraization based on tree-depth
• Using term-graph rewriting models to analyse relative space efficiency
• Memory-optimal evaluation of expression trees involving large objects

This page was built for publication: Minimizing space usage in evaluation of expression trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2956697)