Alexander I. Barvinok

  • University of Michigan, Ann Arbor, USA

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

Collaborative distances:



In proceedings 
PhD thesis 




Computing theta function.
CoRR, 2022

A quick estimate for the volume of a polyhedron.
CoRR, 2021

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

Smoothed counting of 0-1 points in polyhedra.
CoRR, 2021

Testing for Dense Subsets in a Graph via the Partition Function.
SIAM J. Discret. Math., 2020

Stability and complexity of mixed discriminants.
Math. Comput., 2020

Testing systems of real quadratic equations for approximate solutions.
CoRR, 2020

More on zeros and approximation of the Ising partition function.
CoRR, 2020

Integrating products of quadratic forms.
CoRR, 2020

Weighted counting of solutions to sparse systems of equations.
Comb. Probab. Comput., 2019

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

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

Computing permanents of complex diagonally dominant matrices and tensors.
CoRR, 2018

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

Computing the partition function for graph homomorphisms.
Comb., 2017

Computing the partition function for graph homomorphisms with multiplicities.
J. Comb. Theory, Ser. A, 2016

Computing the Permanent of (Some) Complex Matrices.
Found. Comput. Math., 2016

Approximating permanents and hafnians of positive matrices.
CoRR, 2016

Combinatorics and Complexity of Partition Functions.
Algorithms and combinatorics 30, Springer, ISBN: 978-3-319-51828-2, 2016

Computing the Partition Function for Cliques in a Graph.
Theory Comput., 2015

On testing Hamiltonicity of graphs.
Discret. Math., 2015

Computing the partition function of a polynomial on the Boolean cube.
CoRR, 2015

The number of graphs and a random graph with a given degree sequence.
Random Struct. Algorithms, 2013

Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets.
Discret. Comput. Geom., 2013

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

Computing the Partition Function for Perfect Matchings in a Hypergraph.
Comb. Probab. Comput., 2011

An approximation algorithm for counting contingency tables.
Random Struct. Algorithms, 2010

What Does a Random Contingency Table Look Like?
Comb. Probab. Comput., 2010

Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes.
Adv. Appl. Math., 2010

A Centrally Symmetric Version of the Cyclic Polytope.
Discret. Comput. Geom., 2008

Enumerating Contingency Tables via Random Permanents.
Comb. Probab. Comput., 2008

Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace.
Found. Comput. Math., 2007

Computing the Ehrhart quasi-polynomial of a rational simplex.
Math. Comput., 2006

Random Weighting, Asymptotic Counting, and Inverse Isoperimetry.
Electron. Colloquium Comput. Complex., 2005

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

The Distribution of Values in the Quadratic Assignment Problem.
Math. Oper. Res., 2003

The geometric maximum traveling salesman problem.
J. ACM, 2003

Estimating L<sup>8</sup> Norms by L<sup>2k</sup> Norms for Functions on Orbits.
Found. Comput. Math., 2002

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

A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints.
Discret. Comput. Geom., 2001

Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor.
Random Struct. Algorithms, 1999

The Maximum Traveling Salesman Problem Under Polyhedral Norms.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

Approximate counting via random optimization.
Random Struct. Algorithms, 1997

Measure concentration in optimization.
Math. Program., 1997

Computing Mixed Discriminants, Mixed Volumes, and Permanents.
Discret. Comput. Geom., 1997

Two Algorithmic Results for the Traveling Salesman Problem.
Math. Oper. Res., 1996

New algorithms for linear k-matroid intersection and matroid k-parity problems.
Math. Program., 1995

Problems of Distance Geometry and Convex Properties of Quadratic Maps.
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

A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed.
Math. Oper. Res., 1994

Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
Discret. Comput. Geom., 1994

Computing the Volume, Counting Integral Points, and Exponential Sums.
Discret. Comput. Geom., 1993

Feasibility Testing for Systems of Real Quadratic Equations.
Discret. Comput. Geom., 1993

On equivariant generalization of Dehn-Sommerville equations.
Eur. J. Comb., 1992

Optimization Problems on Matroids and Exponential Sums.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992