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

From MaRDI portal
Revision as of 07:33, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Fast and read-only algorithms for traversing trees without an auxiliary stack
scientific article

    Statements

    Fast and read-only algorithms for traversing trees without an auxiliary stack (English)
    0 references
    1972
    0 references
    0 references

    Identifiers