Alexander I. Barvinok

According to our database, Alexander I. Barvinok authored at least 55 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Smoothed counting of 0-1 points in polyhedra.

Alexander I. Barvinok

Random Struct. Algorithms, August, 2023

2022

Computing theta function.

Alexander I. Barvinok

CoRR, 2022

2021

A quick estimate for the volume of a polyhedron.

Alexander I. Barvinok, Mark Rudelson

CoRR, 2021

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

Alexander I. Barvinok

CoRR, 2021

2020

Testing for Dense Subsets in a Graph via the Partition Function.

Alexander I. Barvinok, Anthony Della Pella

SIAM J. Discret. Math., 2020

Stability and complexity of mixed discriminants.

Alexander I. Barvinok

Math. Comput., 2020

Testing systems of real quadratic equations for approximate solutions.

Alexander I. Barvinok

CoRR, 2020

More on zeros and approximation of the Ising partition function.

Alexander I. Barvinok, Nicholas Barvinok

CoRR, 2020

Integrating products of quadratic forms.

Alexander I. Barvinok

CoRR, 2020

2019

Weighted counting of solutions to sparse systems of equations.

Alexander I. Barvinok, Guus Regts

Comb. Probab. Comput., 2019

2018

Searching for dense subsets in a graph via the partition function.

Alexander I. Barvinok, Anthony Della Pella

CoRR, 2018

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

Alexander I. Barvinok

CoRR, 2018

Computing permanents of complex diagonally dominant matrices and tensors.

Alexander I. Barvinok

CoRR, 2018

2017

Weighted counting of non-negative integer points in a subspace.

Alexander I. Barvinok

CoRR, 2017

Computing the partition function for graph homomorphisms.

Alexander I. Barvinok, Pablo Soberón

Comb., 2017

2016

Computing the partition function for graph homomorphisms with multiplicities.

Alexander I. Barvinok, Pablo Soberón

J. Comb. Theory, Ser. A, 2016

Computing the Permanent of (Some) Complex Matrices.

Alexander I. Barvinok

Found. Comput. Math., 2016

Approximating permanents and hafnians of positive matrices.

Alexander I. Barvinok

CoRR, 2016

Combinatorics and Complexity of Partition Functions.

Alexander I. Barvinok

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

2015

Computing the Partition Function for Cliques in a Graph.

Alexander I. Barvinok

Theory Comput., 2015

On testing Hamiltonicity of graphs.

Alexander I. Barvinok

Discret. Math., 2015

Computing the partition function of a polynomial on the Boolean cube.

Alexander I. Barvinok

CoRR, 2015

2013

The number of graphs and a random graph with a given degree sequence.

Alexander I. Barvinok, J. A. Hartigan

Random Struct. Algorithms, 2013

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

Alexander I. Barvinok, Seung Jin Lee, Isabella Novik

Discret. Comput. Geom., 2013

A bound for the number of vertices of a polytope with applications.

Alexander I. Barvinok

Comb., 2013

2011

Computing the Partition Function for Perfect Matchings in a Hypergraph.

Alexander I. Barvinok, Alex Samorodnitsky

Comb. Probab. Comput., 2011

2010

An approximation algorithm for counting contingency tables.

Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong

Random Struct. Algorithms, 2010

What Does a Random Contingency Table Look Like?

Alexander I. Barvinok

Comb. Probab. Comput., 2010

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

Alexander I. Barvinok, J. A. Hartigan

Adv. Appl. Math., 2010

2008

A Centrally Symmetric Version of the Cyclic Polytope.

Alexander I. Barvinok, Isabella Novik

Discret. Comput. Geom., 2008

Enumerating Contingency Tables via Random Permanents.

Alexander I. Barvinok

Comb. Probab. Comput., 2008

2007

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

Alexander I. Barvinok

Found. Comput. Math., 2007

2006

Computing the Ehrhart quasi-polynomial of a rational simplex.

Alexander I. Barvinok

Math. Comput., 2006

2005

Random Weighting, Asymptotic Counting, and Inverse Isoperimetry.

Alexander I. Barvinok, Alex Samorodnitsky

Electron. Colloquium Comput. Complex., 2005

2004

Lattice Points and Lattice Polytopes.

Alexander I. Barvinok

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

2003

The Distribution of Values in the Quadratic Assignment Problem.

Alexander I. Barvinok, Tamon Stephen

Math. Oper. Res., 2003

The geometric maximum traveling salesman problem.

Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe

J. ACM, 2003

2002

Estimating L⁸ Norms by L^2k Norms for Functions on Orbits.

Alexander I. Barvinok

Found. Comput. Math., 2002

A course in convexity.

Alexander I. Barvinok

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.

Alexander I. Barvinok

Discret. Comput. Geom., 2001

1999

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

Alexander I. Barvinok

Random Struct. Algorithms, 1999

1998

The Maximum Traveling Salesman Problem Under Polyhedral Norms.

Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe

Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997

Approximate counting via random optimization.

Alexander I. Barvinok

Random Struct. Algorithms, 1997

Measure concentration in optimization.

Alexander I. Barvinok

Math. Program., 1997

Computing Mixed Discriminants, Mixed Volumes, and Permanents.

Alexander I. Barvinok

Discret. Comput. Geom., 1997

1996

Two Algorithmic Results for the Traveling Salesman Problem.

Alexander I. Barvinok

Math. Oper. Res., 1996

1995

New algorithms for linear k-matroid intersection and matroid k-parity problems.

Alexander I. Barvinok

Math. Program., 1995

Problems of Distance Geometry and Convex Properties of Quadratic Maps.

Alexander I. Barvinok

Discret. Comput. Geom., 1995

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

Alexander I. Barvinok

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.

Alexander I. Barvinok

Math. Oper. Res., 1994

Computing the Ehrhart Polynomial of a Convex Lattice Polytope.

Alexander I. Barvinok

Discret. Comput. Geom., 1994

1993

Computing the Volume, Counting Integral Points, and Exponential Sums.

Alexander I. Barvinok

Discret. Comput. Geom., 1993

Feasibility Testing for Systems of Real Quadratic Equations.

Alexander I. Barvinok

Discret. Comput. Geom., 1993

1992

On equivariant generalization of Dehn-Sommerville equations.

Alexander I. Barvinok

Eur. J. Comb., 1992

Optimization Problems on Matroids and Exponential Sums.

Alexander I. Barvinok

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