The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexander I. Barvinok: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  24. Enumerating Contingency Tables via Random Permanents. [Citation Graph (, )][DBLP]


  25. A Centrally Symmetric Version of the Cyclic Polytope. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002