Results 11 to 20 of about 41,749 (283)
Reasoning about recursive tree traversals [PDF]
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021 Traversals are commonly seen in tree data structures, and performance-enhancing transformations between tree traversals are critical for many applications. Existing approaches to reasoning about tree traversals and their transformations are ad hoc, with various limitations on the class of traversals they can handle, the granularity of dependence ...
Yanjun Wang +3 more
openaire +2 more sources
Parsing as tree traversal [PDF]
Proceedings of the 15th conference on Computational linguistics -, 1994 This paper presents a unified approach to parsing, in which top-down, bottom-up and left-corner parsers are related to preorder, postorder and inorder tree traversals. It is shown that the simplest bottom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form.
openaire +3 more sources
Performance Analysis and Improvement in UNIX File System Tree Traversal [PDF]
, 1988 A utility program has been developed to aid UNIX system administrators in obtaining information about mounted file systems. The program gathers the information by a traversal of the accessible nodes in the file hierarchy; without kernel-recorded path ...
Smith, Jonathan M.
core +2 more sources
A bounded-space tree traversal algorithm [PDF]
Information Processing Letters, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel S. Hirschberg, Steven S. Seiden
openaire +2 more sources
Binary Decision Diagrams: from Tree Compaction to Sampling [PDF]
, 2020 Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique ...
A Genitrini +9 more
core +2 more sources
Ordered trees and the inorder traversal
Discrete Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aristidis Sapounakis +2 more
openaire +1 more source
Efficiently listing bounded length st-paths [PDF]
, 2014 The problem of listing the $K$ shortest simple (loopless) $st$-paths in a graph has been studied since the early 1960s. For a non-negatively weighted graph with $n$ vertices and $m$ edges, the most efficient solution is an $O(K(mn + n^2 \log n ...
Rizzi, Romeo +2 more
core +2 more sources
Splaying a search tree in preorder takes linear time
International Journal of Mathematics and Mathematical Sciences, 1991 In this paper we prove that if the nodes of an arbitrary n-node binary search tree T are splayed in the preorder sequence of T then the total time is O(n). This is a special case of the splay tree traversal conjecture of Sleator and Tarjan.
R. Chaudhuri, H. Höft
doaj +1 more source
A Type of Energy-Balanced Tree Based Data Collection Strategy for Sensor Network With Mobile Sink
IEEE Access, 2019 In order to improve the sensing efficiency of the sensor network, a type of energy-balanced tree-based data collection strategy with mobile Sink (ETDC) is proposed.
Chao Sha +4 more
doaj +1 more source
Mixed Path HMC Sampling Methods for Molecular Tree Spaces [PDF]
Jisuanji kexue, 2023 With the increasing abundance of modern molecular sequence data and the dramatic expansion of the tree-like topological space describing historical relationships between species,reliable inference of phylogenetic trees continues to face enormous ...
LI Xiaopeng, LING Cheng, GAO Jingyang
doaj +1 more source