Optimal algorithms for sensitivity analysis in associative multiplication problems (Q1149785): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Self-Organizing Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for updating minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new shortest path updating algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4082544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order- <i>n</i> correction for regular languages / rank
 
Normal rank

Latest revision as of 10:37, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimal algorithms for sensitivity analysis in associative multiplication problems
scientific article

    Statements

    Optimal algorithms for sensitivity analysis in associative multiplication problems (English)
    0 references
    0 references
    1981
    0 references
    deterministic variation schemes
    0 references
    lower bounds
    0 references
    binary search trees
    0 references
    Huffman trees
    0 references

    Identifiers