Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Arbol investigación")

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


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

Author Country

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

Results 1 to 25 of 1141

  • Page / 46


Selection :

  • and

Dynamic optimality-almostDEMAINE, Erik D; HARMON, Dion; IACONO, John et al.Annual Symposium on Foundations of Computer Science. 2004, pp 484-490, isbn 0-7695-2228-9, 1Vol, 7 p.Conference Paper

Efficient reorganization of binary search treesHOFRI, M; SHACHNAI, H.Algorithmica. 2001, Vol 31, Num 3, pp 378-402, issn 0178-4617Article

DYNAMIC OPTIMALITY-ALMOSTDEMAINE, Erik D; HARMON, Dion; IACONO, John et al.SIAM journal on computing (Print). 2008, Vol 37, Num 1, pp 240-251, issn 0097-5397, 12 p.Article

The analysis of heuristics for search treesPOBLETE, P. V.Acta informatica. 1993, Vol 30, Num 3, pp 233-248, issn 0001-5903Article

Extremal CSPsPRCOVIC, Nicolas.Lecture notes in computer science. 2005, pp 807-811, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 5 p.Conference Paper

A tree-based MergesortMOFFAT, A; PETERSSON, O; WORMALD, N. C et al.Acta informatica. 1998, Vol 35, Num 9, pp 775-793, issn 0001-5903Article

Decidability of equivalence for a class of non-deterministic tree transducersANDRE, Y; DAUCHET, M.Informatique théorique et applications (Imprimé). 1994, Vol 28, Num 5, pp 447-463, issn 0988-3754Article

Use of a binary search pattern and discriminator analysis in the radiologic diagnosis of arthritisALEXANDER, C.Seminars in arthritis and rheumatism. 1986, Vol 16, Num 2, pp 104-117, issn 0049-0172Article

An explanation of splayingSUBRAMANIAN, A.Journal of algorithms (Print). 1996, Vol 20, Num 3, pp 512-525, issn 0196-6774Article

Prefix codes : Equiprobable words, unequal letter costsGOLIN, M. J; YOUNG, N.SIAM journal on computing (Print). 1996, Vol 25, Num 6, pp 1281-1292, issn 0097-5397Article

On the average internal path length of m-ary search treesMAHMOUD, H. M.Acta informatica. 1986, Vol 23, Num 1, pp 111-117, issn 0001-5903Article

Application of basic hypergeometric seriesRAKHA, Medhat A; EL-SEDY, Essam S.Applied mathematics and computation. 2004, Vol 148, Num 3, pp 717-723, issn 0096-3003, 7 p.Article

On the concentration of the height of binary search treesROBSON, J. M.Lecture notes in computer science. 1997, pp 441-448, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Widest empty L-shaped corridorCHENG, S.-W.Information processing letters. 1996, Vol 58, Num 6, pp 277-283, issn 0020-0190Article

Singleton consistenciesPROSSER, Patrick; STERGIOU, Kostas; WALSH, Toby et al.Lecture notes in computer science. 2000, pp 353-368, issn 0302-9743, isbn 3-540-41053-8Conference Paper

Recovering a relation from a decomposition using constraint satisfactionJEAVONS, P.Information sciences. 1994, Vol 78, Num 3-4, pp 229-256, issn 0020-0255Article

On finding the height of a binary search treeWEISS, M. A.Computer journal (Print). 1993, Vol 36, Num 3, pp 280-281, issn 0010-4620Article

Dynamic algorithms for approximating interdistancesBESPAMYATNIKH, Sergei; SEGAL, Michael.Lecture notes in computer science. 2003, pp 1169-1180, issn 0302-9743, isbn 3-540-40493-7, 12 p.Conference Paper

Relaxed AVL trees, main-memory databases and concurrencyNURMI, O; SOISALON-SOININEN, E; WOOD, D et al.International journal of computer mathematics. 1996, Vol 62, Num 1-2, pp 23-44, issn 0020-7160Article

A new representation of binary search treesSI-QING ZHENG.Information sciences. 1993, Vol 74, Num 3, pp 275-282, issn 0020-0255Article

Solution of Ulam's problem on binary search with three liesNEGRO, A; SERENO, M.Journal of combinatorial theory. Series A. 1992, Vol 59, Num 1, pp 149-154, issn 0097-3165Article

Graph embedding in SYNCHEM2, an expert system for organic synthesis discoveryBENSTOCK, J. D; BERNDT, D. J; AGARWAL, K. K et al.Discrete applied mathematics. 1988, Vol 19, pp 45-63, issn 0166-218XArticle

A limiting distribution for Quicksort; Distribution limite de QuicksortREGNIER, Mireille.Rapports de recherche - INRIA. 1987, Vol 739, issn 0249-6399, 8 p.Report

Symmetry breaking revisitedPUGET, Jean-Francois.Lecture notes in computer science. 2002, pp 446-461, issn 0302-9743, isbn 3-540-44120-4, 16 p.Conference Paper

Une version concurrente de la procédure de Davis et Putnam = A concurrent version of the Davis Putnam's procedureGENISSON, R; BENHAMOU, B; RAUZY, A et al.Revue d'intelligence artificielle. 1996, Vol 10, Num 4, pp 499-506, issn 0992-499XArticle

  • Page / 46