Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ARBRE RECHERCHE BINAIRE")

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

Results 1 to 25 of 400

  • Page / 16
Export

Selection :

  • and

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

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

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

A NEW CLASS OF BALANCED SEARCH TREES: HALF-BALANCED BINARY SEARCH TREESOLIVIE HJ.1982; R.A.I.R.O. INFORM. THEOR.; ISSN 0399-0540; FRA; DA. 1982; VOL. 16; NO 1; PP. 51-71; ABS. FRE; BIBL. 14 REF.Article

ON THE MAX-ENTROPY RULE FOR A BINARY SEARCH TREEHORIBE Y; NEMETZ TOH.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 12; NO 1; PP. 63-72; BIBL. 6 REF.Article

ON THE WEIGHTED PATH LENGTH OF BINARY SEARCH TREES FOR UNKNOWN ACCESS PROBABILITIESPISCHER T.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; VOL. 74; PP. 284-291; BIBL. 10 REF.Conference Paper

A NEW ALGORITHM FOR MINIMUM COST BINARY TREES.GARSIA AM; WACHS ML.1977; S.I.A.M. J. COMPUTG; U.S.A.; DA. 1977; VOL. 6; NO 4; PP. 622-642; BIBL. 7 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

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

GROWING NEARLY OPTIMAL BINARY SEARCH TREESKORSH JF.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 3; PP. 139-143; BIBL. 7 REF.Article

A FUNCTION FOR GENERATING NEARLY BALANCED BINARY SEARCH TREES FROM SETS OF NON-RANDOM KEYSFROST RA; PETERSON MM.1982; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1982; VOL. 12; NO 2; PP. 163-168Article

GENERALIZED NON-RECURSIVE TRAVERSAL OF BINARY TREESKILGOUR AC.1981; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1981; VOL. 11; NO 12; PP. 1299-1306; BIBL. 7 REF.Article

ON A GENERALIZATION OF BINARY SEARCHLEIPALA T.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 5; PP. 230-233; BIBL. 6 REF.Article

OPTIMAL ALPHABETIC SEARCH TREES WITH RESTRICTED MAXIMAL HEIGHT.WESSNER RL.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 4; NO 4; PP. 90-94; BIBL. 4 REF.Article

SCHRANKEN FUER BALANCED TREES BEI AUSGEWOGENEN VERTEILUNGEN. = LIMITES POUR DES ARBRES EQUILIBRES A DISTRIBUTIONS PONDEREESHOTZ G.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 51-59; ABS. ANGL.; BIBL. 4 REF.Article

ASPECTS OF INSERTION IN RANDOM TREESBAGCHI A; REINGOLD EM.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 29; NO 1; PP. 11-29; ABS. GER; BIBL. 7 REF.Article

ON ALPHA -BALANCED BINARY SEARCH TREESOLIVIES HJ.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 98-108; BIBL. 5 REF.Conference Paper

BINARY SEARCH TREES: AVERAGE AND WORST CASE BEHAVIORGUETTLER R; MEMLHORN K; SCHNEIDER W et al.1980; ELEKTRON. INFORMATIONSVERARB. KYBERN.; ISSN 0013-5712; DDR; DA. 1980; VOL. 16; NO 1-3; PP. 41-61; ABS. GER/RUS; BIBL. 22 REF.Article

DYNAMIC WEIGHTED BINARY SEARCH TREESUNTERAUER K.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 4; PP. 341-362; BIBL. 15 REF.Article

ENGLISH DICTIONARY SEARCHING WITH LITTLE EXTRA SPACECOMER D.1979; NATIONAL COMPUTER CONFERENCE/1979/NEW YORK NY; USA; MONTVALE: AFIPS PRESS; DA. 1979; PP. 209-216; BIBL. 7 REF.Conference Paper

ON THE MEAN ACCURACY OF HIERARCHICAL CLASSIFIERSKULKARNI AV.1978; I.E.E.E. TRANS. COMPUTERS; USA; DA. 1978; VOL. 27; NO 8; PP. 771-776; BIBL. 9 REF.Article

  • Page / 16