Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Research tree")

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 176

  • Page / 8

Export

Selection :

  • and

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

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

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

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

Depth-first iterative-deepening: an optimal admissible tree searchKORF, R. E.Artificial intelligence. 1985, Vol 27, Num 1, pp 97-109, issn 0004-3702Article

Priority search treesMCCREIGHT, E. M.SIAM journal on computing (Print). 1985, Vol 14, Num 2, pp 257-276, issn 0097-5397Article

Analytic properties of multiple access treesKAPLAN, M. A; GULKO, E.IEEE transactions on information theory. 1985, Vol 31, Num 2, pp 255-263, issn 0018-9448Article

Possibilistic search treesFLOWERS, P. L; KANDEL, A.Fuzzy sets and systems. 1985, Vol 16, Num 1, pp 1-24, issn 0165-0114Article

Purely top-down updating algorithms for stratified search treesOTTMANN, T; SCHRAPP, M; WOOD, D et al.Acta informatica. 1985, Vol 22, Num 1, pp 85-100, issn 0001-5903Article

Two new kinds of biased search treesFEIGENBAUM, J; TARJAN, R. E.The Bell System technical journal. 1983, Vol 62, Num 10, pp 3139-3158, issn 0005-8580Article

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

On the variance of the external path length in a symmetric digital trieKIRSCHENHOFER, P; PRODINGER, H; SZPANKOWSKI, W et al.Discrete applied mathematics. 1989, Vol 25, Num 1-2, pp 129-143, issn 0166-218X, 15 p.Article

The evaluation of an alternative sum with applications to the analysis of some data structuresSZPANKOWSK, W.Information processing letters. 1988, Vol 28, Num 1, pp 13-19, issn 0020-0190Article

Optimal multiway search trees for variable size keysSZWARCFITER, J. L.Acta informatica. 1984, Vol 21, Num 1, pp 47-60, issn 0001-5903Article

INTEGRATION AND SYSTEM TESTKLINKSIEK WF; MITCHELL HL.1983; BELL SYSTEM TECHNICAL JOURNAL; ISSN 0005-8580; USA; DA. 1983; VOL. 62; NO 1; PP. 399-410; BIBL. 10 REF.Article

APPROXIMATION ALGORITHMS FOR MINIMUM DATA STORAGE SPACE AND ACCESS TIMEMATSUSHITA H; MARUOKA A; KIMURA M et al.1980; SYSTEMS, COMPUTERS, CONTROLS; ISSN 0096-8765; USA; DA. 1980; VOL. 11; NO 4; PP. 50-58; BIBL. 10 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

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 joint distribution of the insertion path length and the number of comparisons in search treesMAHMOUD, H. M; PITTEL, B.Discrete applied mathematics. 1988, Vol 20, Num 3, pp 243-251, issn 0166-218XArticle

Jump interpolation search trees and symmetric binary numbersGUNTZER, U; PAUL, M.Information processing letters. 1987, Vol 26, Num 4, pp 193-204, issn 0020-0190Article

Multidimensional search trees that provide new types of memory reductionsWILLARD, D. E.Journal of the Association for Computing Machinery. 1987, Vol 34, Num 4, pp 846-858, issn 0004-5411Article

Dictionary machine with improved performanceGOYAL, P; NARAYANAN, T. S.Computer journal (Print). 1988, Vol 31, Num 6, pp 490-495, issn 0010-4620Article

A log log n data structure for three-sided range queriesFRIES, O; MEHLHORN, K; NÄHER, S et al.Information processing letters. 1987, Vol 25, Num 4, pp 269-273, issn 0020-0190Article

  • Page / 8