Results 261 to 270 of about 41,749 (283)
Some of the next articles are maybe not open access.
Generalized non‐recursive traversal of binary trees
Software: Practice and Experience, 1981AbstractA non‐recursive algorithm for the traversal of a binary tree is presented in which the order of traversal is defined by an external data array, allowing any of the six possible orders to be selected without modification to the algorithm itself.
openaire +1 more source
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
Nikhil Hegde +2 more
exaly +2 more sources
Traversing and Modifying the DOM Tree
2010One of my favorite books as a child was Where the Wild Things Are by Maurice Sendak. If you are not familiar with the story, it goes like this: one night, a little boy named Max, dressed in a wolf costume, misbehaves and is sent to bed without supper. There, a sea, a wild forest, and mysterious creatures spring from his imagination.
openaire +1 more source
Automatic vectorization of tree traversals
Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, 2013Praveen Yedlapalli +5 more
openaire +1 more source
Review: Kd‐tree Traversal Algorithms for Ray Tracing
Computer Graphics Forum, 2011Vlastimil Havran
exaly
Merkle Tree Traversal in Log Space and Time
Lecture Notes in Computer Science, 2004Michael Szydlo
exaly
Traversing binary trees simply and cheaply
Information Processing Letters, 1979openaire +1 more source