@article{MAKHILLAJIT201615116157,
    title = {An Optimal Algorithm for Range Search on Multidimensional Points},
    journal = {Asian Journal of Information Technology},
    volume = {15},
    number = {11},
    pages = {1723-1730},
    year = {2016},
    issn = {1682-3915},
    doi = {ajit.2016.1723.1730},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2016.1723.1730},
    author = {K.S. and},
    keywords = {time,BITS kd-tree,threaded trie,range search,algorithm},
    abstract = {This study proposes an efficient and novel method to address range search on multidimensional points in &#952;(t) time where t is the number of points reported in &real;<SUP>k</SUP> space. This is accomplished by introducing a new data structure, called BITS kd-tree. This structure also supports fast updation that takes &#952;(1) time for insertion and O(log n) time for deletion. The earlier best known algorithm for this problem is O(log<SUP>k</SUP>n+t) time in the pointer machine model.}
    }