Showing papers by "Indian Institute of Management Calcutta published in 1982"
TL;DR: An algorithm for generating the impossible pair (IP) constrained path in a program, if any, is described, the complexity of the algorithm is polynomial in the number of vertices and thenumber of IP constrained paths actually existing in the program when the program digraph is acyclic.
13 citations
TL;DR: The basic definitions and relevant background material are sketched, referring the reader to [2] or [3] for a comprehensive presentation.
Abstract: computer science. The function f arises in connection with random binary search trees. We shall only sketch the basic definitions and relevant background material, referring the reader to [2] or [3] for a comprehensive presentation. A binary tree is a finite set of nodes that is either empty or consists of a root and two disjoint binary trees called the left and right subtrees of the root. It is customary to draw such a tree as
6 citations
2 citations
TL;DR: The distribution of the weight-balance factors of the internal nodes in a random tree built by binary search and insertion is determined and it is shown that in such a tree about 72% of all internal nodes have weight balance factors lying between $$1 - \sqrt 2 /2$$ and $$\sqrt2 /2$ .
Abstract: A method formulated by Yao and used by Brown has yielded bounds on the fraction of nodes with specified properties in trees bult by a sequence of random internal nodes in a random tree built by binary search and insertion, and show that in such a tree about bounds better than those now known. We then apply these methods to weight-balanced trees and to a type of “weakly balanced” trees. We determine the distribution of the weight-balance factors of the internal nodes in a random tree built by binary search and insertion and show that in such a tree about 72% of all internal nodes have weight balance factors lying between 1−2√/2 and 2√/2.
1 citations