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

MEDIAN SPLIT TREES: A FAST LOOKUP TECHNIQUE FOR FREQUENTLY OCCURING KEYSSHEIL BA.1978; COMMUNIC. A.C.M.; USA; DA. 1978; VOL. 21; NO 11; PP. 947-958; BIBL. 9 REF.Article

THE CONSTRUCTION OF OPTIMAL MULTIWAY SEARCH TREES AND THE MONOTONICITY PRINCIPLEGOTLIEB L; WOOD D.1981; INT. J. COMPUT. MATH.; ISSN 0020-7160; GBR; DA. 1981; VOL. 9; NO 1; PP. 17-24; BIBL. 6 REF.Article

STRATIFIED BALANCED SEARCH TREESVAN LEEUWEN J; OVERMARS MH.1983; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1983; VOL. 18; NO 4; PP. 345-359; BIBL. 10 REF.Article

ON THE COSTS OF OPTIMAL AND NEAR-OPTIMAL BINARY SEARCH TREESALLEN B.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 18; NO 3; PP. 255-263; BIBL. 5 REF.Article

MULTIDIMENSIONAL B-TREES FOR ASSOCIATIVE SEARCHING IN DATABASE SYSTEMSSCHEUERMANN P; OUKSEL M.1982; INFORMATION SYSTEMS; ISSN 0306-4379; GBR; DA. 1982; VOL. 7; NO 2; PP. 133-137; BIBL. 31 REF.Article

THE B^* TREE SEARCH ALGORITHM - NEW RESULTSPALAY AJ.1982; ARTIFICIAL INTELLIGENCE; ISSN 0374-2539; NLD; DA. 1982; VOL. 19; NO 2; PP. 145-163; BIBL. 3 REF.Article

HEARLY OPTIMAL BINARY SEARCH TREES.MEHLHORN K.1975; ACTA INFORMAT.; ALLEM.; DA. 1975; VOL. 5; NO 4; PP. 287-295; BIBL. 7 REF.Article

THE LAST PLAYER THEOREMNAU DS.1982; ARTIF. INTELL.; ISSN 0374-2539; NLD; DA. 1982; VOL. 18; NO 1; PP. 53-65; BIBL. 18 REF.Article

PERFORMANCE STUDIES OF OPTIMUM SEQUENCE TREES AND SELF-ORGANIZING SEQUENCE TREESYUBA T; MIYAKAWA M.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 4; PP. 40-49; BIBL. 9 REF.Article

DEPTH-FIRST SEARCH AND THE VERTEX COVER PROBLEMSAVAGE C.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 233-235; BIBL. 6 REF.Article

THE SOLUTION FOR THE BRANCHING FACTOR OF THE ALPHA-BETA PRUNING ALGORITHMPEARL J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 115; PP. 521-529; BIBL. 8 REF.Conference Paper

DETERMINING THE STABILITY MEMBER OF A GRAPH.CHVATAL V.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 643-662; BIBL. 20 REF.Article

A STORAGE SCHEME FOR HIERARCHIC STRUCTURES.SMYTH WF; RADACEANU E.1974; COMPUTER J.; G.B.; DA. 1974; VOL. 17; NO 2; PP. 152-156; BIBL. 7 REF.Article

EXPERIMENTS WITH A CLOSEST POINT ALGORITHM IN HAMMING SPACENEVALAINEN O; KATAJAINEN J.1982; ANGEWANDTE INFORMATIK; ISSN 0013-5704; DEU; DA. 1982; NO 5; PP. 277-281; ABS. GER; BIBL. 7 REF.Article

DEPTH-FIRST K-TREES AND CRITICAL PATH ANALYSISBERZTISS AT.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 13; NO 4; PP. 325-346; BIBL. 16 REF.Article

ON THE RELATIONSHIP BETWEEN SON-TREES AND SYMMETRIC BINARY B-TREESOLIVIE H.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 1; PP. 4-8; BIBL. 9 REF.Article

OPTIMUM MULTIWAY SEARCH TREESVAISHNAVI VK; KRIEGEL HP; WOOD D et al.1980; ACTA INFORMAT.; DEU; DA. 1980; VOL. 14; NO 2; PP. 119-133; BIBL. 25 REF.Article

RANDOMLY BALANCED BINARY TREESSPRUGNOLI R.1980; CALCOLO; ISSN 0008-0624; ITA; DA. 1980; VOL. 17; NO 2; PP. 99-117; BIBL. 10 REF.Article

ON THE CORRESPONDENCE BETWEEN AVL TREES AND BROTHER TREESOTTMANN T; SIX HW; WOOD D et al.1979; COMPUTING; AUT; DA. 1979; VOL. 23; NO 1; PP. 43-54; ABS. GER; BIBL. 11 REF.Article

OPTIMAL SEARCH TREES AND LENGTH RESTRICTED CODESWIKSTROM A.1979; ; BIT; DNK; DA. 1979; VOL. 19; NO 4; PP. 518-524; BIBL. 12 REF.Article

A FAST SELECTIVE TRAVERSAL ALGORITHM FOR BINARY SEARCH TREESKIKUNO T; YOSHIDA N; KUSUMOTO H et al.1979; COMPSAC 79. INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE. 3/1978/CHICAGO IL; USA; NEW YORK: IEEE; DA. 1979; PP. 601-605; BIBL. 5 REF.Conference Paper

SELF-ORGANIZING BINARY SEARCH TREE WITH COUNTING FIELDFUKUSHIMA H; KIMURA M.1978; SYST., COMPUT., CONTROLS; ISSN 0096-8765; USA; DA. 1978 PUBL. 1980; VOL. 9; NO 4; PP. 9-16; BIBL. 7 REF.Article

SELF-ORGANIZING BINARY SEARCH TREESALLEN B; MUNRO I.1978; J. ASS. COMPUTG MACHIN.; USA; DA. 1978; VOL. 25; NO 4; PP. 526-535; BIBL. 9 REF.Article

LES ARBRES DE RECHERCHE EN TANT QUE STRUCTURE D'ORGANISATION DE FICHIERRUZICKA P; WIEDERMANN J.1977; INFORM. SYST.; CESKOSL.; DA. 1977; VOL. 6; NO 5; PP. 463-480; ABS. RUSSE ANGL.; BIBL. 21 REF.Article