Vikram Sharma

Email: vikram at imsc dot res dot in
Phone: +91 44 2254 3316
Fax: +91 44 2254 1586

Research Interests

Thesis: Complexity Analysis of Algorithms in Algebraic Computation
Advisor: Prof. Chee Yap
Robust Approximate Zeros, with Zilin Du and Chee Yap. Appeared in ESA'05.
Amortized Bound for Root Isolation Via Sturm Sequences, with Zilin Du and Chee Yap. Appeared in SNC'05.
Almost Tight Recursion Tree Bounds for the Descartes Method, with Arno Eigenwillig and Chee Yap. Appeared in ISSAC 2006.
Robust Approximate Zeros in Banach Space. Appeared in Mathematics in Computer Science.
Complexity of Real Root Isolation Using Continued Fractions. Appeared in ISSAC 2007. Definitive version appears here in Theoretical Computer Science (TCS).
Bounds on Absolute Positiveness of Multivariate Polynomials, with Prashant Batra. Published in JSC 2010.
Robust Geometric Computation, with Chee Yap. Encyclopedia of Algorithms, 2008.
Applications of Dimensionality Reduction and Exponential Sums to Graph Automorphism, with Madhusudan Manjunath. Theoretical Computer Science, 2011..

Nov. 2006 - Oct. 2007: Postdoc in GALAAD, INRIA, Sophia Antipolis.

August 2001 - Oct. 2006
Ph. D. student in Computer Science at New York University, New York, USA. Thesis Advisor: Prof. Chee Yap.
August 1997 - May 2001
B.Tech. in Computer Science and Engineering from IT-BHU, Varanasi.