Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02503048n
Noun Concept
Categories: Trees (data structures)
EN
y-fast trie
EN
In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. Wikipedia
Definitions
Relations
Sources
EN
In computer science, a y-fast trie is a data structure for storing integers from a bounded domain. Wikipedia
IS A
trie
STUDIED BY
graph theory
Wikipedia
EN
y-fast trie
Wikidata
EN
Y-fast trie

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License