Vikram Sharma

32 papers A 1B 8C 1Journal 15Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
On The Roots of Independence Polynomial: Quantifying The Gap.
CoRR
Om Prakash, Vikram Sharma
2025 — conf
On the Roots of Independence Polynomial: Quantifying the Gap.
FSTTCS
Om Prakash, Vikram Sharma
2024 J jnl
Complexity of a root clustering algorithm for holomorphic functions.
Theor. Comput. Sci.
Prashant Batra, Vikram Sharma
2021 J jnl
Complexity Analysis of Root Clustering for a Complex Polynomial.
CoRR
Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
2020 J jnl
Generalizing The Davenport-Mahler-Mignotte Bound - The Weighted Case.
CoRR
Vikram Sharma
2020 B conf
Generalizing the davenport-mahler-mignotte bound.
ISSAC
Vikram Sharma
2020 J jnl
Improved bounds on absolute positiveness of multivariate polynomials.
J. Symb. Comput.
Swaroop N. Prabhakar, Vikram Sharma
2020 J jnl
Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision.
CoRR
Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap
2019 J jnl
Complexity of a Root Clustering Algorithm.
CoRR
Prashant Batra, Vikram Sharma
2018 J jnl
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration.
J. Symb. Comput.
Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap
2018 — conf
Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model.
FSTTCS
Swaroop N. Prabhakar, Vikram Sharma
2017 B conf
Improved Bounds on Absolute Positiveness of Multivariate Polynomials.
ISSAC
Swaroop N. Prabhakar, Vikram Sharma
2017 J jnl
Near optimal subdivision algorithms for real root isolation.
J. Symb. Comput.
Prashant Batra, Vikram Sharma
2016 B conf
A Lower Bound for Computing Lagrange's Real Root Bound.
CASC
Swaroop N. Prabhakar, Vikram Sharma
2016 B conf
Complexity Analysis of Root Clustering for a Complex Polynomial.
ISSAC
Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap
2016 — ch.
Robust Geometric Computation.
Encyclopedia of Algorithms
Chee K. Yap, Vikram Sharma
2015 J jnl
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration.
CoRR
Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap
2015 B conf
Near Optimal Subdivision Algorithms for Real Root Isolation.
ISSAC
Vikram Sharma, Prashant Batra
2015 J jnl
Near Optimal Subdivision Algorithms for Real Root Isolation.
CoRR
Vikram Sharma, Prashant Batra
2014 — conf
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision.
ICMS
Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap
2013 C conf
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests.
CiE
Chee Yap, Michael Sagraloff, Vikram Sharma
2012 B conf
Near optimal tree size bounds on a simple real root isolation algorithm.
ISSAC
Vikram Sharma, Chee-Keng Yap
2012 — conf
Towards Exact Numerical Voronoi Diagrams.
ISVD
Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien
2011 J jnl
Applications of dimensionality reduction and exponential sums to graph automorphism.
Theor. Comput. Sci.
Madhusudan Manjunath, Vikram Sharma
2010 J jnl
Bounds on absolute positiveness of multivariate polynomials.
J. Symb. Comput.
Prashant Batra, Vikram Sharma
2008 J jnl
Complexity of real root isolation using continued fractions.
Theor. Comput. Sci.
Vikram Sharma
2008 — ch.
Robust Geometric Computation.
Encyclopedia of Algorithms
Chee-Keng Yap, Vikram Sharma
2007 B conf
Complexity of real root isolation using continued fractions.
ISSAC
Vikram Sharma
2007 J jnl
Robust Approximate Zeros in Banach Space.
Math. Comput. Sci.
Vikram Sharma
2006 B conf
Almost tight recursion tree bounds for the Descartes method.
ISSAC
Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap
2006 — —
Complexity Analysis of Algorithms in Algebraic Computation.
Vikram Sharma
2005 A conf
Robust Approximate Zeros.
ESA
Vikram Sharma, Zilin Du, Chee-Keng Yap