A VLSI system for string matching

Bertossi, 1987, A VLSI implementation of the simplex algorithm, IEEE Trans. Computers, C-36, 241, 10.1109/TC.1987.1676889 Bertossi, 1989, A gracefully degradable VLSI system for linear programming, IEEE Trans. Computers, C-38, 853, 10.1109/12.24294 Bilardi, 1985, A minimum area VLSI network for O(log n) time sorting, IEEE Trans. Computers, C-34, 336, 10.1109/TC.1985.5009384 Knuth, 1977, Fast pattern matching in strings, SIAM. J. Computing, 6, 322, 10.1137/0206024 Lipton, R.J. and R. Sedgewick, Lower bounds for VLSI, Proc. 13th ACM Symp. on Theory of Computing, 300–307. Nath, 1983, Efficient VLSI networks for parallel processing based on orthogonal trees, IEEE Trans. Computers, C-32, 569, 10.1109/TC.1983.1676279 Ottman, 1982, A dictionary machine (for VLSI), IEEE Trans. Computers, C-31, 892, 10.1109/TC.1982.1676104 Preparata, 1980, Area-time optimal VLSI networks for multiplying matrices, 11, 77 Preparata, 1981, Area-time optimal VLSI networks for computing integer multiplication and discrete Fourier transform, 29 1983 Somani, 1985, An efficient unsorted VLSI dictionary machine, IEEE Trans. Computers, C-34, 841, 10.1109/TC.1985.1676640 Thompson, 1983, The VLSI complexity of sorting, IEEE Trans. Computers, C-32, 1171, 10.1109/TC.1983.1676178 Ullman, 1984