The combinatorics of certain -ary meta-Fibonacci sequences.
Ruskey, Frank, Deugau, Chris (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Displaying similar documents to “Meta-Fibonacci sequences, binary trees and extremal compact codes.”
The combinatorics of certain -ary meta-Fibonacci sequences.
Splaying a search tree in preorder takes linear time.
Chaudhuri, R., Höft, H. (1991)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A new class of balanced search trees : half-balanced binary search tress
H. J. Olivié (1982)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Binary trees, fringe thickness and minimum path length
Helen Cameron, Derick Wood (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Trees and meta-Fibonacci sequences.
Isgur, Abraham, Reiss, David, Tanny, Stephen (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the distribution of depths in increasing trees.
Kuba, Markus, Wagner, Stephan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Probabilistic proofs of hook length formulas involving trees.
Sagan, Bruce E. (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Multidimensional term indexing for efficient processing of complex queries
Michal Krátký, Tomáš Skopal, Václav Snášel (2004)
Kybernetika
Similarity:
The area of Information Retrieval deals with problems of storage and retrieval within a huge collection of text documents. In IR models, the semantics of a document is usually characterized using a set of terms. A common need to various IR models is an efficient term retrieval provided via a term index. Existing approaches of term indexing, e. g. the inverted list, support efficiently only simple queries asking for a term occurrence. In practice, we would like to exploit some more sophisticated...