Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Structure 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 1660

  • Page / 67
Export

Selection :

  • and

Macro tree transducersENGELFRIET, J; VOGLER, H.Journal of computer and system sciences (Print). 1985, Vol 31, Num 1, pp 71-146, issn 0022-0000Article

Tree structures for orthogonal transforms and application to the Hadamard transformVETTERLI, M.Signal processing. 1983, Vol 5, Num 6, pp 473-484, issn 0165-1684Article

Patterns and pattern-matching in trees: an analysisSTEYAERT, J.-M; FLAJOLET, P.Information and control. 1983, Vol 58, Num 1-3, pp 19-58, issn 0019-9958Article

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

Comments on the optimal ordering of tree structuresMARTIN, A. F.Computers & structures. 1985, Vol 21, Num 4, issn 0045-7949, 859Article

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

Embedding tree structures in VLSI hexagonal arraysGORDON, D; KOREN, I; SILBERMAN, G. M et al.IEEE transactions on computers. 1984, Vol 33, Num 1, pp 104-107, issn 0018-9340Article

TEMPS DE RECHERCHE DANS LES ARBRES DE RECHERCHE A CRITERESKISELEV AV.1980; KIBERNETIKA; UKR; DA. 1980; NO 6; PP. 136-138; BIBL. 1 REF.Article

DEUX APPROCHES A LA CLASSIFICATION DE STRUCTURES ARBORESCENTESVIKTOROVA NP.1981; NAUCNO-TEH. INF.-VSES. INST. NAUCN. TEH. INF., SER. 2; ISSN 0548-0027; SUN; DA. 1981; NO 9; PP. 17-21; BIBL. 4 REF.Article

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

Technique for flexible multidimensional filter designJENKINS, D. A; PARKER, D. W.Electronics Letters. 1983, Vol 19, Num 25-26, pp 1088-1090, issn 0013-5194Article

A complexity calculus for recursive tree algorithmsFLAJOLET, Philippe; STEYAERT, Jean-Marc.Rapports de recherche - INRIA. 1983, Num 239, issn 0249-6399, 48 p.Report

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

On digraphs with a rooted tree structureSZWARCFITER, J. L.Networks (New York, NY). 1985, Vol 15, Num 1, pp 49-57, issn 0028-3045Article

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

Parallel solution of recurrences on a tree machinePARGAS, R. P.International journal of computer & information sciences. 1984, Vol 13, Num 4, pp 251-277, issn 0091-7036Article

  • Page / 67