Prashant Batra - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2024

Complexity of a root clustering algorithm for holomorphic functionsPrashant Batra, Vikram Sharma 0001. TCS, 999:114504, 2024. [doi]

2017

Near optimal subdivision algorithms for real root isolationPrashant Batra, Vikram Sharma 0001. JSC, 83:4-35, 2017. [doi]

Improvements of Lagrange's bound for polynomial rootsPrashant Batra, Maurice Mignotte, Doru Stefanescu. JSC, 82:19-25, 2017. [doi]

2015

Near Optimal Subdivision Algorithms for Real Root IsolationVikram Sharma 0001, Prashant Batra. issac 2015: 331-338 [doi]

On the Quality of Some Root-BoundsPrashant Batra. macis 2016: 591-595 [doi]

2010

Bounds on absolute positiveness of multivariate polynomialsPrashant Batra, Vikram Sharma. JSC, 45(6):617-628, 2010. [doi]

Globally Convergent, Iterative Path-Following for Algebraic EquationsPrashant Batra. mics, 4(4):507-537, 2010. [doi]

2008

Newton s method and the Computational Complexity of the Fundamental Theorem of AlgebraPrashant Batra. ENTCS, 202:201-218, 2008. [doi]

2007

A Framework for Modeling Operating System Mechanisms in the Simulation of Network Protocols for Real-Time Distributed SystemsPaolo Pagano, Prashant Batra, Giuseppe Lipari. ipps 2007: 1-8 [doi]

2004

Bound for all coefficient diameters of real Schur-stable interval polynomialsPrashant Batra. tac, 49(10):1851-1853, 2004. [doi]

2003

On necessary conditions for real robust Schur-stabilityPrashant Batra. tac, 48(2):259-261, 2003. [doi]

On upper bounds for real proportional stabilising controllersPrashant Batra. eucc 2003: 93-97 [doi]

Sign in or sign up to see more results.

runs on WebDSL