Author:
Radhakrishnan Jaikumar,Raman Venkatesh,Srinivasa Rao S.
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. A. Brodnik and J. I. Munro, “Membership in constant time and almost minimum space”, SIAM Journal on Computing, 28(5), 1628–1640 (1999).
2. H. Buhrman, P. B. Miltersen, J. Radhakrishnan and S. Venkatesh, “Are Bitvectors Optimal?”, Proceedings of Symposium on Theory of Computing (2000) 449–458.
3. E. D. Demaine, J. I. Munro, V. Raman and S. S. Rao, “Beating Bitvectors with Oblivious Bitprobes”, I.M.Sc. Technical Report (2001).
4. M. L. Fredman, J. Komlós and E. Szemerédi, “Storing a sparse table with O(1) access time”, Journal of the Association for Computing Machinery, 31 (1984) 538–544.
5. Lect Notes Comput Sci;R. Pagh,1999
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献