Alexander I. Barvinok

63 papers A* 3B 3Journal 53Unranked 1

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