Analysing parallel complexity of term rewriting (Q6160759): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cost analysis of object-oriented bytecode programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Cost Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combination framework for complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for complexity of parallel computation in pi-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6176119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Work Analysis with Resource-Aware Session Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term rewriting on GPUs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Analysis of Complex Programs with Cost Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for runtime complexity of term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing program termination and complexity automatically with \textsf{AProVE} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Complexity Analysis Based on the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Complexity Analysis Based on Context-Sensitive Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs and the length of derivations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Static Cost Analysis for Parallel Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Framework for Static Cost Analysis of Parallel Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting with Logical Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated amortised resource analysis for term rewrite systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis for term rewriting by integer transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing innermost runtime complexity of term rewriting by dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Runtime complexity analysis of logically constrained rewriting / rank
 
Normal rank

Latest revision as of 06:11, 1 August 2024

scientific article; zbMATH DE number 7691338
Language Label Description Also known as
English
Analysing parallel complexity of term rewriting
scientific article; zbMATH DE number 7691338

    Statements

    Analysing parallel complexity of term rewriting (English)
    0 references
    0 references
    0 references
    0 references
    2 June 2023
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references