Pages that link to "Item:Q2552381"
From MaRDI portal
The following pages link to Fast and read-only algorithms for traversing trees without an auxiliary stack (Q2552381):
Displaying 5 items.
- A bounded-space tree traversal algorithm (Q689629) (← links)
- Loop-free algorithms for traversing binary trees (Q786538) (← links)
- Efficient pebbling for list traversal synopses with application to program rollback (Q2373729) (← links)
- A study of binary tree traversal algorithms and a tag-free threaded representation (Q3802643) (← links)
- On the differential properties of the support function of the∈-subdifferential of a convex function (Q4742573) (← links)
