Knuth–Morris–Pratt illustrated
-д хадгалсан:
| -д хэвлэсэн: | Journal of Functional Programming vol. 34 (Jan 2024) |
|---|---|
| Үндсэн зохиолч: | |
| Хэвлэсэн: |
Cambridge University Press
|
| Нөхцлүүд: | |
| Онлайн хандалт: | Citation/Abstract Full Text - PDF |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 2919835034 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 0956-7968 | ||
| 022 | |a 1469-7653 | ||
| 024 | 7 | |a 10.1017/S0956796824000017 |2 doi | |
| 035 | |a 2919835034 | ||
| 045 | 2 | |b d20240101 |b d20240131 | |
| 084 | |a 79046 |2 nlm | ||
| 100 | 1 | |a Moy, Cameron |u Northeastern University, Boston, MA 02115, USA ( e-mail: camoy@ccs.neu.edu ) | |
| 245 | 1 | |a Knuth–Morris–Pratt illustrated | |
| 260 | |b Cambridge University Press |c Jan 2024 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a The Knuth–Morris–Pratt (KMP) algorithm for string search is notoriously difficult to understand. Lost in a sea of index arithmetic, most explanations of KMP obscure its essence. This paper constructs KMP incrementally, using pictures to illustrate each step. The end result is easier to comprehend. Additionally, the derivation uses only elementary functional programming techniques. | |
| 653 | |a Algorithms | ||
| 653 | |a Candidates | ||
| 653 | |a Functional programming | ||
| 773 | 0 | |t Journal of Functional Programming |g vol. 34 (Jan 2024) | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/2919835034/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/2919835034/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |