R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762--772, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
On Boyer-Moore Preprocessing - Heikki Hyyro Department (2004) Self-citation (Boyer Moore) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. of the ACM, 20(10):762--772, 1977.
Efficient Evaluation of Parameterized Pattern Queries - Edric Du Mouza (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762--772, 1977.
Complexity Of Sequential Pattern Matching Algorithms - May Mireille Egnier (Correct)
No context found.
R. Boyer and J. Moore, A fast String Searching Algorithm, Comm. of the ACM, 20, 762-772, 1977.
Using CLIPS to Detect Network Intrusions - Pedro Alpio Paulo (2003) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762--772, Oct. 1977.
Efficient Evaluation of Parameterized Pattern Queries - Edric Du Mouza (2005) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762--772, 1977.
Benchmarking a High Performance Real-Time - Transaction Engine Design (Correct)
No context found.
Boyer R.S, Moore J.S, 1977, A fast string searching algorithm. Communications of the ACM. 20:762-772.
Suffix Arrays: What Are They Good for? - Puglisi, Smyth, al. (2006) (Correct)
No context found.
Boyer, R. S. & Moore, J. S. (1977), `A fast string searching algorithm', Communications of the ACM 20(10), 762--772.
Deterministic Memory-Efficient String Matching.. - Tuck, Sherwood.. (2004) (3 citations) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):761--772, 1977. 12
Basic Research in Computer Science - Fast Partial Evaluation (Correct)
No context found.
Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762--772, 1977.
On Bit-parallel Processing of Multi-byte Text - Hyyrö, Takaba, Shinohara, Takeda (2004) (Correct)
No context found.
Boyer, R. S., Moore, J. S.: A fast string searching algorithm. Communications of the ACM, 20(10):762--772, 1977.
On the Complexity of Determining the Period of a String - Czumaj, Gasieniec (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20:762--772, 1977.
Real-Time String Matching in Sublinear Space - Gasieniec, Kolpakov (Correct)
No context found.
R.S. Boyer, J.S. More, A Fast String Searching Algorithm, Communication of the ACM, 20(10), 1977, pp 762--772.
The Abstraction and Instantiation of String-Matching.. - Amtoft, Consel.. (2001) (2 citations) (Correct)
No context found.
Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
Character Cluster Based Thai Information Retrieval - Theeramunkong.. (2002) (Correct)
No context found.
Boyer, R. and Moore, S. A fast string searching algorithm. CACM, 1977, 20, pp. 762-772.
Deterministic Memory-Efficient String Matching.. - Tuck, Sherwood.. (3 citations) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):761--772, 1977. 12
xB: A Domain-Specific String Matching Algorithm for.. - Anagnostakis.. (Correct)
No context found.
R. Boyer and J. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762--772, October 1977.
Rotation Invariant Template Matching - Fredriksson (2001) (1 citation) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-772, 1977. 133
Simple, Fast, and Efficient Natural Language Adaptive.. - Brisaboa, Farina.. (Correct)
No context found.
R.S. Boyer and J.S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762--772, October 1977.
A network intrusion detection system on IXP1200 network.. - Bos, Huang (2004) (Correct)
No context found.
Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Commun. ACM, 20(10):762-- 772, 1977.
Deterministic Memory-Efficient String Matching.. - Tuck, Sherwood.. (2004) (3 citations) (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):761--772, 1977.
Pattern and Approximate-Pattern Matching for Program Compaction - Johnson, Mycroft (Correct)
No context found.
Boyer, R. S., and Moore, J. S. A fast string searching algorithm. Comm. ACM 20, 10 (October 1977), 762--772.
Alphabet Dependence in Parameterized Matching - Amir, Farach, Muthukrishnan (1993) (5 citations) (Correct)
No context found.
R.S. Boyer and J.S. Moore. A fast string searching algorithm. Comm. ACM, 20:762--772, 1977.
Automatic Extraction of Eort Metrics Data for a - Software Project In (2000) (Correct)
No context found.
Boyer R.S. and Moore J.S. A Fast String Searching Algorithm. In Communications of the ACM,20 (1997)
Reliable Identification of Bounded-length Viruses is NP-complete - Spinellis (2003) (3 citations) (Correct)
No context found.
R. S. Boyer and J. S. Moore, "A fast string searching algorithm," Communications of the ACM, vol. 20, no. 10, pp. 262--272, Oct. 1977.
Bit-parallel (δ,γ)-Matching and Suffix.. - Crochemore.. (Correct)
No context found.
R. S. Boyer and J. S. Moore. A fast string searching algorithm. Comm. ACM, 20(10):762--772, 1977.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC