THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE (Q3212290)

From MaRDI portal
Revision as of 10:11, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
scientific article

    Statements

    title
    THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE (English)
    0 references
    author
    Burton Rosenberg
    0 references
    Bernard Chazelle
    0 references
    publication date
    1991
    0 references
    zbMATH Keywords
    partial sums
    0 references
    lower-bounds
    0 references
    orthogonal range searching
    0 references

    Identifiers

    zbMATH DE Number
    4195183
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3212290&oldid=27582026"
    Powered by MediaWiki