
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
V.K. Vaishnavi, "Multidimensional Balanced Binary Trees," IEEE Transactions on Computers, vol. 38, no. 7, pp. 968985, July, 1989.  
BibTex  x  
@article{ 10.1109/12.30849, author = {V.K. Vaishnavi}, title = {Multidimensional Balanced Binary Trees}, journal ={IEEE Transactions on Computers}, volume = {38}, number = {7}, issn = {00189340}, year = {1989}, pages = {968985}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.30849}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Multidimensional Balanced Binary Trees IS  7 SN  00189340 SP968 EP985 EPD  968985 A1  V.K. Vaishnavi, PY  1989 KW  balanced multidimensional tree structure; kdimensional balanced binary tree; positive integer; data structure; access; insertion; deletion; data structures; trees (mathematics). VL  38 JA  IEEE Transactions on Computers ER   
[1] R. Bayer, "Symmetric binary Btrees: Data structure and maintenance algorithms,"Acta Informatica, vol. 1, pp. 290306, 1972.
[2] S. W. Bent, D. D. Sleator, and R. E. Tarjan, "Biased search trees,"SIAM J. Comput., vol. 14, pp. 545568, 1985.
[3] J. L. Bentley and J. B. Saxe, "Algorithms on vector sets,"SIGACT News, vol. 11, pp. 3639, 1979.
[4] J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan, "Making data structures persistent," inProc. 28th Annu. Symp. Theory Comput., 1986, pp. 109120.
[5] J. Feigenbaum and R. E. Tarjan, "Two new kinds of biased search trees,"Bell Syst. Tech. J., vol. 62, pp. 31393158, 1983.
[6] R. H. Gueting and H. P. Kriegel, "Multidimensional Btrees: An efficient dynamic file structure for exact match queries," inProc. 10th GI Annu. Conf., Informatik Fachberichte. SpringerVerlag, 1980, pp. 375388.
[7] R. H. Gueting and H. P. Kriegel, "Dynamic kdimensional multiway search under timevarying frequencies," inProc. 5th GI Conf. Theoret. Comput. Sci., Lecture Notes in Computer Science, vol. 104, pp. 135145, 1981.
[8] K. Mehlhorn, "Dynamic binary search trees,"SIAM J. Comput., vol. 8, pp. 175198, 1979.
[9] H. Olive, "A new class of balanced search trees: Halfbalanced binary trees," Tech. Rep. 8002, Interstedelijke Industriele Hogeschool AntwerpenMechlen, Antwerp, 1980.
[10] R. E. Tarjan, "Updating a balanced search tree in 0(1) rotations,"Inform. Proc. Lett., vol. 16, pp. 253257, 1983.
[11] R. Endre Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.
[12] A. K. Tsakalidis, " An optimal implementation for localized search," Tech. Rep. A 84/06, Univ. of Sarlandes, West Germany, 1984.
[13] V. K. Vaishnavi, "Multidimensional heightbalanced trees,"IEEE Trans. Comput., vol. C33, pp. 334343, 1984.
[14] V. K. Vaishnavi, "On the height of multidimensional heightbalanced trees,"IEEE Trans. Comput., vol. C35, pp. 773780, 1986.
[15] V. K. Vaishnavi, "Weighted leaf AVLtrees,"SIAM J. Comput., vol. 16, pp. 503537, 1987.