Search results
Jump to navigation
Jump to search
Page title matches
- ...o the [[dynamic optimality]] problem on [[online algorithm]]s for [[binary search tree]]s involves reformulating the problem geometrically, in terms of augme |title=The geometry of binary search trees ...11 KB (1,751 words) - 19:27, 28 November 2023
Page text matches
- Key-independent optimality is a property of some [[binary search tree ]] data structures in [[computer science]] ...data structure. Key-independent optimality is related to [[Optimal binary search tree|dynamic optimality]]. ...2 KB (329 words) - 13:53, 30 September 2019
- {{About|rooted trees with three children per node|unrooted trees with three neighbors per node|unrooted binary tree}} Ternary trees are used to implement [[Ternary search tree]]s and [[Ternary heap]]s. ...7 KB (1,118 words) - 21:41, 19 July 2023
- ! Search [[File:Working Set DS.svg|thumbnail|An example of a search for <math>x</math> in the working set structure. After finding <math>x</mat ...8 KB (1,469 words) - 03:00, 21 March 2021
- [[File:Performing finger searches on treaps.svg|right|thumb|Example of finger search on treaps.]] ...ressed as a function of the number of elements in a data structure, finger search times are a function of the distance between the element and the finger. ...8 KB (1,402 words) - 07:23, 7 April 2023
- ...ering of the children of each vertex. In a random recursive tree, all such trees are equally likely. {{harvtxt|Zhang|2015}} lists several applications of random recursive trees in modeling phenomena including disease spreading, [[pyramid scheme]]s, the ...3 KB (506 words) - 15:15, 9 January 2024
- {{Short description|Trees with additional directed half edges}} ...print= 1305.1312v3|title= Generic method for bijections between blossoming trees and planar maps|date=2015|class= math.CO}}</ref> ...5 KB (757 words) - 16:22, 6 November 2024
- ...]], is a method in [[graph theory]] for representing [[tree (graph theory)|trees]]. The tree is viewed as a [[directed graph]] that contains two directed e ...takes to sort ''n'' items in parallel) if the tree has ''n'' nodes, as in trees the number of edges is one less than the number of nodes. ...6 KB (1,012 words) - 07:56, 2 November 2024
- ...–black tree]]s, which all fall into a common framework of '''rank balanced trees'''. ...''n'')}} per operation.<ref name="gt">{{citation|contribution=4.4 Weak AVL Trees|pages=130–138|title=Algorithm Design and Applications|first1=Michael T.|las ...20 KB (3,475 words) - 21:35, 25 May 2024
- ...o the [[dynamic optimality]] problem on [[online algorithm]]s for [[binary search tree]]s involves reformulating the problem geometrically, in terms of augme |title=The geometry of binary search trees ...11 KB (1,751 words) - 19:27, 28 November 2023
- ...e-Carlo]] variants (see [[Rapidly exploring random tree]]). Space-filling trees have interesting parallels in nature, including [[fluid distribution system ...a 2009 tech report <ref>Kuffner, J. J. and S. M. LaValle: ''Space-filling Trees'', The Robotics Institute, Carnegie Mellon University, CMU-RI-TR-09-47, 200 ...7 KB (990 words) - 20:16, 20 April 2024
- ...llard|title=Blasting through the information theoretic barrier with fusion trees|journal=[[Symposium on Theory of Computing]]|pages=1–7|date=1990}}</ref> ...=Thorup |first2=Mikkel |title=Dynamic ordered sets with exponential search trees |journal=Journal of the ACM |date=2007 |volume=54 |issue=3 |page=13 |doi=10 ...4 KB (597 words) - 15:41, 8 November 2024
- ...ithm''' is an efficient method for computers to construct [[optimal binary search tree]]s and [[Huffman coding|alphabetic Huffman codes]], in [[linearithmic] The goal of the problem is to find a tree, among all of the possible trees with <math>n</math> internal nodes, that minimizes the weighted sum of the ...9 KB (1,452 words) - 23:55, 30 November 2023
- ...ke it useful for a number of applications, most notably [[nearest neighbor search]]. ...distance computations, which usually yields faster queries. Furthermore, M-trees can better be stored [[Computer_data_storage#Secondary_storage|on disk]], w ...10 KB (1,500 words) - 18:07, 11 December 2023
- ...r. [[Data structures]] used to solve the problem include [[balanced binary search tree]]s, [[van Emde Boas tree]]s, and [[fusion tree]]s. In the '''static pr The predecessor problem is a simple case of the [[nearest neighbor search|nearest neighbor]] problem, and data structures that solve it have applicat ...8 KB (1,147 words) - 14:15, 23 October 2024
- ...rtain user-specified level, where "support" is calculated as the number of trees in a database which have at least one subtree [[Graph isomorphism|isomorphi ...ding all trees <math>\mathcal{P}\subset\mathcal{C}</math> such that no two trees in <math>\mathcal{P}</math> are isomorphic and ...11 KB (1,846 words) - 18:47, 9 March 2024
- ...esigning highly-parallelized algorithms for various balanced binary search trees. The algorithmic framework is based on a single operation ''join''.<ref nam ...r, if the trees are [[search tree]]s, which means that the in-order of the trees maintain a [[total ordering]] on keys, it must satisfy the condition that a ...19 KB (2,971 words) - 09:24, 18 April 2024
- ...string), and finding and counting all distinct sub-palindromes. Palindrome trees do this in an [[Online algorithm|online]] manner, that is it does not requi .... Since each edge adds (or removes) an even number of characters, the two trees are only ever connected by suffix edges. ...8 KB (1,234 words) - 13:53, 8 August 2024
- {{Short description|Generalization of depth-first search trees}} .../math> is a type of [[spanning tree]], generalizing [[depth-first search]] trees. ...17 KB (2,572 words) - 10:30, 12 October 2024
- ...the values ''and'' update the values. It also supports an efficient rank-search operation for finding the longest prefix whose sum is no more than a specif ...) to update but requires <math>O(n)</math> time to compute a prefix sum or search for a prefix length. ...15 KB (2,430 words) - 09:25, 2 January 2025
- ...h provides the smallest possible search time (or [[Expected value|expected search time]]) for a given sequence of accesses (or access probabilities). Optimal ...cular layout of the nodes of the tree which provides the smallest expected search time for the given access probabilities. Various algorithms exist to constr ...19 KB (2,986 words) - 18:19, 6 May 2024