Alexander I. Barvinok

Publication Activity (10 Years)

Years Active: 1992-2023
Publications (10 Years): 23

Top Topics

Approximate Solutions

Partition Function

Top Venues

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

Alexander I. Barvinok
Smoothed counting of 0-1 points in polyhedra. Random Struct. Algorithms 63 (1) (2023)
Alexander I. Barvinok
Computing theta function. CoRR (2022)
Alexander I. Barvinok
When the positive semidefinite relaxation guarantees a solution to a system of real quadratic equations. CoRR (2021)
Alexander I. Barvinok, Mark Rudelson
A quick estimate for the volume of a polyhedron. CoRR (2021)
Alexander I. Barvinok
Smoothed counting of 0-1 points in polyhedra. CoRR (2021)
Alexander I. Barvinok
Integrating products of quadratic forms. CoRR (2020)
Alexander I. Barvinok, Nicholas Barvinok
More on zeros and approximation of the Ising partition function. CoRR (2020)
Alexander I. Barvinok
Stability and complexity of mixed discriminants. Math. Comput. 89 (322) (2020)
Alexander I. Barvinok
Testing systems of real quadratic equations for approximate solutions. CoRR (2020)
Alexander I. Barvinok, Anthony Della Pella
Testing for Dense Subsets in a Graph via the Partition Function. SIAM J. Discret. Math. 34 (1) (2020)
Alexander I. Barvinok, Guus Regts
Weighted counting of solutions to sparse systems of equations. Comb. Probab. Comput. 28 (5) (2019)
Alexander I. Barvinok, Anthony Della Pella
Searching for dense subsets in a graph via the partition function. CoRR (2018)
Alexander I. Barvinok
Computing permanents of complex diagonally dominant matrices and tensors. CoRR (2018)
Alexander I. Barvinok
Approximating real-rooted and stable polynomials, with combinatorial applications. CoRR (2018)
Alexander I. Barvinok
Stability and complexity of mixed discriminants. CoRR (2018)
Alexander I. Barvinok
Weighted counting of non-negative integer points in a subspace. CoRR (2017)
Alexander I. Barvinok, Pablo Soberón
Computing the partition function for graph homomorphisms. Comb. 37 (4) (2017)
Alexander I. Barvinok, Pablo Soberón
Computing the partition function for graph homomorphisms with multiplicities. J. Comb. Theory, Ser. A 137 (2016)
Alexander I. Barvinok
Approximating permanents and hafnians of positive matrices. CoRR (2016)
Alexander I. Barvinok
Computing the Permanent of (Some) Complex Matrices. Found. Comput. Math. 16 (2) (2016)
Alexander I. Barvinok
Computing the partition function of a polynomial on the Boolean cube. CoRR (2015)
Alexander I. Barvinok
On testing Hamiltonicity of graphs. Discret. Math. 338 (1) (2015)
Alexander I. Barvinok
Computing the Partition Function for Cliques in a Graph. Theory Comput. 11 (2015)
Alexander I. Barvinok
Computing the permanent of (some) complex matrices. CoRR (2014)
Alexander I. Barvinok, Seung Jin Lee, Isabella Novik
Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets. Discret. Comput. Geom. 49 (3) (2013)
Alexander I. Barvinok
A bound for the number of vertices of a polytope with applications. Comb. 33 (1) (2013)
Alexander I. Barvinok, J. A. Hartigan
The number of graphs and a random graph with a given degree sequence. Random Struct. Algorithms 42 (3) (2013)
Alexander I. Barvinok, Alex Samorodnitsky
Computing the Partition Function for Perfect Matchings in a Hypergraph. Comb. Probab. Comput. 20 (6) (2011)
Alexander I. Barvinok
What Does a Random Contingency Table Look Like? Comb. Probab. Comput. 19 (4) (2010)
Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong
An approximation algorithm for counting contingency tables. Random Struct. Algorithms 37 (1) (2010)
Alexander I. Barvinok, J. A. Hartigan
Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes. Adv. Appl. Math. 45 (2) (2010)
Alexander I. Barvinok
Enumerating Contingency Tables via Random Permanents. Comb. Probab. Comput. 17 (1) (2008)
Alexander I. Barvinok, Isabella Novik
A Centrally Symmetric Version of the Cyclic Polytope. Discret. Comput. Geom. 39 (1-3) (2008)
Alexander I. Barvinok
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace. Found. Comput. Math. 7 (2) (2007)
Alexander I. Barvinok
Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75 (255) (2006)
Alexander I. Barvinok, Alex Samorodnitsky
Random Weighting, Asymptotic Counting, and Inverse Isoperimetry. Electron. Colloquium Comput. Complex. (065) (2005)
Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
The geometric maximum traveling salesman problem. J. ACM 50 (5) (2003)
Alexander I. Barvinok, Tamon Stephen
The Distribution of Values in the Quadratic Assignment Problem. Math. Oper. Res. 28 (1) (2003)
Alexander I. Barvinok, Tamon Stephen
The Distribution of Values in the Quadratic Assignment Problem. IPCO (2002)
Alexander I. Barvinok
Norms for Functions on Orbits. Found. Comput. Math. 2 (4) (2002)
Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
The Geometric Maximum Traveling Salesman Problem CoRR (2002)
Alexander I. Barvinok
A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints. Discret. Comput. Geom. 25 (1) (2001)
Alexander I. Barvinok
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor. Random Struct. Algorithms 14 (1) (1999)
Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO (1998)
Alexander I. Barvinok
Approximate counting via random optimization. Random Struct. Algorithms 11 (2) (1997)
Alexander I. Barvinok
Computing Mixed Discriminants, Mixed Volumes, and Permanents. Discret. Comput. Geom. 18 (2) (1997)
Alexander I. Barvinok
Measure concentration in optimization. Math. Program. 79 (1997)
Alexander I. Barvinok
Two Algorithmic Results for the Traveling Salesman Problem. Math. Oper. Res. 21 (1) (1996)
Alexander I. Barvinok
New algorithms for linear k-matroid intersection and matroid k-parity problems. Math. Program. 69 (1995)
Alexander I. Barvinok
Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization. FOCS (1995)
Alexander I. Barvinok
Problems of Distance Geometry and Convex Properties of Quadratic Maps. Discret. Comput. Geom. 13 (1995)
Alexander I. Barvinok
Computing the Ehrhart Polynomial of a Convex Lattice Polytope. Discret. Comput. Geom. 12 (1994)
Alexander I. Barvinok
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed. Math. Oper. Res. 19 (4) (1994)
Alexander I. Barvinok
Computing the Volume, Counting Integral Points, and Exponential Sums. Discret. Comput. Geom. 10 (1993)
Alexander I. Barvinok
Feasibility Testing for Systems of Real Quadratic Equations. Discret. Comput. Geom. 10 (1993)
Alexander I. Barvinok
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed FOCS (1993)
Alexander I. Barvinok
Computing the Volume, Counting Integral Points, and Exponential Sums. SCG (1992)
Alexander I. Barvinok
On equivariant generalization of Dehn-Sommerville equations. Eur. J. Comb. 13 (6) (1992)
Alexander I. Barvinok
Feasibility Testing for Systems of Real Quadratic Equations STOC (1992)
Alexander I. Barvinok
Optimization Problems on Matroids and Exponential Sums. IPCO (1992)