Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

A note on the height of suffix trees

Author
DEVROYE, L; SZPANKOWSKI, W; RAIS, B
McGill univ., school computer sci., Montreal PQ H3A 2K6, Canada
Source

SIAM journal on computing (Print). 1992, Vol 21, Num 1, pp 48-53 ; ref : 34 ref

ISSN
0097-5397
Scientific domain
Computer science; Mathematics
Publisher
Society for Industrial and Applied Mathematics, Philadelphia, PA
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Anneau Classe complexité Code algébrique Cryptographie Génie logiciel Permutation Ramification Système informatique
Keyword (en)
Ring Complexity class Algebraic code Cryptography Software engineering Permutation Branching Computer system
Keyword (es)
Anillo Clase complejidad Código algebraico Criptografía Ingeniería logiciel Permutación Ramificación Sistema informático
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B09 Software engineering

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

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