Author:
Kashyop Manas Jyoti,Narayanaswamy N. S.
Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. Allan Borodin and Ran El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
2. Andrew Chi-Chih Yao, Should tables be sorted?, Journal of the ACM, Vol.28, Issue 3, pp.615–628, 1981.
3. Michael L. Fredman and Michael E. Saks, The cell probe complexity of dynamic data structures, In David S. Johnson, editor, Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp.345–354, ACM, 1989.
4. Mihai Patrascu and Erik D. Demaine, Logarithmic lower bounds in the cell-probe model, SIAM J. Comput., Vol.35, No.4, pp.932–963, 2006.
5. Peter Bro Miltersen. Cell probe complexity: A survey, In In 19th Conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Advances in Data Structures Workshop, 1999.