Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

Optimal superprimitivity testing for strings

Author
APOSTOLICO, A; FARACH, M; ILIOPOULOS, C. S
Purdue univ., dep. computer sci., West Lafayette IN 47907, United States
Source

Information processing letters. 1991, Vol 39, Num 1, pp 17-20 ; ref : 5 ref

CODEN
IFPLAT
ISSN
0020-0190
Scientific domain
Computer science
Publisher
Elsevier Science, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Algorithmique Analyse algorithme Informatique théorique Mot Problème combinatoire Périodicité Quasipériodicité Superprimitivité
Keyword (en)
Algorithmics Algorithm analysis Computer theory Word Combinatory problem Periodicity
Keyword (es)
Algorítmica Análisis algoritmo Informática teórica Palabra Problema combinatorio Periodicidad
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
4996337

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

Access to the document

Searching the Web