Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"Binary Trees"”.
-
Visualizing graphs with distinguishable edges and ordered binary trees in small area
… straight-line order-preserving grid drawings of binary trees is presented in a novel algorithm using a separations approach. The new bounds are optimal in area and aspect ratio, where the optimum values are linear and 1:1 respectively. All three topics present novel contributions to graph and …
-
Investigating the Symmetry of the q,t-Catalan Polynomials Using New Statistics on Plane Binary Trees, Triangulations of Convex Polygons, and Paired Lattice Paths
… look at three other combinatorial objects: plane binary trees, triangulations of convex polygons, and paired lattice paths; all of which are counted by the Catalan numbers. New statistics will be introduced on these objects in hopes of developing a combinatorial reason for the symmetry of the …
-
Arborescent numbers : higher arithmetic operations and division trees
… real numbers (R+) beginning with (specific) binary trees instead of natural numbers. N can be regarded as the associative binary trees. The binary trees B and the left-commutative binary trees P allow the hassle-free definition of arbitrary high arithmetic operations (hyper ... hyperpowers). …
-
Improving search times when resolving external symbols in the Timeliner System
… system. The GDB was implemented as a group of binary trees. However, search times to resolve external symbols in the trees do not scale well as the number of symbols increases. By replacing the binary trees with hash tables, time to resolve symbols is significantly reduced.
-
Painted Trees and Pterahedra
… the convex hull of coordinates derived from binary trees. Similarly, permutahedra can be found using leveled trees. In this paper we will introduce a new type of painted tree, (T ◦ Y)<sub><i>n</i></sub> where <i>n</i> is the number of interior nodes. We create these painted trees by composing …
-
A data structure for interactive graphic manipulation of logic diagrams
… system. The use of sequential list, hashing, binary tree, and linked list data structures are evaluated, and the data structure is formulated, which includes a combination of linked lists, binary trees, and sequential lists. An illustrative example is presented, along with recommendations for …
-
Pattern avoidance for alternating permutations and reading words of tableaux
… bijections include a simple bijection involving binary trees, variations on the Robinson-Schensted-Knuth correspondence, and recursive bijections established via isomorphisms of generating trees.
-
Efficient classical simulation of spin networks
… are unknown. The dynamics of Cayley trees (three binary trees connected at the root) at zero temperature are unknown. The running time of the adiabatic evolution of Cayley trees could provide an insight into the dynamics of more complicated spin networks. Matrix Product States (MPS) …
-
Interactive visualization of information hierarchies and applications on the web
… drawings is to automatically produce drawings of trees which clearly reflect the relationships of the information hierarchy.</p> <p>This thesis is primarily concerned with problems related to the automatic generation of area-efficient grid drawings of trees, interactively visualizing information …
-
Complexity, Emergence, and Self-Similar Organization in River Networks
… I also investigate the connectivity structure of binary trees which enables ubiquitous characteristics, such as self-similar topology, observed in river networks as well as other diverse tree networks. To understand these phenomena, I investigate the role and interaction of variabilities of …
-
Enhancing Learning of Recursion
… in CS2 courses. The advanced recursion in binary trees tutorial (BTRecurTutor) covers advanced recursion techniques most often encountered post CS2. It provides detailed feedback on the students' programming exercise answers by performing semantic code analysis on the student's code. …
-
Multiscale models of the metalorganic vapor phase epitaxy process
… epitaxial growth. Computational methods, such as binary trees, are used to improve the computational efficiency of the KMC algorithm. To extend the computationally accessible length and time scales, a new parallel algorithm is developed based on ideas from Parallel Discrete Event Simulations …
-
Diversity and evolution of ecosystems: From genomes to the biosphere
… the genome, and the development of phylogenetic trees in evolution. The unifying theme is the interplay between ecology and evolution, expressed within an ecosystem, within genomes, and over the evolutionary history of life. Part I concerns biodiversity on the ecological scale. I study the “Kill …
-
Analytic and Numerical aspects of isospectral flows
… and the terms of expansion are represented as binary rooted trees deducing an explicit formalism to construct the trees recursively. Unlike classical numerical methods, e.g.\ Runge--Kutta and multistep methods, Magnus expansion respects the isospectrality of the system, and the shorthand of …