A BINARY TREE REPRESENTATION AND RELATED ALGORITHMS FOR GENERATING INTEGER PARTITIONSFENNER TI; LOIZOU G.1980; COMPUT. J.; ISSN 0010-4620; GBR; DA. 1980; VOL. 23; NO 4; PP. 332-337; BIBL. 15 REF.Article

A METHOD FOR THE DESIGN OF BINARY TREE CLASSIFIERSSHI QUING YUN.1981; CONFERENCE ON PATTERN RECOGNITION AND IMAGE PROCESSING/1981/DALLAS TX; USA; NEW YORK: IEEE; DA. 1981; PP. 21-26; BIBL. 11 REF.Conference Paper

ANALYSIS OF AN ALGORITHM FOR PRIORITY QUEUE ADMINISTRATION.JONASSEN A; DAHL OL.1975; B.I.T.; DANM.; DA. 1975; VOL. 15; NO 4; PP. 409-422; BIBL. 5 REF.Article

A NOTE ON GROWING BINARY TREESKONHEIM AG; NEWMAN DJ.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 1; PP. 57-63; BIBL. 3 REF.Serial Issue

A PATTERN MATCHING ALGORITHM IN BINARY TREESKOJIMA K.1983; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1983; VOL. 147; PP. 99-114; BIBL. 7 REF.Conference Paper

A NEW PROOF OF THE T-C ALGORITHM.HU TC.1973; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1973; VOL. 25; NO 1; PP. 83-94; BIBL. 7 REF.Article

A-TRANSFORMATION DANS LES ARBRES N-AIRESBONNIN A; PALLO JM.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 45; NO 2-3; PP. 153-163; ABS. ENG; BIBL. 6 REF.Article

AUTOMATIC CLASSIFICATION OF CERVICAL CELLS USING A BINARY TREE CLASSIFIERLIN YK; FU KS.1983; PATTERN RECOGNITION; ISSN 0031-3203; USA; DA. 1983; VOL. 16; NO 1; PP. 69-80; BIBL. 19 REF.Article

AN EXPLICIT EXPRESSION FOR THE COST OF A CLASS OF HUFFMAN TREESHWANG FK.1980; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1980; VOL. 32; NO 2; PP. 163-165; BIBL. 8 REF.Article

TRAVERSING BINARY TREE STRUCTURES WITH SHIFT REGISTER MEMORIES.KLUGE WE.1976; IN: ANNU. SYMP. COMPUT. ARCHIT. 3; CLEAWATER, FLA.; 1976; NEW YORK; INST. ELECTR. ELECTRON. ENG.; DA. 1976; PP. 121; RESUMEConference Paper

STACK SORTABLE PERMUTATIONSROTEM D.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 2; PP. 185-196; BIBL. 9 REF.Article

ABRES DE DECISIONFOTR J.1975; EKON.-MAT. OBZ.; CESKOSL.; DA. 1975; VOL. 11; NO 2; PP. 142-161; ABS. ANGL.; BIBL. 23 REF.Article

ANALYSIS OF RANGE SEARCHES IN QUAD TREES.BENTLY JL; STANAT DF.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 6; PP. 170-173; BIBL. 3 REF.Article

GRAPHS THAT ARE ALMOST BINARY TREESHONG JW; ROSENBERG AL.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 2; PP. 227-242; BIBL. 12 REF.Article

ENUMERATION OF BINARY PHYLOGENETIC TREESFOULDS LR; ROBINSON RW.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 187-202; BIBL. 10 REF.Conference Paper

GRAPHS THAT ARE ALMOST BINARY TREES. PRELIMINARY VERSIONHONG JW; ROSENBERG AL.1981; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON THEORY OF COMPUTING. 13/1981/MILWAUKEE WI; USA; NEW YORK: ASSOCIATION FOR COMPUTING MACHINERY; DA. 1981; PP. 334-341; BIBL. 12 REF.Conference Paper

A FAST ALGORITHM FOR COPYING BINARY TREES.CLARK DW.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 4; NO 3; PP. 62-63; BIBL. 4 REF.Article

SOME RESULTS ON HU'S CONJECTURE CONCERNING BINARY TREESCHU YUNG CHING.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 29; NO 3; PP. 251-255; BIBL. 1 REF.Article

THE AVERAGE NUMBER OF REGISTERS NEEDED TO EVALUATE A BINARY TREE OPTIMALLYKEMP R.1979; ACTA INFORMAT.; DEU; DA. 1979; VOL. 11; NO 4; PP. 363-372; BIBL. 6 REF.Article

TRANSFORMATION DES FORMULES DE TRANSITION DES DIAGRAMMES DES ALGORITHMESKAKURIN N YA; BARINOV AK.1975; AVTOMAT. VYCHISLIT. TEKH., LATV. S.S.R.; S.S.S.R.; DA. 1975; NO 2; PP. 9-11; BIBL. 6 REF.Article

BINARY TREES AND PARALLEL SCHEDULING ALGORITHMSDEKEL E; SAHNI S.1983; IEEE TRANSACTIONS ON COMPUTERS; ISSN 0018-9340; USA; DA. 1983; VOL. 32; NO 3; PP. 307-315; BIBL. 38 REF.Article

CLASSES OF FUNCTIONS OVER BINARY TREESBUENING HK.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 117; PP. 199-204; BIBL. 8 REF.Conference Paper

IMPLANTING FFP TREES IN BINARY TREES: AN ARCHITECTURAL PROPOSALTOLLE DM.1981; CONFERENCE ON FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE/1981/PORTSMOUTH NH; USA; NEW YORK: ACM; DA. 1981; PP. 115-122; BIBL. 3 REF.Conference Paper

A NOTE ON TRAVERSAL ALGORITHMS FOR TRIPLY LINKED BINARY TREESFENNER TI; LOIZOU G.1981; BIT (NORD-TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1981; VOL. 21; NO 2; PP. 153-156; BIBL. 7 REF.Article

APPLIED TREE ENUMERATIONSDERSHOWITZ N; ZAKS S.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 112; PP. 180-193; BIBL. 18 REF.Conference Paper