On the recursion depth of special tree traversal algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3881890
- On the complexity of algorithms on recursive trees
- On the existence of special depth first search trees
- scientific article; zbMATH DE number 3854413
- A complexity calculus for recursive tree algorithms
- Publication:4940321
- Bounding the depth of search trees
- On the complexity of computing treelength
- On the Complexity of Computing Treelength
Cites work
- scientific article; zbMATH DE number 3134390 (Why is no real title available?)
- scientific article; zbMATH DE number 3845601 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3390782 (Why is no real title available?)
- On the number of certain lattice polygons
- The average height of binary trees and other simple trees
- The average number of registers needed to evaluate a binary tree optimally
- The number of registers required for evaluating arithmetic expressions
- q-Catalan numbers
Cited in
(9)- Insertion depth in power-weight trees
- On the stack-size of general tries
- scientific article; zbMATH DE number 3881890 (Why is no real title available?)
- Random trees in queueing systems with deadlines
- On the complexity of algorithms on recursive trees
- On the existence of special depth first search trees
- Computing Tree-Depth Faster Than 2 n
- FCFS-scheduling in a hard real-time environment under rush-hour conditions
- Some investigations on FCFS scheduling in hard real time applications
This page was built for publication: On the recursion depth of special tree traversal algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579943)
