Selected papers that cite this one
- Moshe Dubiner, Zvi Galil, and Edith Magen. Faster tree pattern matching. Journal of the ACM, 41(2):205-213, March 1994.
- Manuel Fähndrich and John Boyland. Statically checkable pattern abstractions. In Proceedings of the 1997 ACM SIGPLAN International Conference on Functional Programming, pages 75-84, Amsterdam, The Netherlands, 9-11 June 1997.
- Paolo Ferragina. Dynamic text indexing under string updates. Journal of Algorithms, 22(2):296-328, February 1997.
- James Jianghai Fu. Directed graph pattern matching and topological embedding. Journal of Algorithms, 22(2):372-391, February 1997.
- Piotr Indyk. Deterministic superimposed coding with applications to pattern matching. In 38th Annual Symposium on Foundations of Computer Science, pages 127-136, Miami Beach, Florida, 20-22 October 1997. IEEE.
- Pekka Kilpeläinen and Heikki Mannila. Ordered and unordered tree inclusion. SIAM Journal on Computing, 24(2):340-356, April 1995.
- Fabrizio Luccio and Linda Pagli. Approximate matching for two families of trees. Information and Computation, 123(1):111-120, 15 November 1995.
- S. Muthukrishnan and K. Palem. Non-standard stringology: Algorithms and complexity. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 770-779, Montréal, Québec, Canada, 23-25 May 1994.
- R. Ramesh and I. V. Ramakrishnan. Nonlinear pattern matching in trees. Journal of the ACM, 39(2):295-316, April 1992.
- R. C. Sekar, R. Ramesh, and I. V. Ramakrishnan. Adaptive pattern matching. SIAM Journal on Computing, 24(6):1207-1234, December 1995.
- Jean-Marc Steyaert and Philippe Flajolet. Patterns and pattern-matching in trees: An analysis. Information and Control, 58(1-3):19-58, July/August/September 1983.
- Mikkel Thorup. Efficient preprocessing of simple binary pattern forests. Journal of Algorithms, 20(3):602-612, May 1996.
- Rakesh M. Verma. A theory of using history for equational systems with applications. Journal of the ACM, 42(5):984-1020, September 1995.