The nearly optimal n-ary search tree
Author(s) -
Dominic J. Catalano
Publication year - 2016
Language(s) - English
Resource type - Dissertations/theses
DOI - 10.17760/d20253673
Subject(s) - computer science , tree (set theory) , data mining , search tree , variance (accounting) , search engine indexing , key (lock) , search algorithm , information retrieval , algorithm , mathematics , mathematical analysis , business , accounting , computer security
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom