In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries...

the O(n log M) space used by an x-fast trie. A y-fast trie consists of two data structures: the top half is an x-fast trie and the lower half consists of...

In computer science, a trie (/ˈtraɪ/, /ˈtriː/), also called digital tree or prefix tree, is a type of k-ary search tree, a tree data structure used for...

suffix array FM-index Generalised suffix tree B-tree Judy array Trie X-fast trie Y-fast trie Merkle tree Ternary search tree Ternary tree K-ary tree And–or...

bitwise trie is a special form of trie where each node with its child-branches represents a bit sequence of one or more bits of a key. A bitwise trie with...

with the x-fast trie, which requires O ( n log ⁡ U ) {\displaystyle O(n\log U)} space and the same query time, and the more complicated y-fast trie, which...

"Self-Adjusting Heaps". SIAM Journal on Computing. 15 (1): 52–69. CiteSeerX 10.1.1.93.6678. doi:10.1137/0215004. ISSN 0097-5397. Tarjan, Robert (1983)...

A concurrent hash-trie or Ctrie is a concurrent thread-safe lock-free implementation of a hash array mapped trie. It is used to implement the concurrent...

compressed trie containing all the suffixes of the given text as their keys and positions in the text as their values. Suffix trees allow particularly fast implementations...

early work on the order-maintenance problem, and invented the x-fast trie and y-fast trie, data structures for storing and searching sets of small integers...

org. Sinha, Ranjan; Zobel, Justin. "Efficient Trie-Based Sorting of Large Sets of Strings". CiteSeerX 10.1.1.12.2367. Retrieved 24 August 2023. R. Sedgewick...

the nodes at three levels of the trie structure, rather than storing the entire trie. Before building the Luleå trie, the routing table entries need to...

space on the board permits). Suffix Tree Trie Scrabble Prefix Hash Tree Gordon, Steven A. (1994). "A faster Scrabble move generation algorithm" (PDF)...

trie, the time for this algorithm (after the automaton has been constructed) is proportional to the number of nodes in the trie, significantly faster...

radix sort, but is faster due to being aware of caching and related radixes being stored closer to each other due to specifics of trie structure. It exploits...

possibility is to use only a fixed number of bits per level, which results in a trie. Alternatively, each array may be replaced by a hash table, reducing the...

"x" axis is chosen, all points in the subtree with a smaller "x" value than the node will appear in the left subtree and all points with a larger "x"...

Bead sort Bucket sort Burstsort: build a compact, cache efficient burst trie and then traverse it to create sorted output Counting sort Pigeonhole sort...

are centered around four cloisters—the Cuxa, Saint-Guilhem, Bonnefont and Trie—that were acquired by American sculptor and art dealer George Grey Barnard...

com/DesaultierMAKK/PersistentBST A persistent hash array mapped trie is a specialized variant of a hash array mapped trie that will preserve previous versions of itself...

computer and communication network topology Digital tree, prefix tree or trie, a computer science ordered tree data structure The Tree (1969 film), an...

B-tree bubble sort bucket bucket array bucketing method bucket sort bucket trie buddy system buddy tree build-heap Burrows–Wheeler transform (BWT) busy beaver...

Consistent hashing Distributed hash table Extendible hashing Hash array mapped trie Lazy deletion Pearson hashing PhotoDNA Rabin–Karp string search algorithm...

lookup. Built by storing the suffixes of words. The suffix tree is a type of trie. Tries support extendible hashing, which is important for search engine indexing...

programming portal Binary tree Blockchain Distributed hash table Hash table Hash trie Linked timestamping Radix tree Becker, Georg (2008-07-18). "Merkle Signature...

is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing...

Robert de Courtenay-Champignelles (10 April 1299 – 3 March 1324) Guillaume de Trie (1324–1334) Jean de Vienne (1335–1351) Hugues d'Arcy (1351–1352) Humbert...

(2001). "Construction of the CDAWG for a trie" (PDF). Prague Stringology Conference. Proceedings. pp. 37–48. CiteSeerX 10.1.1.24.2637. Inenaga, Shunsuke; Shinohara...

Pavle; Zhao, David; Scholz, Bernhard (2019-02-17). "Brie: A Specialized Trie for Concurrent Datalog". Proceedings of the 10th International Workshop on...

generated unions), represent the resulting family of sets in a trie, and use the trie representation to test certain candidate pairs of sets for adjacency...