2008 |
25 | EE | Alexander I. Barvinok:
Enumerating Contingency Tables via Random Permanents.
Combinatorics, Probability & Computing 17(1): 1-19 (2008) |
24 | EE | Alexander I. Barvinok,
Isabella Novik:
A Centrally Symmetric Version of the Cyclic Polytope.
Discrete & Computational Geometry 39(1-3): 76-99 (2008) |
2007 |
23 | EE | Alexander I. Barvinok:
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace.
Foundations of Computational Mathematics 7(2): 229-244 (2007) |
2005 |
22 | EE | Alexander I. Barvinok,
Alex Samorodnitsky:
Random Weighting, Asymptotic Counting, and Inverse Isoperimetry
Electronic Colloquium on Computational Complexity (ECCC)(065): (2005) |
2003 |
21 | EE | 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): 641-664 (2003) |
20 | EE | Alexander I. Barvinok,
Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem.
Math. Oper. Res. 28(1): 64-91 (2003) |
2002 |
19 | EE | Alexander I. Barvinok,
Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem.
IPCO 2002: 367-383 |
18 | EE | Alexander I. Barvinok,
Sándor P. Fekete,
David S. Johnson,
Arie Tamir,
Gerhard J. Woeginger,
Russell Woodroofe:
The Geometric Maximum Traveling Salesman Problem
CoRR cs.DS/0204024: (2002) |
17 | EE | Alexander I. Barvinok:
Estimating L8 Norms by L2k Norms for Functions on Orbits.
Foundations of Computational Mathematics 2(4): 393-412 (2002) |
2001 |
16 | EE | Alexander I. Barvinok:
A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints.
Discrete & Computational Geometry 25(1): 23-31 (2001) |
1999 |
15 | | Alexander I. Barvinok:
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor.
Random Struct. Algorithms 14(1): 29-61 (1999) |
1998 |
14 | EE | Alexander I. Barvinok,
David S. Johnson,
Gerhard J. Woeginger,
Russell Woodroofe:
The Maximum Traveling Salesman Problem Under Polyhedral Norms.
IPCO 1998: 195-201 |
1997 |
13 | EE | Alexander I. Barvinok:
Computing Mixed Discriminants, Mixed Volumes, and Permanents.
Discrete & Computational Geometry 18(2): 205-237 (1997) |
12 | | Alexander I. Barvinok:
Measure concentration in optimization.
Math. Program. 79: 33-53 (1997) |
11 | | Alexander I. Barvinok:
Approximate counting via random optimization.
Random Struct. Algorithms 11(2): 187-198 (1997) |
1995 |
10 | | Alexander I. Barvinok:
Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization.
FOCS 1995: 275-283 |
9 | | Alexander I. Barvinok:
Problems of Distance Geometry and Convex Properties of Quadratic Maps.
Discrete & Computational Geometry 13: 189-202 (1995) |
8 | | Alexander I. Barvinok:
New algorithms for linear k-matroid intersection and matroid k-parity problems.
Math. Program. 69: 449-470 (1995) |
1994 |
7 | | Alexander I. Barvinok:
Computing the Ehrhart Polynomial of a Convex Lattice Polytope.
Discrete & Computational Geometry 12: 35-48 (1994) |
1993 |
6 | | Alexander I. Barvinok:
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed
FOCS 1993: 566-572 |
5 | | Alexander I. Barvinok:
Feasibility Testing for Systems of Real Quadratic Equations.
Discrete & Computational Geometry 10: 1-13 (1993) |
4 | | Alexander I. Barvinok:
Computing the Volume, Counting Integral Points, and Exponential Sums.
Discrete & Computational Geometry 10: 123-141 (1993) |
1992 |
3 | | Alexander I. Barvinok:
Optimization Problems on Matroids and Exponential Sums.
IPCO 1992: 316-333 |
2 | | Alexander I. Barvinok:
Feasibility Testing for Systems of Real Quadratic Equations
STOC 1992: 126-132 |
1 | EE | Alexander I. Barvinok:
Computing the Volume, Counting Integral Points, and Exponential Sums.
Symposium on Computational Geometry 1992: 161-170 |