Pascal and Francis Bibliographic Databases

Help

Permanent link : http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=PASCAL7830445536

Export

Selection :

ON IMPROVING THE WORST CASE RUNNING TIME OF THE BOYER-MOORE STRING MATCHING ALGORITHM.

Author
GALIL Z
DEP. MATH. SCI., COMPUT. SCI. DIV., TEL-AVIV UNIV., TEL-AVIV, ISR.
Source
LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 241-250; BIBL. 7 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)
Document type
Conference Paper
Language
English
Keyword (fr)
TEMPS EXECUTION ALGORITHME RECHERCHE INFORMATION RECONNAISSANCE FORME TRAITEMENT INFORMATION TEMPS LINEAIRE ALGORITHME BOYER-MOORE MATHEMATIQUES APPLIQUEES
Keyword (en)
EXECUTION TIME ALGORITHMS INFORMATION RETRIEVAL PATTERN RECOGNITION INFORMATION PROCESSING APPLIED MATHEMATICS
Keyword (es)
MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL7830445536

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web