default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrashant Batra
Person information
- affiliation: Hamburg University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Prashant Batra
, Vikram Sharma:
Complexity of a root clustering algorithm for holomorphic functions. Theor. Comput. Sci. 999: 114504 (2024)- [i3]Prashant Batra:
Bounds for the maximum modulus of polynomial roots with nearly optimal worst-case overestimation. CoRR abs/2411.16385 (2024)
2010 – 2019
- 2019
- [i2]Prashant Batra, Vikram Sharma:
Complexity of a Root Clustering Algorithm. CoRR abs/1912.02820 (2019) - 2017
- [j6]Prashant Batra, Maurice Mignotte, Doru Stefanescu:
Improvements of Lagrange's bound for polynomial roots. J. Symb. Comput. 82: 19-25 (2017) - [j5]Prashant Batra, Vikram Sharma:
Near optimal subdivision algorithms for real root isolation. J. Symb. Comput. 83: 4-35 (2017) - 2015
- [c5]Vikram Sharma, Prashant Batra:
Near Optimal Subdivision Algorithms for Real Root Isolation. ISSAC 2015: 331-338 - [c4]Prashant Batra:
On the Quality of Some Root-Bounds. MACIS 2015: 591-595 - [i1]Vikram Sharma, Prashant Batra:
Near Optimal Subdivision Algorithms for Real Root Isolation. CoRR abs/1501.07774 (2015) - 2010
- [j4]Prashant Batra, Vikram Sharma:
Bounds on absolute positiveness of multivariate polynomials. J. Symb. Comput. 45(6): 617-628 (2010) - [j3]Prashant Batra:
Globally Convergent, Iterative Path-Following for Algebraic Equations. Math. Comput. Sci. 4(4): 507-537 (2010)
2000 – 2009
- 2007
- [c3]Paolo Pagano, Prashant Batra, Giuseppe Lipari:
A Framework for Modeling Operating System Mechanisms in the Simulation of Network Protocols for Real-Time Distributed Systems. IPDPS 2007: 1-8 - [c2]Prashant Batra:
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra. CCA 2007: 201-218 - 2004
- [j2]Prashant Batra:
Bound for all coefficient diameters of real Schur-stable interval polynomials. IEEE Trans. Autom. Control. 49(10): 1851-1853 (2004) - 2003
- [j1]Prashant Batra:
On necessary conditions for real robust Schur-stability. IEEE Trans. Autom. Control. 48(2): 259-261 (2003) - [c1]Prashant Batra:
On upper bounds for real proportional stabilising controllers. ECC 2003: 93-97
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 2025-01-09 13:25 CET 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:
