The Generation of Optimal Code for Arithmetic Expressions
From MaRDI portal
Cited in
(23)- Speicheroptimale Formelübersetzung
- Generalizations of the sethi‐ullman algorithm for register allocation
- scientific article; zbMATH DE number 3829270 (Why is no real title available?)
- Uniform random generation of expressions respecting algebraic identities
- scientific article; zbMATH DE number 3366529 (Why is no real title available?)
- scientific article; zbMATH DE number 3371610 (Why is no real title available?)
- Optimal scheduling for exposed datapath architectures with buffered processing units by ASP
- Optimal contiguous expression DAG evaluations
- Minimizing I/Os in Out-of-Core Task Tree Scheduling
- On the Sethi-Ullman algorithm
- DNA-templated synthesis optimization
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- TSFC: A Structure-Preserving Form Compiler
- Automata for the verification of monadic second-order graph properties
- Strahler number of natural language sentences in comparison with random trees
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
- Scheduling series-parallel task graphs to minimize peak memory
- scientific article; zbMATH DE number 3448088 (Why is no real title available?)
- Complexity of optimal vector code generation
- Typical sequences revisited -- computing width parameters of graphs
- Memory-optimal evaluation of expression trees involving large objects
- scientific article; zbMATH DE number 3872676 (Why is no real title available?)
This page was built for publication: The Generation of Optimal Code for Arithmetic Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5613555)
