אלגוריתם בויאר-מור (Hebrew Wikipedia)

Analysis of information sources in references of the Wikipedia article "אלגוריתם בויאר-מור" in Hebrew language version.

refsWebsite

Global rank Hebrew rank

1,185^th place

636^th place

2^nd place

10^th place

5^th place

31^st place

207^th place

644^th place

5,469^th place

8,233^rd place

acm.org

Boyer, Robert S.; Moore, J Strother (באוקטובר 1977). "A Fast String Searching Algorithm". Comm. ACM. New York, NY, USA: Association for Computing Machinery. 20 (10): 762–772. doi:10.1145/359842.359859. ISSN 0001-0782. {{cite journal}}: (עזרה)
Galil, Z. (בספטמבר 1979). "On improving the worst case running time of the Boyer-Moore string matching algorithm". Comm. ACM. New York, NY, USA: Association for Computing Machinery. 22 (9): 505–508. doi:10.1145/359146.359148. ISSN 0001-0782. {{cite journal}}: (עזרה)
Guibas, Odlyzko; 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. Washington, DC, USA: IEEE Computer Society: 189–195. doi:10.1109/SFCS.1977.3.
Cole, Richard (בספטמבר 1991). "Tight bounds on the complexity of the Boyer-Moore string matching algorithm". Proceedings of the 2nd annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics: 224–233. ISBN 0-89791-376-0. {{cite journal}}: (עזרה)

Boyer, Robert S.; Moore, J Strother (באוקטובר 1977). "A Fast String Searching Algorithm". Comm. ACM. New York, NY, USA: Association for Computing Machinery. 20 (10): 762–772. doi:10.1145/359842.359859. ISSN 0001-0782. {{cite journal}}: (עזרה)
Galil, Z. (בספטמבר 1979). "On improving the worst case running time of the Boyer-Moore string matching algorithm". Comm. ACM. New York, NY, USA: Association for Computing Machinery. 22 (9): 505–508. doi:10.1145/359146.359148. ISSN 0001-0782. {{cite journal}}: (עזרה)
Knuth, Donald; Morris, James H.; Pratt, Vaughan (1977). "Fast pattern matching in strings". SIAM Journal on Computing. 6 (2): 323–350. doi:10.1137/0206024.
Guibas, Odlyzko; 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. Washington, DC, USA: IEEE Computer Society: 189–195. doi:10.1109/SFCS.1977.3.

Boyer, Robert S.; Moore, J Strother (באוקטובר 1977). "A Fast String Searching Algorithm". Comm. ACM. New York, NY, USA: Association for Computing Machinery. 20 (10): 762–772. doi:10.1145/359842.359859. ISSN 0001-0782. {{cite journal}}: (עזרה)
Galil, Z. (בספטמבר 1979). "On improving the worst case running time of the Boyer-Moore string matching algorithm". Comm. ACM. New York, NY, USA: Association for Computing Machinery. 22 (9): 505–508. doi:10.1145/359146.359148. ISSN 0001-0782. {{cite journal}}: (עזרה)