Hash array mapped trie - PDFSEARCH.IO - Document Search Engine

Hash array mapped trie
Results: 4

#	Item
1	QP tries are smaller and faster than crit-bit trees Tony Finch University of Cambridge Add to Reading List Source URL: tinytocs.ece.utexas.edu Language: English - Date: 2016-03-05 17:06:25 Hashing Computer programming Information science Information retrieval Finite automata Trie Associative arrays Radix tree Hash tree Search algorithms Hash array mapped trie Hamming weight
2	Ideal Hash Trees Phil Bagwell Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash tr Add to Reading List Source URL: lampwww.epfl.ch Language: English - Date: 2001-10-05 03:05:47 Information science Artificial intelligence Hash table Trie Hash function Hash array mapped trie Cryptographic hash function Perfect hash function Universal hashing Hashing Search algorithms Information retrieval
3	PDF Document Add to Reading List Source URL: infoscience.epfl.ch Language: English - Date: 2011-07-09 03:31:58 Information science Artificial intelligence Hash table Trie Hash function Hash array mapped trie Cryptographic hash function Perfect hash function Universal hashing Hashing Search algorithms Information retrieval
4	PDF Document Add to Reading List Source URL: infoscience.epfl.ch Language: English - Date: 2011-07-09 03:57:21 Computer programming Data management Ctrie Search algorithms Error detection and correction Binary trees Hash array mapped trie Trie Hash table Hashing Associative arrays Computing