A. Barvinok

发表

Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor

A. Barvinok, 1999 .

A course in convexity

Alexander Barvinok, A. Barvinok, 2002, Graduate studies in mathematics.

Approximating Orthogonal Matrices by Permutation Matrices

A. Barvinok, 2005, math/0510612.

Computing the Partition Function for Cliques in a Graph

Alexander I. Barvinok, A. Barvinok, 2014, Theory Comput..

Problems of distance geometry and convex properties of quadratic maps

Alexander I. Barvinok, A. Barvinok, 1995, Discret. Comput. Geom..

On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries☆

A. Barvinok, 2008, 0806.1480.

A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

A. Barvinok, 1994 .

Short rational generating functions for lattice point problems

A. Barvinok, Kevin M. Woods, 2002, math/0211146.

An Algorithmic Theory of Lattice Points in Polyhedra

A. Barvinok, James Pommersheim, 1999 .

Thrifty approximations of convex bodies by polytopes

A. Barvinok, 2012, 1206.3993.

Convex hulls of orbits of representations of finite groups and combinatorial optimization

A. Vershik, A. Barvinok, 1988 .

Convex geometry of orbits.

Grigoriy Blekherman, A. Barvinok, 2003, math/0312268.

Computational complexity of immanents and representations of the full linear group

A. Barvinok, 1990 .

THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES

A. Barvinok, Ellen Veomett, 2006, math/0610325.

Approximations of convex bodies by polytopes and by projections of spectrahedra

A. Barvinok, 2012, 1204.0471.

Mathematisches Forschungsinstitut Oberwolfach Report No . 4 / 2007 Geometric and Topological Combinatorics Organised

G. Ziegler, H. Edelsbrunner, A. Barvinok, 2007 .

Mathematisches Forschungsinstitut Oberwolfach Approximation Algorithms for Np-hard Problems Workshop: Approximation Algorithms for Np-hard Problems Table of Contents Artur Czumaj (joint with Christian Sohler and in Part with Mihai B˘ Adoiu, Piotr Indyk, and Anastasios Sidiropoulos) Sublinear Time Ap

H. Prömel, U. Feige, A. Barvinok, 2022 .

Counting magic squares in quasi-polynomial time

A. Barvinok, Alex Samorodnitsky, A. Yong, 2007, math/0703227.

Convexity of the image of a quadratic map via the relative entropy distance

A. Barvinok, 2013, 1305.0243.

Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes

Alexander Barvinok, A. Barvinok, 2007, 0709.3810.

New Permanent Estimators via Non-Commutative Determinants

Alexander Barvinok, A. Barvinok, 2000 .

THICKENINGS OF THE CIRCLE AND CENTRALLY – SYMMETRIC ORBITOPES Given a metric space X and scale parameter r > 0 , the associated Vietoris –

F. Frick, A. Barvinok, J. Hausmann, 2018 .

NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE

Seung Jin Lee, A. Barvinok, I. Novik, 2011, 1104.5168.

THICKENINGS OF THE CIRCLE AND CENTRALLY – SYMMETRIC ORBITOPES Submitted

F. Frick, A. Barvinok, J. Hausmann, 2018 .

Centrally symmetric polytopes with many faces

Seung Jin Lee, A. Barvinok, I. Novik, 2011, 1106.0449.

Combinatorial complexity of orbits in representations of the symmetric group

A. Barvinok, A. Barvinok, 1992 .

An approximation algorithm for counting contingency tables

Alex Samorodnitsky, Alexander Barvinok, Zur Luria, 2010 .

Matrices with prescribed row and column sums

Alexander Barvinok, A. Barvinok, 2010, 1010.5706.

Brunn–Minkowski inequalities for contingency tables and integer flows

A. Barvinok, 2006, math/0603655.

An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums

Alexander Barvinok, J. A. Hartigan, J. Hartigan, 2009 .

Maximum Entropy Edgeworth Estimates of Volumes of Polytopes

J. Hartigan, A. Barvinok, 2009 .

7: Lattice points and lattice polytopes

A. Barvinok, 2017 .

Counting Integer Points in Higher-Dimensional Polytopes

A. Barvinok, 2017 .

Some algorithmic applications of partition functions in combinatorics

A. Barvinok, 2016 .

Concentration of the mixed discriminant of well-conditioned matrices

A. Barvinok, 2015, 1506.03308.

The Geometry and Combinatorics of Ehrhart δ-Vectors

A. Barvinok, J. Lagarias, S. Fomin, 2009 .

Partition functions for dense instances of combinatorial enumeration problems

A. Barvinok, 2013, 1305.2533.

Sparse Interpolation of Symmetric Polynomials

A. Barvinok, S. Fomin, 1997 .

The Tensorization Trick in Convex Geometry

A. Barvinok, 2018 .

Norms by L 2 k Norms for Functions on Orbits

A. Barvinok, 2002 .

2 7 O ct 2 01 0 MATRICES WITH PRESCRIBED ROW AND COLUMN SUMS

A. Barvinok, 2018 .

A quick estimate for the volume of a polyhedron

M. Rudelson, A. Barvinok, 2021, ArXiv.

Computing the Ehrhart quasi-polynomial of a rational simplex

A. Barvinok, 2005, Math. Comput..

Short rational generating functions for lattice point problems

A. Barvinok, Kevin M. Woods, 2002, math/0211146.

The distance approach to approximate combinatorial counting

A. Barvinok, Alex Samorodnitsky, 2000, math/0005263.

Enumerating Contingency Tables via Random Permanents

A. Barvinok, 2005, Combinatorics, Probability and Computing.

Counting magic squares in quasi-polynomial time

A. Barvinok, Alex Samorodnitsky, A. Yong, 2007, math/0703227.

Random weighting, asymptotic counting, and inverse isoperimetry

A. Barvinok, Alex Samorodnitsky, 2003, Electron. Colloquium Comput. Complex..

Convex geometry of orbits.

Grigoriy Blekherman, A. Barvinok, 2003, math/0312268.

Brunn–Minkowski inequalities for contingency tables and integer flows

A. Barvinok, 2006, math/0603655.

Computing theta function

A. Barvinok, 2022, ArXiv.

THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES

A. Barvinok, Ellen Veomett, 2006, math/0610325.

Approximating Orthogonal Matrices by Permutation Matrices

A. Barvinok, 2005, math/0510612.

Approximating a Norm by a Polynomial

A. Barvinok, 2001, math/0105069.

The Distribution of Values in the Quadratic Assignment Problem

A. Barvinok, Tamon Stephen, 2001, Math. Oper. Res..

Estimating Maximum by Moments for Functions on Orbits

A. Barvinok, 2002, math/0201020.

Problems of combinatorial optimization, statistical sums and representations of the full linear group

A. Barvinok, 1991 .

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

A. Barvinok, 2011, Comb..

Convexity of the image of a quadratic map via the relative entropy distance

A. Barvinok, 2013, 1305.0243.

New Permanent Estimators via Non-Commutative Determinants

A. Barvinok, 2000, math/0007153.

Computing the Permanent of (Some) Complex Matrices

A. Barvinok, 2015, Foundations of Computational Mathematics.

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

A. Barvinok, 2013, Combinatorica.

Computing the partition function for graph homomorphisms

A. Barvinok, P. Soberón, 2016, Combinatorica.

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

A. Barvinok, 2005, Found. Comput. Math..

Centrally symmetric polytopes with many faces

Seung Jin Lee, A. Barvinok, I. Novik, 2012, Israel Journal of Mathematics.

A Centrally Symmetric Version of the Cyclic Polytope

Alexander I. Barvinok, Isabella Novik, A. Barvinok, 2006, Discret. Comput. Geom..

An approximation algorithm for counting contingency tables

Alex Samorodnitsky, Alexander I. Barvinok, Zur Luria, 2008, Random Struct. Algorithms.

A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed

Alexander I. Barvinok, A. Barvinok, 1993, FOCS.

Combinatorics and Complexity of Partition Functions

Alexander I. Barvinok, A. Barvinok, 2017, Algorithms and combinatorics.

Smoothed counting of 0-1 points in polyhedra

A. Barvinok, 2021, Random Structures & Algorithms.

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

Alexander I. Barvinok, J. A. Hartigan, J. Hartigan, 2010, Random Struct. Algorithms.

What Does a Random Contingency Table Look Like?

Alexander I. Barvinok, A. Barvinok, 2008, Combinatorics, Probability and Computing.

Two Algorithmic Results for the Traveling Salesman Problem

Alexander I. Barvinok, A. Barvinok, 1996, Math. Oper. Res..

On equivariant generalization of Dehn-Sommerville equations

Alexander I. Barvinok, A. Barvinok, 1992, Eur. J. Comb..

Mathematisches Forschungsinstitut Oberwolfach Discrete Geometry

Magdeburg, G. Ziegler, J. Pach, 2005 .

Computing the volume, counting integral points, and exponential sums

Alexander I. Barvinok, A. Barvinok, 1992, SCG '92.

Weighted counting of solutions to sparse systems of equations

Alexander I. Barvinok, Guus Regts, A. Barvinok, 2017, Combinatorics, Probability and Computing.

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

Alexander I. Barvinok, A. Barvinok, 2017, ArXiv.

Weighted counting of integer points in a subspace

A. Barvinok, G. Regts, 2017, 1706.05423.

Computing the Permanent of (Some) Complex Matrices

Alexander I. Barvinok, A. Barvinok, 2014, Foundations of Computational Mathematics.

Feasibility testing for systems of real quadratic equations

Alexander I. Barvinok, A. Barvinok, 1992, STOC '92.

Low rank approximations of symmetric polynomials and asymptotic counting of contingency tables

A. Barvinok, 2005, math/0503170.

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

Alexander I. Barvinok, A. Barvinok, 2018, ArXiv.

Computing the partition function for graph homomorphisms

Alexander I. Barvinok, Pablo Soberón, A. Barvinok, 2014, Comb..

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

Alexander I. Barvinok, A. Barvinok, 1999, Random Struct. Algorithms.

A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed

Alexander I. Barvinok, A. Barvinok, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Lattice Points, Polyhedra, and Complexity

Bernd Sturmfels, Ezra Miller, Alexander Barvinok, 2004 .

Estimating L∞ Norms by L2k Norms for Functions on Orbits

Alexander I. Barvinok, A. Barvinok, 2002, Found. Comput. Math..

The Matching Polynomial

Alexander Barvinok, A. Barvinok, 2016 .

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

Alexander I. Barvinok, A. Barvinok, 2001, Discret. Comput. Geom..

Measure concentration in optimization

Alexander I. Barvinok, A. Barvinok, 1997, Math. Program..

Exponential sums and integrals over convex polytopes

A. I. Barvinok, A. Barvinok, 1992 .

Computing Mixed Discriminants, Mixed Volumes, and Permanents

Alexander I. Barvinok, A. Barvinok, 1997, Discret. Comput. Geom..

N A ] 5 J un 2 02 3 COMPUTING THE THETA FUNCTION

A. Barvinok, 2023 .

Integer Points in Polyhedra

Alexander Barvinok, A. Barvinok, 2008 .

The geometric maximum traveling salesman problem

Gerhard J. Woeginger, Sándor P. Fekete, Alexander I. Barvinok, 2002, JACM.

The Maximum Traveling Salesman Problem Under Polyhedral Norms

Gerhard J. Woeginger, David S. Johnson, Alexander Barvinok, 1998, IPCO.

On the Betti numbers of semialgebraic sets defined by few quadratic inequalities

Alexander Barvinok, A. Barvinok, 1997 .

Testing for Dense Subsets in a Graph via the Partition Function

Alexander Barvinok, Anthony Della Pella, A. Barvinok, 2020, SIAM J. Discret. Math..

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

Alexander I. Barvinok, Anthony Della Pella, A. Barvinok, 2018, ArXiv.

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

Alexander I. Barvinok, Isabella Novik, Seung Jin Lee, 2012, Discret. Comput. Geom..

Computing the Ehrhart polynomial of a convex lattice polytope

A. I. Barvinok, A. Barvinok, 1994, Discret. Comput. Geom..

The Maximum TSP

Edward Kh. Gimadi, Alexander Barvinok, A. I. Serdyukov, 2007 .

When a system of real quadratic equations has a solution

M. Rudelson, A. Barvinok, 2022, Advances in Mathematics.

When a system of real quadratic equations has a solution

Alexander Barvinok, Mark Rudelson, M. Rudelson, 2021, 2106.08119.

New algorithms for lineark-matroid intersection and matroidk-parity problems

Alexander I. Barvinok, A. Barvinok, 1995, Math. Program..

Integer Points in Polyhedra — Geometry, Number Theory, Algebra, Optimization

Alexander Barvinok, B. Reznick, A. Barvinok, 2005 .

Approximating permanents and hafnians

Alexander Barvinok, A. Barvinok, 2016, 1601.07518.

The complexity of generating functions for integer points in polyhedra and beyond

Alexander Barvinok, A. Barvinok, 2006 .

The Traveling Salesman Problem and Its Variations Gregory Gutin Kluwer Academic Publishers

A. Barvinok, 2002 .

0 THE DISTANCE APPROACH TO APPROXIMATE COMBINATORIAL COUNTING

A. Barvinok, Alex Samorodnitsky, 2000 .

The Newton sums method in combinatorial optimization

A. Barvinok, 1991 .

Lattice Points and Lattice Polytopes

Alexander I. Barvinok, A. Barvinok, 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

Foundations of Computational Mathematics Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace

A. Barvinok, 2022 .

Testing systems of real quadratic equations for approximate solutions pdf

Alexander Barvinok, A. Barvinok, 2020, ArXiv.