I. V. Ramakrishnan I. V. Ramakrishnan P. S. Gopalakrishnan, I. V. Ramakrishnan, and L. N. Kanal. Approximate algorithms for the knapsack problem on parallel computers. Rakesh M. Verma and I. V. Ramakrishnan.
Tight complexity bounds for term matching problems.
References and Citations. R. C. Sekar and I. V. Ramakrishnan. Beyond strong sequentiality. References, Citations, etc.