# Alexander I. Barvinok

According to our database

Collaborative distances:

^{1}, Alexander I. Barvinok authored at least 53 papers between 1992 and 2021.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2021

When the positive semidefinite relaxation guarantees a solution to a system of real quadratic equations.

CoRR, 2021

CoRR, 2021

2020

SIAM J. Discret. Math., 2020

Math. Comput., 2020

CoRR, 2020

CoRR, 2020

CoRR, 2020

2019

Comb. Probab. Comput., 2019

2018

CoRR, 2018

Approximating real-rooted and stable polynomials, with combinatorial applications.

CoRR, 2018

CoRR, 2018

2017

CoRR, 2017

Comb., 2017

2016

J. Comb. Theory, Ser. A, 2016

Found. Comput. Math., 2016

CoRR, 2016

Algorithms and combinatorics 30, Springer, ISBN: 978-3-319-51828-2, 2016

2015

Theory Comput., 2015

Discret. Math., 2015

CoRR, 2015

2013

Random Struct. Algorithms, 2013

Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets.

Discret. Comput. Geom., 2013

Comb., 2013

2011

Comb. Probab. Comput., 2011

2010

Random Struct. Algorithms, 2010

Comb. Probab. Comput., 2010

Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes.

Adv. Appl. Math., 2010

2008

Discret. Comput. Geom., 2008

Comb. Probab. Comput., 2008

2007

Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace.

Found. Comput. Math., 2007

2006

Math. Comput., 2006

2005

Electron. Colloquium Comput. Complex., 2005

2004

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

2003

Math. Oper. Res., 2003

J. ACM, 2003

2002

Found. Comput. Math., 2002

A course in convexity.

Graduate studies in mathematics 54, American Mathematical Society, ISBN: 978-0-8218-2968-4, 2002

2001

A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints.

Discret. Comput. Geom., 2001

1999

Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor.

Random Struct. Algorithms, 1999

1998

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Random Struct. Algorithms, 1997

Math. Program., 1997

Discret. Comput. Geom., 1997

1996

Math. Oper. Res., 1996

1995

Math. Program., 1995

Discret. Comput. Geom., 1995

Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization.

Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995

1994

A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed.

Math. Oper. Res., 1994

Discret. Comput. Geom., 1994

1993

Discret. Comput. Geom., 1993

Discret. Comput. Geom., 1993

1992

Eur. J. Comb., 1992

Optimization Problems on Matroids and Exponential Sums.

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992