Vikram Sharma

According to our database, Vikram Sharma authored at least 24 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Complexity of a root clustering algorithm for holomorphic functions.

Prashant Batra, Vikram Sharma

Theor. Comput. Sci., 2024

2020

Improved bounds on absolute positiveness of multivariate polynomials.

Swaroop N. Prabhakar, Vikram Sharma

J. Symb. Comput., 2020

Generalizing The Davenport-Mahler-Mignotte Bound - The Weighted Case.

Vikram Sharma

CoRR, 2020

Generalizing the davenport-mahler-mignotte bound.

Vikram Sharma

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

2019

Complexity of a Root Clustering Algorithm.

Prashant Batra, Vikram Sharma

CoRR, 2019

2018

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap

J. Symb. Comput., 2018

Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model.

Swaroop N. Prabhakar, Vikram Sharma

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Near optimal subdivision algorithms for real root isolation.

Prashant Batra, Vikram Sharma

J. Symb. Comput., 2017

2016

Robust Geometric Computation.

Chee K. Yap, Vikram Sharma

Encyclopedia of Algorithms, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

A Lower Bound for Computing Lagrange's Real Root Bound.

Swaroop N. Prabhakar, Vikram Sharma

Proceedings of the Computer Algebra in Scientific Computing - 18th International Workshop, 2016

2015

A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.

Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap

CoRR, 2015

2014

Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision.

Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap

Proceedings of the Mathematical Software - ICMS 2014, 2014

2013

Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.

Chee Yap, Michael Sagraloff, Vikram Sharma

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Towards Exact Numerical Voronoi Diagrams.

Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien

Proceedings of the Ninth International Symposium on Voronoi Diagrams in Science and Engineering, 2012

Near optimal tree size bounds on a simple real root isolation algorithm.

Vikram Sharma, Chee-Keng Yap

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011

Applications of dimensionality reduction and exponential sums to graph automorphism.

Madhusudan Manjunath, Vikram Sharma

Theor. Comput. Sci., 2011

2010

Bounds on absolute positiveness of multivariate polynomials.

Prashant Batra, Vikram Sharma

J. Symb. Comput., 2010

2008

Robust Geometric Computation.

Chee-Keng Yap, Vikram Sharma

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Complexity of real root isolation using continued fractions.

Vikram Sharma

Theor. Comput. Sci., 2008

2007

Robust Approximate Zeros in Banach Space.

Vikram Sharma

Math. Comput. Sci., 2007

2006

Complexity Analysis of Algorithms in Algebraic Computation.

Vikram Sharma

PhD thesis, 2006

Almost tight recursion tree bounds for the Descartes method.

Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005

Robust Approximate Zeros.

Vikram Sharma, Zilin Du, Chee-Keng Yap

Proceedings of the Algorithms, 2005