default search action
Bahman Kalantari
Person information
- affiliation: Department of Computer Science, Rutgers University, New Brunswick, NJ, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [i23]Bahman Kalantari:
Solution of Real Cubic Equations without Cardano's Formula. CoRR abs/2303.17747 (2023) - [i22]Bahman Kalantari:
A Family of Iteration Functions for General Linear Systems. CoRR abs/2304.04940 (2023) - [i21]Chun Lau, Bahman Kalantari:
On the Performance of a Novel Class of Linear System Solvers and Comparison with State-of-The-Art Algorithms. CoRR abs/2304.12168 (2023) - 2022
- [j34]Bahman Kalantari, Fedor Andreev, Chun Lau:
Characterization of local optima of polynomial modulus over a disc. Numer. Algorithms 90(2): 773-787 (2022) - [j33]Bahman Kalantari
, Yikai Zhang:
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries. ACM Trans. Math. Softw. 48(2): 23:1-23:32 (2022) - 2020
- [j32]Pranjal Awasthi, Bahman Kalantari, Yikai Zhang:
Robust vertex enumeration for convex hulls in high dimensions. Ann. Oper. Res. 295(1): 37-73 (2020) - [i20]Bahman Kalantari:
A Globally Convergent Newton Method for Polynomials. CoRR abs/2003.00372 (2020) - [i19]Bahman Kalantari, Chun Lau, Yikai Zhang:
A Geometric Algorithm for Solving Linear Systems. CoRR abs/2004.12978 (2020)
2010 – 2019
- 2019
- [j31]Bahman Kalantari
An algorithmic separating hyperplane theorem and its applications. Discret. Appl. Math. 256: 59-82 (2019) - [i18]Bahman Kalantari:
A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem. CoRR abs/1904.09854 (2019) - [i17]Bahman Kalantari:
On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations. CoRR abs/1911.03989 (2019) - 2018
- [c9]Pranjal Awasthi, Bahman Kalantari, Yikai Zhang:
Robust Vertex Enumeration for Convex Hulls in High Dimensions. AISTATS 2018: 1387-1396 - [i16]Pranjal Awasthi, Bahman Kalantari, Yikai Zhang:
Robust Vertex Enumeration for Convex Hulls in High Dimensions. CoRR abs/1802.01515 (2018) - [i15]Bahman Kalantari, Chun Lau:
The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson. CoRR abs/1809.01717 (2018) - [i14]Bahman Kalantari:
An O(1/ε)-Iteration Triangle Algorithm for A Convex Hull Membership. CoRR abs/1810.07346 (2018) - 2017
- [i13]Bahman Kalantari:
An Invitation to Polynomiography via Exponential Series. CoRR abs/1707.09417 (2017) - 2016
- [i12]Bahman Kalantari:
A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc. CoRR abs/1605.00621 (2016) - [i11]Terence Coelho, Bahman Kalantari:
How Many Real Attractive Fixed Points Can A Polynomial Have? CoRR abs/1605.07859 (2016) - [i10]Mayank Gupta, Bahman Kalantari:
A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem. CoRR abs/1611.01856 (2016) - 2015
- [j30]Bahman Kalantari:
A characterization theorem and an algorithm for a convex hull problem. Ann. Oper. Res. 226(1): 301-349 (2015) - 2014
- [i9]Bahman Kalantari:
Solving Cubic Equations By the Quadratic Formula. CoRR abs/1401.5148 (2014) - [i8]Fedor Andreev, Bahman Kalantari:
Algorithms and Polynomiography for Solving Quaternion Quadratic Equations. CoRR abs/1409.2030 (2014) - [i7]Bahman Kalantari:
A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence. CoRR abs/1409.2056 (2014) - [i6]Sharareh Alipour, Bahman Kalantari, Hamid Homapour:
Fast Approximation and Randomized Algorithms for Diameter. CoRR abs/1410.2195 (2014) - [i5]Bahman Kalantari, Eric Lee:
Newton-Ellipsoid Method and its Polynomiography. CoRR abs/1410.2202 (2014) - [i4]Bahman Kalantari:
Randomized Triangle Algorithms for Convex Hull Membership. CoRR abs/1410.3564 (2014) - [i3]Bahman Kalantari:
An Algorithmic Separating Hyperplane Theorem and Its Applications. CoRR abs/1412.0356 (2014) - 2013
- [j29]Bahman Kalantari:
Algorithms for quaternion polynomial root-finding. J. Complex. 29(3-4): 302-322 (2013) - [j28]Bahman Kalantari:
The State of the Art of Voronoi Diagram Research. Trans. Comput. Sci. 20: 1-4 (2013) - [j27]Ross Berkowitz, Bahman Kalantari, Iraj Kalantari, David Menendez:
On Properties of Forbidden Zones of Polygons and Polytopes. Trans. Comput. Sci. 20: 112-137 (2013) - [e1]Marina L. Gavrilova, C. J. Kenneth Tan, Bahman Kalantari:
Transactions on Computational Science XX - Special Issue on Voronoi Diagrams and Their Applications. Lecture Notes in Computer Science 8110, Springer 2013, ISBN 978-3-642-41904-1 [contents] - 2012
- [c8]Bahman Kalantari:
Finding a Lost Treasure in Convex Hull of Points From Known Distances. CCCG 2012: 271-276 - [c7]Bahman Kalantari:
Voronoi Diagram Properties in Polynomials with Polynomiography Applications and Extensions. ISVD 2012: 32-40 - [c6]Ross Berkowitz, Bahman Kalantari, David Menendez, Iraj Kalantari:
On Properties of Forbidden Zones of Polygons and Polytopes. ISVD 2012: 56-65 - [i2]Bahman Kalantari:
A Characterization Theorem and An Algorithm for A Convex Hull Problem. CoRR abs/1204.1873 (2012) - [i1]Bahman Kalantari:
Solving Linear System of Equations Via A Convex Hull Algorithm. CoRR abs/1210.7858 (2012) - 2011
- [j26]Bahman Kalantari:
Alternating Sign Matrices and Polynomiography. Electron. J. Comb. 18(2) (2011) - [j25]Bahman Kalantari:
Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi Diagram. Discret. Comput. Geom. 46(1): 187-203 (2011) - [j24]Bahman Kalantari:
A Geometric Modulus Principle for Polynomials. Am. Math. Mon. 118(10): 931-935 (2011) - [j23]Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari:
Mollified Zone Diagrams and Their Computation. Trans. Comput. Sci. 14: 31-59 (2011) - 2010
- [c5]Sergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari:
Maximal Zone Diagrams and their Computation. ISVD 2010: 171-180
2000 – 2009
- 2009
- [c4]Bahman Kalantari:
Voronoi Diagrams and Polynomial Root-Finding. ISVD 2009: 31-40 - 2008
- [j22]Bahman Kalantari, Isabella Lari
On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Math. Program. 112(2): 371-401 (2008) - 2005
- [j21]Yi Jin, Bahman Kalantari:
Symmetric functions and root-finding algorithms. Adv. Appl. Math. 34(1): 156-174 (2005) - [j20]Bahman Kalantari:
An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound. Math. Comput. 74(250): 841-852 (2005) - [j19]Bahman Kalantari:
Corrigendum to "An infinite family of bounds on zeros of analytic functions and relationship to Smale's bound". Math. Comput. 74(252): 2101 (2005) - 2004
- [j18]Bahman Kalantari:
Polynomiography and applications in art, education, and science. Comput. Graph. 28(3): 417-430 (2004) - [c3]Bahman Kalantari, Iraj Kalantari, Fedor Andreev:
Animation of mathematical concepts using polynomiography. SIGGRAPH Educators Program 2004: 27 - 2003
- [c2]Bahman Kalantari:
Polynomiography and applications in art, education, and science. SIGGRAPH Educators Program 2003 - 2000
- [j17]Bahman Kalantari:
New formulas for approximation of π and other transcendental numbers. Numer. Algorithms 24(1-2): 59-81 (2000) - [c1]Bahman Kalantari:
On homogeneous linear recurrence relations and approximation of zeros of complex polynomials. Unusual Applications of Number Theory 2000: 125-143
1990 – 1999
- 1997
- [j16]Celina Imielinska, Bahman Kalantari:
A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors. Algorithmica 18(4): 544-559 (1997) - [j15]Bahman Kalantari, Leonid Khachiyan, Ali Shokoufandeh:
On the Complexity of Matrix Balancing. SIAM J. Matrix Anal. Appl. 18(2): 450-463 (1997) - 1996
- [j14]Bahman Kalantari, Gholamreza B. Khosrovshahi:
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. Networks 28(4): 211-219 (1996) - 1993
- [j13]Celina Imielinska, Bahman Kalantari:
A Generalized Hypergreedy Algorithm for Weighted Perfect Matching. BIT 33(2): 177-189 (1993) - [j12]Celina Imielinska, Bahman Kalantari, Leonid Khachiyan:
A greedy heuristic for a minimum-weight forest problem. Oper. Res. Lett. 14(2): 65-71 (1993) - [j11]Bahman Kalantari, Leonid Khachiyan:
On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms. Oper. Res. Lett. 14(5): 237-244 (1993) - 1992
- [j10]Bahman Kalantari:
Generalization of Karmarkar's algorithm to convex homogeneous functions. Oper. Res. Lett. 11(2): 93-98 (1992) - [j9]Leonid Khachiyan, Bahman Kalantari:
Diagonal Matrix Scaling and Linear Programming. SIAM J. Optim. 2(4): 668-672 (1992) - 1990
- [j8]Bahman Kalantari:
Karmarkar's Algorithm with Improved Steps. Math. Program. 46: 73-78 (1990)
1980 – 1989
- 1989
- [j7]Ömer Egecioglu, Bahman Kalantari:
Approximating the Diameter of a Set of Points in the Euclidean Space. Inf. Process. Lett. 32(4): 205-211 (1989) - 1988
- [j6]Michael D. Grigoriadis, Bahman Kalantari:
A new class of heuristic algorithms for weighted perfect matching. J. ACM 35(4): 769-776 (1988) - 1987
- [j5]Bahman Kalantari, J. Ben Rosen:
Penalty formulation for zero-one nonlinear programming. Discret. Appl. Math. 16(2): 179-182 (1987) - [j4]Bahman Kalantari, J. Ben Rosen:
An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions. Math. Oper. Res. 12(3): 544-561 (1987) - 1986
- [j3]Michael D. Grigoriadis, Bahman Kalantari:
A Lower Bound to the Complexity of Euclidean and Rectilinear Matching Algorithms. Inf. Process. Lett. 22(2): 73-76 (1986) - 1985
- [j2]Bahman Kalantari:
Technical Note - Construction of Difficult Linearly Constrained Concave Minimization Problems. Oper. Res. 33(1): 222-227 (1985) - 1982
- [j1]Bahman Kalantari, J. Ben Rosen:
Penalty for zero-one integer equivalent problem. Math. Program. 24(1): 229-232 (1982)
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-05-02 21:46 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: