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

External internal nodes in digital search trees via Mellin transformsPRODINGER, H.SIAM journal on computing (Print). 1992, Vol 21, Num 6, pp 1180-1183, issn 0097-5397Article

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

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

Comments on batched searching of sequential and tree-structured filesPIWOWARSKI, M.ACM transactions on database systems. 1985, Vol 10, Num 2, pp 285-287, issn 0362-5915Article

Corrections to Parallel game tree-searchMARSLAND, T. A; POPOWICH, F.IEEE transactions on pattern analysis and machine intelligence. 1985, Vol 7, Num 6, pp 748-749, issn 0162-8828Article

Average number of rotations and access cost in IR-treesSHOU-HSUAN STEPHEN HUANG; WONG, C. K.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 387-390, issn 0006-3835Article

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

Derivation of a pallel algorithm for balancing binary treesMOITRA, A; IYENGAR, S. S.IEEE transactions on software engineering. 1986, Vol 12, Num 3, pp 442-449, issn 0098-5589Article

Generalized binary binomial group testingNADER MEHRAVARI.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 1, pp 159-166, issn 0196-5212Article

Universal retrieval treesKRICHEVSKY, R. E; RYABKO, B. YA.Discrete applied mathematics. 1985, Vol 12, Num 3, pp 291-302, issn 0166-218XArticle

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

ENCODING SEARCH TREES IN LISTSVAISHNAVI V; WOOD D.1982; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1982; VOL. 10; NO 3-4; PP. 237-246; BIBL. 9 REF.Article

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

Self-adjusting binary search treesSLEATOR, D. D; TARJAN, R. E.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 652-686, issn 0004-5411Article

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

Self-assessment procedure XIII. A self-assessment procedure dealing with binary search trees and B-treesGUPTA, G. K.Communications of the ACM. 1984, Vol 27, Num 5, pp 435-443, issn 0001-0782Article

Expressions for the number of 2-3 trees with n leavesSHIMIZU, M; NAKAMURA, G.Systems, computers, controls. 1984, Vol 15, Num 5, pp 84-91, issn 0096-8765Article

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