Author:
Aravindharamanan S.,Ramasubbareddy Somula,Govinda K.,Swetha E.
Reference7 articles.
1. Acar, U. A., Blelloch, G. E., Blume, M., Harper, R., & Tangwongsan, K. (2009). An experimental analysis of self-adjusting computation. ACM Transactions on Programming Languages and Systems (TOPLAS), 32(1), 3.
2. Sleator, D. D., & Tarjan, R. E. (1985). Self-adjusting binary search trees. Journal of the ACM (JACM), 32(3), 652–686.
3. Park, E., & Mount, D. M. (2012). A self-adjusting data structure for multidimensional point sets. In European Symposium on Algorithms (pp. 778–789). Berlin, Heidelberg: Springer.
4. Tarjan, R. E. (1985). Sequential access in splay trees takes linear time. Combinatorica, 5(4), 367–378.
5. Pramod Reddy, A., Ramasubbareddy, S., & Kannayaram, G. (2019). Prediction models for ozone gas estimation. Journal of Computational and Theoretical Nanoscience, 16(5–6), 2001–2005.