Author:
Hon Wing-Kai,Sadakane Kunihiko,Sung Wing-Kin
Subject
General Computer Science,Theoretical Computer Science
Reference26 articles.
1. Optimal bounds for the predecessor problem and related problems;Beame;Journal of Computer and System Sciences,2002
2. A. Brodnik, S. Carlsson, E.D. Demaine, J.I. Munro, R. Sedgewick, Resizable arrays in optimal time and space, in: Proceedings of Workshop on Algorithms and Data Structures, 1999, pp. 37–48.
3. A. Brodnik, J. Karlsson, J.I. Munro, A. Nilsson, An O(1) solution to the prefix sum problem on a specialized memory architecture, in: IFIP International Conference on Theoretical Computer Science, 2006, pp. 103–114.
4. Membership in constant time and almost minimum space;Brodnik;SIAM Journal on Computing,1999
5. D.R. Clark, Compact Pat Trees, Ph.D. Thesis, University of Waterloo, 1996.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献