Author:
Chen Kuan-Yu,Hsu Ping-Hui,Chao Kun-Mao
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Amir, A., Benson, G.: Efficient Two-Dimensional Compressed Matching. In: Data Compression Conference, pp. 279–288 (1992)
2. Apostolico, A., Landau, G.M., Skiena, S.: Matching for Run-Length Encoded Strings. Journal of Complexity 15(1), 4–16 (1999)
3. de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2008)
4. Bentley, J.L.: Solutions to Klee’s Rectangle Problems. Technical Report, Carnegie-Mellon University, Pittsburgh, PA (1977)
5. Lecture Notes in Computer Science;K.-Y. Chen,2010
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献