Prakash V. Ramanan

Learn More
In this paper we derive tight lower bounds for the maximal and convex layers problems in the plane. Our lower bound proofs for the maxima problem and convex hull problem are simpler than those previously known. We also obtain an Ω(nlog n) lower bound for the maximal depth problem, and the convex depth problem, when the points are given in sorted order of(More)
We present a new technique for obtaining lower bounds on the time-complexity of optimization problems, in the linear decision tree model of computation. We then use this technique to obtain a tight Q(n log n ) lower bound for a problem of finding a minimum cost triangulation of a simple polygon with weighted vertices. This problem is similar to the problem(More)
New algorithms are presented to select the k largest elements, and give their respective order, of a totally ordered set of n elements, when k is small compared to n. The performance of these algorithms improves over that of previously known algorithms. One of these algorithms is optimal for a wide range of values of n and k. The algorithms can be modified(More)
In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf 1 andf 2 be two linear combinations of random variables {N i } i=1 k where theN i 's have a(More)
The following personnel assignment problem is considered. Let (T, < ) be a linearly ordered set where T is a set (of people), and let (P, 6 ) be a partially ordered set where P, a set of positions of two types, is of the same cardinality as T. Each person i in T is to be assigned to a position. A feasible assignment of personnel to positions is an embedding(More)