A fast implementation of a multidimensional storage into a tree storage (Q1166931): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q126865869, #quickstatements; #temporary_batch_1719497096356
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(82)90037-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093865976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving average proximity in arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Trade-Offs in Structured Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulations among multidimensional Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations Among Complexity Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data encodings and their costs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126865869 / rank
 
Normal rank

Latest revision as of 16:06, 27 June 2024

scientific article
Language Label Description Also known as
English
A fast implementation of a multidimensional storage into a tree storage
scientific article

    Statements

    A fast implementation of a multidimensional storage into a tree storage (English)
    0 references
    1982
    0 references
    on-line simulation
    0 references
    tree storage
    0 references
    multidimensional storage
    0 references
    performance measures for embeddings of graphs
    0 references
    Turing machine
    0 references
    tree machine
    0 references

    Identifiers

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