Fast and read-only algorithms for traversing trees without an auxiliary stack (Q2552381): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / author | |||
| Property / author: Laurent Siklóssy / rank | |||
| Property / author | |||
| Property / author: Laurent Siklóssy / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(72)90048-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1969294684 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5585020 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:07, 12 June 2024
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
