论文信息 - Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms - 字舞流文

Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms

Zvi Galil | Z. Galil

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] M. Fischer,et al. STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[3] Stephen A. Cook,et al. Linear Time Simulation of Deterministic Two-Way Pushdown Automata , 1971, IFIP Congress.

[4] Glenn K. Manacher,et al. A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String , 1975, JACM.

[5] Michael J. Fischer,et al. Fast on-line integer multiplication , 1973, STOC '73.

[6] Leslie G. Valiant,et al. On time versus space and related problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).