Bahman Kalantari - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 38 from 38

2022

Characterization of local optima of polynomial modulus over a discBahman Kalantari, Fedor Andreev, Chun Lau. na, 90(2):773-787, 2022. [doi]

Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership QueriesBahman Kalantari, Yikai Zhang. TOMS, 48(2), 2022. [doi]

2020

Robust vertex enumeration for convex hulls in high dimensionsPranjal Awasthi, Bahman Kalantari, Yikai Zhang. anor, 295(1):37-73, 2020. [doi]

2019

An algorithmic separating hyperplane theorem and its applicationsBahman Kalantari. DAM, 256:59-82, 2019. [doi]

2018

Robust Vertex Enumeration for Convex Hulls in High DimensionsPranjal Awasthi, Bahman Kalantari, Yikai Zhang. aistats 2018: 1387-1396 [doi]

2015

A characterization theorem and an algorithm for a convex hull problemBahman Kalantari. anor, 226(1):301-349, 2015. [doi]

2013

On Properties of Forbidden Zones of Polygons and PolytopesRoss Berkowitz, Bahman Kalantari, Iraj Kalantari, David Menendez. tcos, 20:112-137, 2013. [doi]

Algorithms for quaternion polynomial root-findingBahman Kalantari. jc, 29(3-4):302-322, 2013. [doi]

The State of the Art of Voronoi Diagram ResearchBahman Kalantari. tcos, 20:1-4, 2013. [doi]

2012

On Properties of Forbidden Zones of Polygons and PolytopesRoss Berkowitz, Bahman Kalantari, David Menendez, Iraj Kalantari. isvd 2012: 56-65 [doi]

Voronoi Diagram Properties in Polynomials with Polynomiography Applications and ExtensionsBahman Kalantari. isvd 2012: 32-40 [doi]

Finding a Lost Treasure in Convex Hull of Points From Known DistancesBahman Kalantari. cccg 2012: 271-276 [doi]

2011

Mollified Zone Diagrams and Their ComputationSergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari. tcos, 14:31-59, 2011. [doi]

Polynomial Root-Finding Methods Whose Basins of Attraction Approximate Voronoi DiagramBahman Kalantari. dcg, 46(1):187-203, 2011. [doi]

Alternating Sign Matrices and PolynomiographyBahman Kalantari. combinatorics, 18(2), 2011. [doi]

A Geometric Modulus Principle for PolynomialsBahman Kalantari. tamm, 118(10):931-935, 2011. [doi]

2010

Maximal Zone Diagrams and their ComputationSergio Coutinho de Biasi, Bahman Kalantari, Iraj Kalantari. isvd 2010: 171-180 [doi]

2009

Voronoi Diagrams and Polynomial Root-FindingBahman Kalantari. isvd 2009: 31-40 [doi]

2005

Symmetric functions and root-finding algorithmsYi Jin, Bahman Kalantari. aam, 34(1):156-174, 2005. [doi]

An infinite family of bounds on zeros of analytic functions and relationship to Smale s boundBahman Kalantari. moc, 74(250):841-852, 2005. [doi]

Corrigendum to An infinite family of bounds on zeros of analytic functions and relationship to Smale s bound Bahman Kalantari. moc, 74(252):2101, 2005. [doi]

2004

Polynomiography and applications in art, education, and scienceBahman Kalantari. cg, 28(3):417-430, 2004. [doi]

Animation of mathematical concepts using polynomiographyBahman Kalantari, Iraj Kalantari, Fedor Andreev. siggraph 2004: 27 [doi]

2003

Polynomiography and applications in art, education, and scienceBahman Kalantari. siggraph 2003: [doi]

2000

New formulas for approximation of π and other transcendental numbersBahman Kalantari. na, 24(1-2):59-81, 2000. [doi]

On homogeneous linear recurrence relations and approximation of zeros of complex polynomialsBahman Kalantari. dimacs 2004: 125-144

1997

A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic ErrorsCelina Imielinska, Bahman Kalantari. algorithmica, 18(4):544-559, 1997.

On the Complexity of Matrix BalancingBahman Kalantari, Leonid Khachiyan, Ali Shokoufandeh. siammax, 18(2):450-463, April 1997. [doi]

1993

A Generalized Hypergreedy Algorithm for Weighted Perfect MatchingCelina Imielinska, Bahman Kalantari. bit, 33(2):178-189, 1993.

A greedy heuristic for a minimum-weight forest problemCelina Imielinska, Bahman Kalantari, Leonid Khachiyan. orl, 14(2):65-71, 1993. [doi]

On the rate of convergence of deterministic and randomized RAS matrix scaling algorithmsBahman Kalantari, Leonid Khachiyan. orl, 14(5):237-244, 1993. [doi]

1992

Generalization of Karmarkar's algorithm to convex homogeneous functionsBahman Kalantari. orl, 11(2):93-98, 1992. [doi]

Diagonal Matrix Scaling and Linear ProgrammingLeonid Khachiyan, Bahman Kalantari. siamjo, 2(4):668-672, 1992. [doi]

1989

Approximating the Diameter of a Set of Points in the Euclidean SpaceÖmer Egecioglu, Bahman Kalantari. ipl, 32(4):205-211, 1989.

1987

An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic FunctionsBahman Kalantari, J. Ben Rosen. mor, 12(3):544-561, 1987. [doi]

Penalty formulation for zero-one nonlinear programmingBahman Kalantari, J. Ben Rosen. DAM, 16(2):179-182, 1987. [doi]

1985

Technical Note - Construction of Difficult Linearly Constrained Concave Minimization ProblemsBahman Kalantari. ior, 33(1):222-227, 1985. [doi]

1982

Penalty for zero-one integer equivalent problemBahman Kalantari, J. Ben Rosen. mp, 24(1):229-232, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL