Fast and read-only algorithms for traversing trees without an auxiliary stack (Q2552381)

From MaRDI portal
Revision as of 10:07, 12 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast and read-only algorithms for traversing trees without an auxiliary stack
scientific article

    Statements

    title
    Fast and read-only algorithms for traversing trees without an auxiliary stack (English)
    0 references
    publication date
    1972
    0 references
    author
    Laurent Siklóssy
    0 references
    cites work
    Q5585020
    0 references

    Identifiers

    zbMATH DE Number
    3374939
    0 references
    OpenAlex ID
    W1969294684
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2552381&oldid=34546191"
    Powered by MediaWiki