Computation on graph-like expressions (Q1134513): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Can programming be liberated from the von Neumann style? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4158499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of Applicative Programming for Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5686017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamics of discrete systems and pattern reproduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of replacement systems with simple optimality theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal evaluations of graph-like expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up subtree replacement systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4061934 / rank
 
Normal rank

Latest revision as of 02:55, 13 June 2024

scientific article
Language Label Description Also known as
English
Computation on graph-like expressions
scientific article

    Statements

    Identifiers