default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Bahman Kalantari
Department of Computer Science, Rutgers University, New Brunswick, NJ, USA
Likely matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 69 matches
- 2023
- Bahman Kalantari:
Solution of Real Cubic Equations without Cardano's Formula. CoRR abs/2303.17747 (2023) - Bahman Kalantari:
A Family of Iteration Functions for General Linear Systems. CoRR abs/2304.04940 (2023) - 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
- Bahman Kalantari, Fedor Andreev, Chun Lau:
Characterization of local optima of polynomial modulus over a disc. Numer. Algorithms 90(2): 773-787 (2022) - 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
- Pranjal Awasthi, Bahman Kalantari, Yikai Zhang:
Robust vertex enumeration for convex hulls in high dimensions. Ann. Oper. Res. 295(1): 37-73 (2020) - Bahman Kalantari:
A Globally Convergent Newton Method for Polynomials. CoRR abs/2003.00372 (2020) - Bahman Kalantari, Chun Lau, Yikai Zhang:
A Geometric Algorithm for Solving Linear Systems. CoRR abs/2004.12978 (2020) - 2019
- Bahman Kalantari:
An algorithmic separating hyperplane theorem and its applications. Discret. Appl. Math. 256: 59-82 (2019) - Bahman Kalantari:
A Triangle Algorithm for Semidefinite Version of Convex Hull Membership Problem. CoRR abs/1904.09854 (2019) - Bahman Kalantari:
On the Equivalence of SDP Feasibility and a Convex Hull Relaxation for System of Quadratic Equations. CoRR abs/1911.03989 (2019) - 2018
- Pranjal Awasthi, Bahman Kalantari, Yikai Zhang:
Robust Vertex Enumeration for Convex Hulls in High Dimensions. AISTATS 2018: 1387-1396 - Pranjal Awasthi, Bahman Kalantari, Yikai Zhang:
Robust Vertex Enumeration for Convex Hulls in High Dimensions. CoRR abs/1802.01515 (2018) - Bahman Moghimi, Navid Kalantari, Camille Kamga, Kyriacos C. Mouskos:
Simultaneous Optimization of Signal Timing and Capacity Improvement in Urban Transportation Networks Using Simulated Annealing. CoRR abs/1802.01717 (2018) - Bahman Kalantari, Chun Lau:
The Multilinear Minimax Relaxation of Bimatrix Games and Comparison with Nash Equilibria via Lemke-Howson. CoRR abs/1809.01717 (2018) - Bahman Kalantari:
An O(1/ε)-Iteration Triangle Algorithm for A Convex Hull Membership. CoRR abs/1810.07346 (2018) - 2017
- Bahman Kalantari:
An Invitation to Polynomiography via Exponential Series. CoRR abs/1707.09417 (2017) - 2016
- Terence Coelho, Bahman Kalantari:
How Many Real Attractive Fixed Points Can A Polynomial Have? CoRR abs/1605.07859 (2016) - Mayank Gupta, Bahman Kalantari:
A Comparison of the Triangle Algorithm and SMO for Solving the Hard Margin Problem. CoRR abs/1611.01856 (2016) - Bahman Kalantari:
A Necessary and Sufficient Condition for Local Maxima of Polynomial Modulus Over Unit Disc. CoRR abs/1605.00621 (2016) - 2015
- Bahman Kalantari:
A characterization theorem and an algorithm for a convex hull problem. Ann. Oper. Res. 226(1): 301-349 (2015) - 2014
- Sharareh Alipour, Bahman Kalantari, Hamid Homapour:
Fast Approximation and Randomized Algorithms for Diameter. CoRR abs/1410.2195 (2014) - Fedor Andreev, Bahman Kalantari:
Algorithms and Polynomiography for Solving Quaternion Quadratic Equations. CoRR abs/1409.2030 (2014) - Bahman Kalantari:
Solving Cubic Equations By the Quadratic Formula. CoRR abs/1401.5148 (2014) - Bahman Kalantari:
A One-Line Proof of the Fundamental Theorem of Algebra with Newton's Method as a Consequence. CoRR abs/1409.2056 (2014) - Bahman Kalantari:
Randomized Triangle Algorithms for Convex Hull Membership. CoRR abs/1410.3564 (2014) - Bahman Kalantari:
An Algorithmic Separating Hyperplane Theorem and Its Applications. CoRR abs/1412.0356 (2014) - Bahman Kalantari, Eric Lee:
Newton-Ellipsoid Method and its Polynomiography. CoRR abs/1410.2202 (2014) - 2013
- Bahman Kalantari:
Algorithms for quaternion polynomial root-finding. J. Complex. 29(3-4): 302-322 (2013) - Ross Berkowitz, Bahman Kalantari, Iraj Kalantari, David Menendez:
On Properties of Forbidden Zones of Polygons and Polytopes. Trans. Comput. Sci. 20: 112-137 (2013)
skipping 39 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-02 06:00 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint