Memory-optimal evaluation of expression trees involving large objects (Q2275530): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cl.2010.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018225658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Science – ICCS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Languages and Compilers for Parallel Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compiling algorithms for arithmetic expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of Optimal Code for Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Register Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the sethi‐ullman algorithm for register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modern Compiler Implementation in Java / rank
 
Normal rank

Revision as of 08:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Memory-optimal evaluation of expression trees involving large objects
scientific article

    Statements

    Memory-optimal evaluation of expression trees involving large objects (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 August 2011
    0 references
    expression tree
    0 references
    evaluation order
    0 references
    memory minimization
    0 references
    register allocation
    0 references

    Identifiers