Boyer–Moore string-search algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Boyer–Moore string-search algorithm" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

4semanticscholar.org

11^th place

8^th place

4worldcat.org

5^th place

2acm.org

1,185^th place

840^th place

2psu.edu

207^th place

136^th place

1stackoverflow.com

4,643^rd place

2,973^rd place

1creativecommons.org

1,010^th place

612^th place

1purdue.edu

850^th place

625^th place

1freebsd.org

5,469^th place

3,758^th place

acm.org

dl.acm.org

Guibas, Leonidas; Odlyzko, Andrew (1977). "A new proof of the linearity of the Boyer–Moore string searching algorithm". Proceedings of the 18th Annual Symposium on Foundations of Computer Science. SFCS '77. Washington, District of Columbia: IEEE Computer Society: 189–195. doi:10.1109/SFCS.1977.3. S2CID 6470193.
Cole, Richard (September 1991). "Tight bounds on the complexity of the Boyer–Moore string matching algorithm". Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms. Soda '91. Philadelphia, Pennsylvania: Society for Industrial and Applied Mathematics: 224–233. ISBN 0-89791-376-0.

creativecommons.org

"Constructing a Good Suffix Table - Understanding an example". Stack Overflow. 11 December 2014. Retrieved 30 July 2024. This article incorporates text from this source, which is available under the CC BY-SA 3.0 license.

doi.org

Hume, Andrew; Sunday, Daniel (November 1991). "Fast String Searching". Software: Practice and Experience. 21 (11): 1221–1248. doi:10.1002/spe.4380211105. S2CID 5902579.
Boyer, Robert S.; Moore, J Strother (October 1977). "A Fast String Searching Algorithm". Comm. ACM. 20 (10). New York: Association for Computing Machinery: 762–772. doi:10.1145/359842.359859. ISSN 0001-0782. S2CID 15892987.
Knuth, Donald E.; Morris, James H. Jr.; Pratt, Vaughan R. (1977). "Fast pattern matching in strings". SIAM Journal on Computing. 6 (2): 323–350. CiteSeerX 10.1.1.93.8147. doi:10.1137/0206024. ISSN 0097-5397.
Rytter, Wojciech (1980). "A Correct Preprocessing Algorithm for Boyer–Moore String-Searching". SIAM Journal on Computing. 9 (3): 509–512. doi:10.1137/0209037. ISSN 0097-5397.
Galil, Z. (September 1979). "On improving the worst case running time of the Boyer–Moore string matching algorithm". Comm. ACM. 22 (9). New York: Association for Computing Machinery: 505–508. doi:10.1145/359146.359148. ISSN 0001-0782. S2CID 1333465.
Apostolico, Alberto; Giancarlo, Raffaele (February 1986). "The Boyer–Moore–Galil String Searching Strategies Revisited". SIAM Journal on Computing. 15: 98–105. doi:10.1137/0215007.
Guibas, Leonidas; Odlyzko, Andrew (1977). "A new proof of the linearity of the Boyer–Moore string searching algorithm". Proceedings of the 18th Annual Symposium on Foundations of Computer Science. SFCS '77. Washington, District of Columbia: IEEE Computer Society: 189–195. doi:10.1109/SFCS.1977.3. S2CID 6470193.

freebsd.org

lists.freebsd.org

Haertel, Mike (21 August 2010). "why GNU grep is fast". FreeBSD-current mailing list archive.

psu.edu

citeseer.ist.psu.edu

Knuth, Donald E.; Morris, James H. Jr.; Pratt, Vaughan R. (1977). "Fast pattern matching in strings". SIAM Journal on Computing. 6 (2): 323–350. CiteSeerX 10.1.1.93.8147. doi:10.1137/0206024. ISSN 0097-5397.

citeseerx.ist.psu.edu

Knuth, Donald E.; Morris, James H. Jr.; Pratt, Vaughan R. (1977). "Fast pattern matching in strings". SIAM Journal on Computing. 6 (2): 323–350. CiteSeerX 10.1.1.93.8147. doi:10.1137/0206024. ISSN 0097-5397.

purdue.edu

docs.lib.purdue.edu

Apostolico, Alberto; Giancarlo, Raffaele (February 1986). "The Boyer–Moore–Galil String Searching Strategies Revisited". SIAM Journal on Computing. 15: 98–105. doi:10.1137/0215007.

semanticscholar.org

api.semanticscholar.org

Hume, Andrew; Sunday, Daniel (November 1991). "Fast String Searching". Software: Practice and Experience. 21 (11): 1221–1248. doi:10.1002/spe.4380211105. S2CID 5902579.
Boyer, Robert S.; Moore, J Strother (October 1977). "A Fast String Searching Algorithm". Comm. ACM. 20 (10). New York: Association for Computing Machinery: 762–772. doi:10.1145/359842.359859. ISSN 0001-0782. S2CID 15892987.
Galil, Z. (September 1979). "On improving the worst case running time of the Boyer–Moore string matching algorithm". Comm. ACM. 22 (9). New York: Association for Computing Machinery: 505–508. doi:10.1145/359146.359148. ISSN 0001-0782. S2CID 1333465.
Guibas, Leonidas; Odlyzko, Andrew (1977). "A new proof of the linearity of the Boyer–Moore string searching algorithm". Proceedings of the 18th Annual Symposium on Foundations of Computer Science. SFCS '77. Washington, District of Columbia: IEEE Computer Society: 189–195. doi:10.1109/SFCS.1977.3. S2CID 6470193.

stackoverflow.com

"Constructing a Good Suffix Table - Understanding an example". Stack Overflow. 11 December 2014. Retrieved 30 July 2024. This article incorporates text from this source, which is available under the CC BY-SA 3.0 license.

worldcat.org

search.worldcat.org

Boyer, Robert S.; Moore, J Strother (October 1977). "A Fast String Searching Algorithm". Comm. ACM. 20 (10). New York: Association for Computing Machinery: 762–772. doi:10.1145/359842.359859. ISSN 0001-0782. S2CID 15892987.
Knuth, Donald E.; Morris, James H. Jr.; Pratt, Vaughan R. (1977). "Fast pattern matching in strings". SIAM Journal on Computing. 6 (2): 323–350. CiteSeerX 10.1.1.93.8147. doi:10.1137/0206024. ISSN 0097-5397.
Rytter, Wojciech (1980). "A Correct Preprocessing Algorithm for Boyer–Moore String-Searching". SIAM Journal on Computing. 9 (3): 509–512. doi:10.1137/0209037. ISSN 0097-5397.
Galil, Z. (September 1979). "On improving the worst case running time of the Boyer–Moore string matching algorithm". Comm. ACM. 22 (9). New York: Association for Computing Machinery: 505–508. doi:10.1145/359146.359148. ISSN 0001-0782. S2CID 1333465.