Results 241 to 250 of about 41,749 (283)
Inversion of a recursive tree traversal [PDF]
Information Processing Letters, 1991 Accepted Version - 91-07.pdf Accepted Version - postscript ...
Jan L A van de Snepscheut
exaly +4 more sources
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Berman +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Parallel algorithms for tree traversals
Parallel Computing, 1985zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. C. Kalra, P. C. P. Bhatt
openaire +1 more source
Another representation of binary tree traversal
Information Processing Letters, 1973exaly +3 more sources
2021
A tree is a graph with no cycles. Applications of trees are various; organization of an establishment, a family genealogical relationships can all be represented by a tree. Trees also find a number of applications in computer science, a fundamental usage is the representation of data.
openaire +1 more source
A tree is a graph with no cycles. Applications of trees are various; organization of an establishment, a family genealogical relationships can all be represented by a tree. Trees also find a number of applications in computer science, a fundamental usage is the representation of data.
openaire +1 more source
1986
Programs which process tree structures usually cannot handle cyclic trees. This paper describes some new, very simple, and efficient algorithms for detecting and traversing cyclic trees. Traversed structures do not have to be modified. Tail recursion optimisation can be used, which reduces stack requirements greatly.
Martin Nilsson 0001, Hidehiko Tanaka
openaire +1 more source
Programs which process tree structures usually cannot handle cyclic trees. This paper describes some new, very simple, and efficient algorithms for detecting and traversing cyclic trees. Traversed structures do not have to be modified. Tail recursion optimisation can be used, which reduces stack requirements greatly.
Martin Nilsson 0001, Hidehiko Tanaka
openaire +1 more source
Tree-Traversal Orientation Analysis
2007This paper presents a profiling-based analysis to determine the traversal orientation of link-based tree data structures. Given the very-high memory-hierarchy latencies in modern computers, once the compiler has identified that a pointer-based data structure represents a tree, it would be useful to determine the predominant orientation of traversal for
Kevin Andrusky +2 more
openaire +1 more source
A taxonomy of binary tree traversals
BIT, 1986A survey of the literature shows that eleven binary tree traversals have been defined. We systematize this work by proposing a classification that consists of twenty-six traversals grouped into seven categories. Three generator schemas are provided that allow all of the traversals to be implemented.
openaire +2 more sources
Merkle Tree Traversal Revisited
2008We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.
Johannes Buchmann 0001 +2 more
openaire +1 more source
Treelogy: A benchmark suite for tree traversals
2017 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), 2017An interesting class of irregular algorithms is tree traversal algorithms, which repeatedly traverse various trees to perform efficient computations. Tree traversal algorithms form the algorithmic kernels in an important set of applications in scientific computing, computer graphics, bioinformatics, and data mining, etc.
Nikhil Hegde +3 more
openaire +1 more source