Vikram Sharma

According to our database1, Vikram Sharma authored at least 20 papers between 2005 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Complexity of a Root Clustering Algorithm.
CoRR, 2019

2018
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.
J. Symb. Comput., 2018

Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model.
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.
J. Symb. Comput., 2017

Improved Bounds on Absolute Positiveness of Multivariate Polynomials.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
Robust Geometric Computation.
Encyclopedia of Algorithms, 2016

Complexity Analysis of Root Clustering for a Complex Polynomial.
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

A Lower Bound for Computing Lagrange's Real Root Bound.
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.
CoRR, 2015

2014
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Towards Exact Numerical Voronoi Diagrams.
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.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
Applications of dimensionality reduction and exponential sums to graph automorphism.
Theor. Comput. Sci., 2011

2010
Bounds on absolute positiveness of multivariate polynomials.
J. Symb. Comput., 2010

2008
Robust Geometric Computation.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Complexity of real root isolation using continued fractions.
Theor. Comput. Sci., 2008

2007
Robust Approximate Zeros in Banach Space.
Mathematics in Computer Science, 2007

2006
Almost tight recursion tree bounds for the Descartes method.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

2005
Robust Approximate Zeros.
Proceedings of the Algorithms, 2005


  Loading...