Showing papers by "V. Kamakoti published in 1995"
TL;DR: This paper presents an O(log n) time, O(n) processor, CREW PRAM model parallel algorithm for finding a Breadth First Search (BFS) spanning tree of a permutation graph rooted at vertex 1 and uses the same to derive an efficient parallel algorithms for the All Pairs Shortest Path problem on permutation graphs.
7 citations
Journal Article•
TL;DR: A simple randomized algorithm for finding the Closest Foreign Pair, in a set of n points in D-dimensional space, where D ≥ 2 is a fixed constant and the distances are measured in the L1 and the L∞ metric.
Abstract: We present a simple randomized algorithm for finding the Closest Foreign Pair, in a set of n points in D-dimensional space, where D ≥ 2 is a fixed constant and the distances are measured in the L1 and the L∞ metric. The algorithm runs in O(nlogD-1 n/log log n) time with high probability for the L∞ metric and in O(n log2D-1-1 n/log log n) time with high probability for the L1 metric.
1 citations
24 Aug 1995
TL;DR: Using this data structure, the Leafary tree, it is shown that the Closest Pair of n points in D-dimensional space, where, D≥2, is a fixed constant, can be found in O(n log n/log log n) expected time.
Abstract: We present a new data structure, the Leafary tree, for designing an efficient randomized algorithm for the Closest Pair Problem. Using this data structure, we show that the Closest Pair of n points in D-dimensional space, where, D≥2, is a fixed constant, can be found in O(n log n/log log n) expected time. The algorithm does not employ hashing.