z-logo
open-access-imgOpen Access
Weighting Without Waiting: the Weighted Path Length Tree
Author(s) -
Guy Argo
Publication year - 1991
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/34.5.444
Subject(s) - path (computing) , mathematics , tree (set theory) , binary tree , binary search tree , random binary tree , search tree , path length , interval tree , optimal binary search tree , heuristic , algorithm , k ary tree , ternary search tree , upper and lower bounds , weighting , simple (philosophy) , computer science , tree structure , combinatorics , mathematical optimization , search algorithm , medicine , computer network , radiology , mathematical analysis , philosophy , epistemology , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom