| 期刊論文| 1. | Albus, J. S.(1975)。Data Storage in Cerebeller Model Articulation Controller (CMAC)。Journal of Dynamic Systems, Measurement, and Control，97(3)，228-233。   | | 2. | Aho, A. V.、Corasick, M. J.(1975)。Efficient String Matching: An Aid to Bibliographic Search。Communications of the ACM，18(6)，333-340。 | | 3. | Albus, J. S.(1975)。Data Storage in the Cerebellar Model Articulation Controller (CMAC)。Journal of Dynamic Systems, Measurement and Control，97(3)，228-233。 | | 4. | Boyer, R. S.、Moore, J. S.(1977)。A Fast String Searching Algorithm。Communications of the ACM，20(10)，761-772。 | | 5. | Colussi, L.、De Col, A.(1996)。A Time and Space Efficient Data Structure for String Searching on Large Texts。Information Processing Letters，58(5)，217-222。 | | 6. | Crauser, A.、Ferragina, P.(2002)。A Theoretical and Experimental Study on the Construction of Suffix Arrays in External Memory。Algorithmica，32(1)，1-35。 | | 7. | De Moura, E. S.、Navarro G.、Ziviani N.、Baeza-Yates R.(2000)。Fast and Flexible Word Searching on Compressed Text。ACM Transactions on Information Systems，18(2)，113-139。 | | 8. | Ellison, D.(1991)。On the Convergence of the Multidimensional Albus Perceptron。The International Journal of Robotics Research，10(4)，338-357。 | | 9. | Ferragina, P.、Grossi, R.(1999)。The String B-tree: A New Structure for String Search in External Memory and Its Applications。Journal of ACM，46(2)，236-280。 | | 10. | Grossi, R.、Vitter, J. S.(2005)。Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching。SIAM Journal on Computing，35(2)，378-407。 | | 11. | Knuth, Donald E.、Morris, James H. Jr.、Pratt, Vaughan R.(1977)。Fast Pattern Matching in Strings。SIAM Journal on Computing，6(2)，323-350。 | | 12. | Moffat, A.、Zobel, J.(1996)。Self-indexing Inverted Files for Fast Txt Retrieval。ACM Transactions on Information Systems，14(4)，349-379。 | | 13. | Manber, U.、Myers, E. W.(1993)。Suffix Arrays: A New Method for On-line String Searches。SIAM Journal on Computing，22(5)，935-948。 | | 14. | Vitter, J. S.(2001)。External Memory Algorithms and Data Structures: Dealing with Massive Data。ACM Computing Surveys，33(2)，209-271。 | | 15. | Ziviani, N.、De Moura, E.、Navarro, G.、Baeza-Yates, R.(2000)。Compression: A Key for Next-generation Text Retrieval Systems。IEEE Computer，33(11)，37-44。 | 會議論文| 1. | Abouelhoda, M. I.、Ohlebusch, E.、Hurtz, S.(2002)。Optimal Exact String Matching Based on Suffix Arrays。 | | 2. | Antonatos, S.、Anagnostakis K. G.、and Markatos E. P.(2004)。Generating Realistic Workloads for Network Intrusion Detection Systems。 | | 3. | Bellaachia, A.、Rassan, I.(2004)。AL, Speeding up String Matching over Compressed Text on Handheld Devices using Tagged Sub-optimal Code。 | | 4. | Bentley, J.、Sedgewick, R.(1997)。Fast Algorithms for Sorting and Searching Strings360-369。 | | 5. | Pigeon, S.、Bengio, Y.(1998)。A Memory-efficient Adaptive Huffman Coding Algoritm for Very Large Sets of Symbols。 | | 6. | Tuck, N.、Sherwood T.、Calder B.、Varghese G.(2004)。Deterministic Memory-efficient String Matching Algorithms for Intrusion Detection。Hong Kong, China。 | 圖書| 1. | Lee, R. C. T.、Chang, R. C.、Tseng, S. S.、Tsai, Y. T.(1992)。Introduction to the Design and Analysis of Algorithms。Introduction to the Design and Analysis of Algorithms。 | |