Author:
Munro J. Ian,Raman Rajeev,Raman Venkatesh,Rao Satti Srinivasa
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. D. A. Bader, M. Yan, B. M. W. Moret. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. University of New Mexico Technical Report HPCERC2001-005 (August 2001): http://www.hpcerc.unm.edu/Research/tr/HPCERC2001-005.pdf
2. A. Z. Broder, M. Charikar, A. M. Frieze and M. Mitzenmacher. Min-wise independent permutations. Journal of Computer System Sciences, 60 630–659 (2000).
3. E. D. Demaine and A. López-Ortiz. A linear lower bound on index size for text retrieval. Journal of Algorithms, to appear.
4. A. Fiat, J. I. Munro, M. Naor, A. A. Schäffer, J.P. Schmidt and A. Siegel. An implicit data structure for searching a multikey table in logarithmic time. Journal of Computer and System Sciences, 43 406–424 (1991).
5. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the ACM Symposium on Theory of Computing, 397–406, 2000.
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献