default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVikram Sharma 0001
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
- affiliation: MPI Informatik, Saarbrücken, Germany
Other persons with the same name
- Vikram Sharma 0002 — University of North Carolina at Charlotte, USA
- Vikram Sharma 0003
![[0000-0002-8668-5009]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8668-5009")
— The LNM Institute of Information Technology, Jaipur, India (and 1 more) - Vikram Sharma 0004 — Bhutta College of Engineering and Technology, Ludhiana, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2006
[b1]Vikram Sharma:
Complexity Analysis of Algorithms in Algebraic Computation. New York University, USA, 2006
Journal Articles
- 2024
- [j8]Prashant Batra, Vikram Sharma:
Complexity of a root clustering algorithm for holomorphic functions. Theor. Comput. Sci. 999: 114504 (2024) - 2020
- [j7]Swaroop N. Prabhakar, Vikram Sharma:
Improved bounds on absolute positiveness of multivariate polynomials. J. Symb. Comput. 101: 170-188 (2020) - 2018
- [j6]Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee Yap:
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. J. Symb. Comput. 86: 51-96 (2018) - 2017
- [j5]Prashant Batra, Vikram Sharma:
Near optimal subdivision algorithms for real root isolation. J. Symb. Comput. 83: 4-35 (2017) - 2011
- [j4]Madhusudan Manjunath, Vikram Sharma:
Applications of dimensionality reduction and exponential sums to graph automorphism. Theor. Comput. Sci. 412(29): 3639-3649 (2011) - 2010
- [j3]Prashant Batra, Vikram Sharma:
Bounds on absolute positiveness of multivariate polynomials. J. Symb. Comput. 45(6): 617-628 (2010) - 2008
- [j2]Vikram Sharma:
Complexity of real root isolation using continued fractions. Theor. Comput. Sci. 409(2): 292-310 (2008) - 2007
- [j1]Vikram Sharma:
Robust Approximate Zeros in Banach Space. Math. Comput. Sci. 1(1): 71-109 (2007)
Conference and Workshop Papers
- 2020
- [c13]Vikram Sharma:
Generalizing the davenport-mahler-mignotte bound. ISSAC 2020: 410-417 - 2018
- [c12]Swaroop N. Prabhakar, Vikram Sharma:
Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model. FSTTCS 2018: 45:1-45:14 - 2017
- [c11]Swaroop N. Prabhakar, Vikram Sharma:
Improved Bounds on Absolute Positiveness of Multivariate Polynomials. ISSAC 2017: 381-388 - 2016
- [c10]Swaroop N. Prabhakar, Vikram Sharma:
A Lower Bound for Computing Lagrange's Real Root Bound. CASC 2016: 444-456 - [c9]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. ISSAC 2016: 71-78 - 2015
- [c8]Vikram Sharma, Prashant Batra:
Near Optimal Subdivision Algorithms for Real Root Isolation. ISSAC 2015: 331-338 - 2014
- [c7]Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap:
Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision. ICMS 2014: 277-282 - 2013
- [c6]Chee Yap, Michael Sagraloff, Vikram Sharma:
Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests. CiE 2013: 434-444 - 2012
- [c5]Vikram Sharma, Chee-Keng Yap:
Near optimal tree size bounds on a simple real root isolation algorithm. ISSAC 2012: 319-326 - [c4]Chee-Keng Yap, Vikram Sharma, Jyh-Ming Lien:
Towards Exact Numerical Voronoi Diagrams. ISVD 2012: 2-16 - 2007
- [c3]Vikram Sharma:
Complexity of real root isolation using continued fractions. ISSAC 2007: 339-346 - 2006
- [c2]Arno Eigenwillig, Vikram Sharma, Chee-Keng Yap:
Almost tight recursion tree bounds for the Descartes method. ISSAC 2006: 71-78 - 2005
- [c1]Vikram Sharma, Zilin Du, Chee-Keng Yap:
Robust Approximate Zeros. ESA 2005: 874-886
Reference Works
- 2016
- [r2]Chee K. Yap, Vikram Sharma:
Robust Geometric Computation. Encyclopedia of Algorithms 2016: 1860-1863 - 2008
- [r1]Chee-Keng Yap, Vikram Sharma:
Robust Geometric Computation. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2021
- [i6]Ruben Becker, Michael Sagraloff, Vikram Sharma, Juan Xu, Chee Yap:
Complexity Analysis of Root Clustering for a Complex Polynomial. CoRR abs/2105.05183 (2021) - 2020
- [i5]Vikram Sharma:
Generalizing The Davenport-Mahler-Mignotte Bound - The Weighted Case. CoRR abs/2005.07843 (2020) - [i4]Jyh-Ming Lien, Vikram Sharma, Gert Vegter, Chee Yap:
Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision. CoRR abs/2009.00811 (2020) - 2019
- [i3]Prashant Batra, Vikram Sharma:
Complexity of a Root Clustering Algorithm. CoRR abs/1912.02820 (2019) - 2015
- [i2]Vikram Sharma, Prashant Batra:
Near Optimal Subdivision Algorithms for Real Root Isolation. CoRR abs/1501.07774 (2015) - [i1]Ruben Becker, Michael Sagraloff, Vikram Sharma, Chee-Keng Yap:
A Simple Near-Optimal Subdivision Algorithm for Complex Root Isolation based on the Pellet Test and Newton Iteration. CoRR abs/1509.06231 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
