Skip navigation.
New Mexico State University

   

 



 
Email:   
Phone:
Office:


Publications
A. Panconesi and D. Ranjan, " Quantifiers and Approximation, " Quantifiers and Approximation, Theoretical Computer Science, 107(1):145-163, Jan 1993

Dubhashi and Desh Ranjan, Some Correlation Inequal, " Technical Report #MPI- I-94-143, Max Planck Institut fur Informatik, Saarbrucken, Germany, " Technical Report #MPI- I-94-143, Max Planck Institut fur Informatik, Saarbrucken, Germany, Submitted to Symposium on Discrete Algorithms, 1994

D. Ranjan, S. Chari and P. Rohatgi, " Improving Known Solutions is Hard, " Improving Known Solutions is Hard, Computational Complexity 3:168-185, 1993

D.Dubhashi, K.Mehlhorn, D. Ranjan and C.Thiel, " Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets, " Searching, Sorting and Randomised Algorithms for Central Elements and Ideal Counting in Posets, In Foundations of Software Technology and Theoretical Computer Science 13th Conference, Springer-Verlag Lecture Notes in Computer Science #761, 436- 443, 1993

S. Chari, D. Ranjan and P. Rohatgi, " On the Complexity of Incremental Computation, " On the Complexity of Incremental Computation, In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science, Springer-Verlag Lecture Notes in Computer Science #629, 172-180, 1992