Alexander Barvinok | Academic Influence

Alexander Barvinok's AcademicInfluence.com Rankings

Alexander Barvinok

Mathematics

#3136

World Rank

#4691

Historical Rank

Combinatorics

#82

World Rank

#89

Historical Rank

Algebra

#343

World Rank

#475

Historical Rank

Measure Theory

#2486

World Rank

#2987

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Alexander Barvinok's Degrees

Masters Mathematics Moscow State University
Bachelors Mathematics Moscow State University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Alexander Barvinok Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Alexander I. Barvinok is a professor of mathematics at the University of Michigan. Barvinok received his Ph.D. from St. Petersburg State University in 1988 under the supervision of Anatoly Moiseevich Vershik.

(See a Problem?)

Alexander Barvinok's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A course in convexity (2002) (846)
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed (1993) (443)
An Algorithmic Theory of Lattice Points in Polyhedra (1999) (327)
Problems of distance geometry and convex properties of quadratic maps (1995) (267)
Short rational generating functions for lattice point problems (2002) (191)
Combinatorics and Complexity of Partition Functions (2017) (171)
Two Algorithmic Results for the Traveling Salesman Problem (1996) (108)
Thrifty approximations of convex bodies by polytopes (2012) (93)
Integer Points in Polyhedra (2008) (93)
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor (1999) (82)
Computing the volume, counting integral points, and exponential sums (1992) (80)
Feasibility testing for systems of real quadratic equations (1992) (80)
Computing the Ehrhart quasi-polynomial of a rational simplex (2005) (70)
On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries☆ (2008) (70)
A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints (2001) (70)
Computing the Permanent of (Some) Complex Matrices (2014) (66)
Computing the Ehrhart polynomial of a convex lattice polytope (1994) (65)
The number of graphs and a random graph with a given degree sequence (2010) (63)
The geometric maximum traveling salesman problem (2002) (54)
The Maximum Traveling Salesman Problem Under Polyhedral Norms (1998) (52)
An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (2009) (51)
Matrices with prescribed row and column sums (2010) (48)
Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes (2009) (44)
On the Betti numbers of semialgebraic sets defined by few quadratic inequalities (1997) (41)
Asymptotic estimates for the number of contingency tables, integer flows, and volumes of transportation polytopes (2007) (40)
A Centrally Symmetric Version of the Cyclic Polytope (2006) (40)
Computing Mixed Discriminants, Mixed Volumes, and Permanents (1997) (40)
What Does a Random Contingency Table Look Like? (2008) (35)
Computing the partition function for graph homomorphisms (2014) (35)
The Matching Polynomial (2016) (34)
Computing the Partition Function for Cliques in a Graph (2014) (33)
Estimating L∞ Norms by L2k Norms for Functions on Orbits (2002) (30)
Enumerating Contingency Tables via Random Permanents (2005) (29)
Weighted counting of solutions to sparse systems of equations (2017) (28)
Lattice Points and Lattice Polytopes (2004) (28)
Convex geometry of orbits. (2003) (26)
Random weighting, asymptotic counting, and inverse isoperimetry (2003) (25)
New algorithms for lineark-matroid intersection and matroidk-parity problems (1995) (25)
Computing the partition function for graph homomorphisms with multiplicities (2014) (25)
Computing the Partition Function for Perfect Matchings in a Hypergraph (2010) (25)
An approximation algorithm for counting contingency tables (2008) (25)
Approximating permanents and hafnians (2016) (25)
Lattice Points, Polyhedra, and Complexity (2004) (22)
Brunn–Minkowski inequalities for contingency tables and integer flows (2006) (21)
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace (2005) (19)
THE COMPUTATIONAL COMPLEXITY OF CONVEX BODIES (2006) (19)
Exponential sums and integrals over convex polytopes (1992) (18)
The Maximum TSP (2007) (18)
Explicit Constructions of Centrally Symmetric $$k$$-Neighborly Polytopes and Large Strictly Antipodal Sets (2012) (16)
Measure concentration in optimization (1997) (16)
New Permanent Estimators via Non-Commutative Determinants (2000) (16)
The Distribution of Values in the Quadratic Assignment Problem (2001) (15)
The complexity of generating functions for integer points in polyhedra and beyond (2006) (15)
A bound for the number of vertices of a polytope with applications (2011) (14)
Combinatorial complexity of orbits in representations of the symmetric group (1992) (14)
Convex hulls of orbits of representations of finite groups and combinatorial optimization (1988) (13)
Computing the partition function of a polynomial on the Boolean cube (2015) (13)
Approximating a Norm by a Polynomial (2001) (12)
Integer points in polyhedra : geometry, number theory, algebra, optimization : proceedings of an AMS-IMS-SIAM Joint Summer Research Conference on Integer Points in Polyhedra, Geometry, Number Theory, Algebra, Optimization, July 13-17, 2003, Snowbird, Utah (2005) (12)
NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE (2011) (11)
Integer points in polyhedra : geometry, number theory, algebra, optimization : proceedings of an AMS-IMS-SIAM Joint Summer Research Conference on Integer Points in Polyhedra, July 13-17, 2003, Snowbird, Utah (2005) (11)
Approximating Orthogonal Matrices by Permutation Matrices (2005) (11)
Computational complexity of immanents and representations of the full linear group (1990) (11)
Sparse Interpolation of Symmetric Polynomials (1997) (10)
Approximating real-rooted and stable polynomials, with combinatorial applications (2018) (9)
Computing permanents of complex diagonally dominant matrices and tensors (2018) (9)
Low rank approximations of symmetric polynomials and asymptotic counting of contingency tables (2005) (7)
Approximations of convex bodies by polytopes and by projections of spectrahedra (2012) (7)
Approximate counting via random optimization (1997) (7)
Convexity of the image of a quadratic map via the relative entropy distance (2013) (6)
Weighted counting of integer points in a subspace (2017) (6)
Methods of representations theory in combinatorial optimization problems (1989) (6)
Counting magic squares in quasi-polynomial time (2007) (6)
Counting Integer Points in Higher-Dimensional Polytopes (2017) (6)
Combinatorial Optimization and Computations in the Ring of Polynomials (1993) (6)
The distance approach to approximate combinatorial counting (2000) (5)
A simple polynomial time algorithm to approximate the permanent within a simply exponential factor (1997) (5)
On equivariant generalization of Dehn-Sommerville equations (1992) (4)
Centrally symmetric polytopes with many faces (2011) (4)
Computing the partition function for graph homomorphisms (2016) (4)
Norms by L 2 k Norms for Functions on Orbits (2002) (4)
Approximation Algorithms for NP-Hard Problems 1463 Workshop : Approximation Algorithms for NP-Hard Problems Table of Contents (2004) (4)
More on zeros and approximation of the Ising partition function (2020) (4)
Approximating permanents and hafnians of positive matrices (2016) (3)
Maximum Entropy Edgeworth Estimates of Volumes of Polytopes (2009) (3)
Testing for Dense Subsets in a Graph via the Partition Function (2020) (3)
When a system of real quadratic equations has a solution (2021) (3)
Stability and complexity of mixed discriminants (2018) (3)
Computation of exponential integrals (1994) (3)
Optimization Problems on Matroids and Exponential Sums (1992) (3)
Weighted counting of non-negative integer points in a subspace (2017) (3)
A remark on approximating permanents of positive definite matrices (2020) (2)
On testing Hamiltonicity of graphs (2015) (2)
A quick estimate for the volume of a polyhedron (2021) (2)
Integral geometry of higher-dimensional polytopes and the average case in combinatorial optimization (1995) (2)
Maximum entropy Edgeworth estimates of the number of integer points in polytopes (2009) (2)
Concentration of the mixed discriminant of well-conditioned matrices (2015) (1)
Problems of combinatorial optimization, statistical sums and representations of the full linear group (1991) (1)
The Independence Polynomial (2016) (1)
The Newton sums method in combinatorial optimization (1991) (1)
Homological type of spaces of configurations of structurally stable type in C2 (1986) (1)
On topological properties of spaces of polytopes (1988) (1)
Integrating products of quadratic forms (2020) (1)
The Graph Homomorphism Partition Function (2016) (0)
Lattices and convex bodies (2002) (0)
THICKENINGS OF THE CIRCLE AND CENTRALLY – SYMMETRIC ORBITOPES Given a metric space X and scale parameter r > 0 , the associated Vietoris – (2018) (0)
The Traveling Salesman Problem and Its Variations Gregory Gutin Kluwer Academic Publishers (2002) (0)
The Geometry and Combinatorics of Ehrhart δ-Vectors (2009) (0)
Computing the Permanent of (Some) Complex Matrices (2015) (0)
Computing theta function (2022) (0)
Faces and extreme points (2002) (0)
When the positive semidefinite relaxation guarantees a solution to a system of real quadratic equations (2021) (0)
Integer points in polyhedra - geometry, number theory, algebra, optimization : Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference held in Snowbird, UT, July 13 - 17, 2003 (2005) (0)
Book Review: Discrete convex analysis (2004) (0)
Convex bodies and ellipsoids (2002) (0)
Testing systems of real quadratic equations for approximate solutions (2020) (0)
The Tensorization Trick in Convex Geometry (2018) (0)
Polarity, duality and linear programming (2002) (0)
Estimating Maximum by Moments for Functions on Orbits (2002) (0)
7: Lattice points and lattice polytopes (2017) (0)
MATH 669: COMBINATORICS OF POLYTOPES (2010) (0)
Some algorithmic applications of partition functions in combinatorics (2016) (0)
Convexity of the image of a quadratic map via the relative entropy distance (2013) (0)
MATH 669 (“COMBINATORICS AND COMPLEXITY OF PARTITION FUNCTIONS”) NOTES (2017) (0)
Partition Functions of Integer Flows (2016) (0)
i. Statement of the Problem and Notation. In this papaer we consider the complexity of the computation of relative invariants of the full linear group in connection with some (1991) (0)
0 THE DISTANCE APPROACH TO APPROXIMATE COMBINATORIAL COUNTING (2000) (0)
Convex sets at large (2002) (0)
Smoothed counting of 0-1 points in polyhedra (2021) (0)
Acknowledgment of Reviewers 2013 (2013) (0)
Partition functions for dense instances of combinatorial enumeration problems (2013) (0)
Hafnians and Multidimensional Permanents (2016) (0)
A bound for the number of vertices of a polytope with applications (2013) (0)
Faces of polytopes (2002) (0)
Convex sets in topological vector spaces (2002) (0)
Searching for dense subsets in a graph via the partition function (2018) (0)
FOCS 2018 External Reviewers (2018) (0)
Mathematisches Forschungsinstitut Oberwolfach Report No . 4 / 2007 Geometric and Topological Combinatorics Organised (2007) (0)
Workshop: Discrete Geometry Table of Contents (2006) (0)
Centrally symmetric polytopes with many faces (2012) (0)
2 7 O ct 2 01 0 MATRICES WITH PRESCRIBED ROW AND COLUMN SUMS (2018) (0)
THICKENINGS OF THE CIRCLE AND CENTRALLY – SYMMETRIC ORBITOPES Submitted (2018) (0)
Lattice points and polyhedra (2002) (0)

This paper list is powered by the following services:

Other Resources About Alexander Barvinok

en.wikipedia.org

What Schools Are Affiliated With Alexander Barvinok?

Alexander Barvinok is affiliated with the following schools: