Results 121 to 130 of about 3,587 (160)
Some of the next articles are maybe not open access.
Treelogy: a benchmark suite for tree traversal applications
2016 IEEE International Symposium on Workload Characterization (IISWC), 2016An interesting class of irregular algorithms are tree traversal algorithms, which repeatedly traverse spatial trees to perform efficient computations. Optimizing tree traversal algorithms requires understanding specific characteristics of these algorithms which affect their behavior and govern which types of optimizations are likely to perform well. In
Milind Kulkarni
exaly +2 more sources
Efficient data-parallel tree-traversal for BlobTrees
CAD Computer Aided Design, 2016The hierarchical implicit modelling paradigm, as exemplified by the BlobTree, makes it possible to support not only Boolean operations and affine transformations, but also various forms of blending and space warping. Typically, the resulting solid is converted to a boundary representation, a triangle mesh approximation, for rendering.
Brian Wyvill
exaly +2 more sources
Another representation of binary tree traversal
Information Processing Letters, 1973exaly +3 more sources
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
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
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
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