Fast and read-only algorithms for traversing trees without an auxiliary stack (Q2552381): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:33, 5 March 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
