Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Estructura arborescente")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2290

  • Page / 92
Export

Selection :

  • and

Resolution on formula-treesSCHMERL, U. R.Acta informatica. 1988, Vol 25, Num 4, pp 425-438, issn 0001-5903Article

Modularity in genetic ProgrammingWOODWARD, John R.Lecture notes in computer science. 2003, pp 254-263, issn 0302-9743, isbn 3-540-00971-X, 10 p.Conference Paper

Tree pattern matching with a more general notion of occurrence of the patternCHAUVE, Cedric.Information processing letters. 2002, Vol 82, Num 4, pp 197-201, issn 0020-0190Article

Cryptanalysis of tree-structured ciphersMILLAN, W; DAWSON, E. P; O'CONNOR, L. J et al.Electronics Letters. 1994, Vol 30, Num 12, pp 941-942, issn 0013-5194Article

Dynamic analysis of «tree-like» structures undergoing large motions ― a finite segment approachAMIROUCHE, M. L.Engineering analysis. 1986, Vol 3, Num 2, pp 111-117, issn 0264-682XArticle

A time and space efficient data structure for string searching on large textsCOLUSSI, L; DE COL, A.Information processing letters. 1996, Vol 58, Num 5, pp 217-222, issn 0020-0190Article

Transfert de données arborescentes dans une architecture distribuée pour Centaur (environnement de programmation pour ASN.1) = Tree transfer in a distributed architecture for Centaur - An ASN.1 programming environment (evolution of the distributed architecture of Centaur : propositions)Dery, A.M.1993, 111 p.Report

Throughput analysis of reservation protocols with tree-type reservation channelOIE, Y; MURO, S; HASEGAWA, T et al.Systems and computers in Japan. 1987, Vol 18, Num 3, pp 79-91, issn 0882-1666Article

Generating new designs using union operationsSHI, Y; YU, P.-L; ZHANG, D et al.Computers & mathematics with applications (1987). 1994, Vol 27, Num 12, pp 105-117, issn 0898-1221Article

Vectorization of tree traversalsHERNQUIST, L.Journal of computational physics (Print). 1990, Vol 87, Num 1, pp 137-147, issn 0021-9991Article

Applications of Fodor's lemma to Vaught's conjectureHOWARD, M.Annals of pure and applied logic. 1989, Vol 42, Num 1, pp 1-19, issn 0168-0072Article

Cryptanalysis of tree-structured substitution-permutation networksHEYS, H. M; TAVARES, S. E.Electronics Letters. 1993, Vol 29, Num 1, pp 40-41, issn 0013-5194Article

Nested network method for robot controlCATRINA, S.Revue roumaine des sciences techniques. Electrotechnique et énergétique. 1993, Vol 38, Num 3, pp 421-428, issn 0035-4066Article

Quelques propriétés algorithmiques des treillis = Some algorithmic properties of latticesNourine, Lhouari; Habib, Michel.1993, 105 p.Thesis

Some model theory for generalized treesBASARAD, S. A.Journal of pure and applied algebra. 1989, Vol 57, Num 2, pp 109-125, issn 0022-4049Article

Belordre des série-parallèles dénombrables = Well-quasi-ordering of countable serie-parallel ordersTHOMASSE, S.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1993, Vol 317, Num 10, pp 909-912, issn 0764-4442Article

O(1) space complexity deletion for AVL treesLIN CHEN.Information processing letters. 1986, Vol 22, Num 3, pp 147-149, issn 0020-0190Article

Nonblocking supervisory control of state tree structuresMa, Juan; Wonham, W. Murray.Lecture notes in control and information sciences. 2005, issn 0170-8643, isbn 3-540-25069-7, 1Vol, XIII-184 p, isbn 3-540-25069-7Book

An algorithm for term conflation based on tree structuresDIAZ, Irene; MORATO, Jorge; LLORENS, Juan et al.Journal of the American Society for Information Science and Technology (Print). 2002, Vol 53, Num 3, pp 199-208, issn 1532-2882Article

Supercompact cardinals, sets of reals, and weakly homogeneous treesWOODIN, W. H.Proceedings of the National Academy of Sciences of the United States of America. 1988, Vol 85, Num 18, pp 6587-6591, issn 0027-8424Article

A differential cryptanalysis of tree-structured substitution-permutation networksO'CONNOR, L.IEEE transactions on computers. 1995, Vol 44, Num 9, pp 1150-1152, issn 0018-9340Article

New results on the size of triesREGNIER, M; JACQUET, P.IEEE transactions on information theory. 1989, Vol 35, Num 1, pp 203-205, issn 0018-9448, 3 p.Article

The effect of tree structure on search in a hierarchical menu selection systemNORMAN, K. L; CHIN, J. P.Behaviour & information technology (Print). 1988, Vol 7, Num 1, pp 51-65, issn 0144-929XArticle

On the Fiedler vectors of graphs that arise from trees by Schur complementation of the LaplacianSTONE, Eric A; GRIFFING, Alexander R.Linear algebra and its applications. 2009, Vol 431, Num 10, pp 1869-1880, issn 0024-3795, 12 p.Article

Approximating Tree Edit Distance Through String Edit DistanceAKUTSU, Tatsuya; FUKAGAWA, Daiji; TAKASU, Atsuhiro et al.Lecture notes in computer science. 2006, pp 90-99, issn 0302-9743, isbn 3-540-49694-7, 1Vol, 10 p.Conference Paper

  • Page / 92