default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander I. Barvinok
Person information
- affiliation: University of Michigan, Ann Arbor, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j36]Alexander I. Barvinok:
Smoothed counting of 0-1 points in polyhedra. Random Struct. Algorithms 63(1): 27-60 (2023)- 2022
- [i17]Alexander I. Barvinok:
Computing theta function. CoRR abs/2208.05405 (2022) - 2021
- [i16]Alexander I. Barvinok:
Smoothed counting of 0-1 points in polyhedra. CoRR abs/2103.05488 (2021) - [i15]Alexander I. Barvinok:
When the positive semidefinite relaxation guarantees a solution to a system of real quadratic equations. CoRR abs/2106.08119 (2021) - [i14]Alexander I. Barvinok, Mark Rudelson:
A quick estimate for the volume of a polyhedron. CoRR abs/2112.06322 (2021) - 2020
- [j35]Alexander I. Barvinok:
Stability and complexity of mixed discriminants. Math. Comput. 89(322): 717-735 (2020) - [j34]Alexander I. Barvinok, Anthony Della Pella:
Testing for Dense Subsets in a Graph via the Partition Function. SIAM J. Discret. Math. 34(1): 308-327 (2020) - [i13]Alexander I. Barvinok:
Integrating products of quadratic forms. CoRR abs/2002.07249 (2020) - [i12]Alexander I. Barvinok, Nicholas Barvinok:
More on zeros and approximation of the Ising partition function. CoRR abs/2005.11232 (2020) - [i11]Alexander I. Barvinok:
Testing systems of real quadratic equations for approximate solutions. CoRR abs/2006.09221 (2020)
2010 – 2019
- 2019
- [j33]Alexander I. Barvinok, Guus Regts:
Weighted counting of solutions to sparse systems of equations. Comb. Probab. Comput. 28(5): 696-719 (2019) - 2018
- [i10]Alexander I. Barvinok:
Computing permanents of complex diagonally dominant matrices and tensors. CoRR abs/1801.04191 (2018) - [i9]Alexander I. Barvinok:
Stability and complexity of mixed discriminants. CoRR abs/1806.05105 (2018) - [i8]Alexander I. Barvinok:
Approximating real-rooted and stable polynomials, with combinatorial applications. CoRR abs/1806.07404 (2018) - [i7]Alexander I. Barvinok, Anthony Della Pella:
Searching for dense subsets in a graph via the partition function. CoRR abs/1807.02054 (2018) - 2017
- [j32]Alexander I. Barvinok, Pablo Soberón
:
Computing the partition function for graph homomorphisms. Comb. 37(4): 633-650 (2017) - [i6]Alexander I. Barvinok:
Weighted counting of non-negative integer points in a subspace. CoRR abs/1706.05423 (2017) - 2016
- [b2]Alexander I. Barvinok:
Combinatorics and Complexity of Partition Functions. Algorithms and combinatorics 30, Springer 2016, ISBN 978-3-319-51828-2, pp. 1-303 - [j31]Alexander I. Barvinok:
Computing the Permanent of (Some) Complex Matrices. Found. Comput. Math. 16(2): 329-342 (2016) - [j30]Alexander I. Barvinok, Pablo Soberón:
Computing the partition function for graph homomorphisms with multiplicities. J. Comb. Theory A 137: 1-26 (2016) - [i5]Alexander I. Barvinok:
Approximating permanents and hafnians of positive matrices. CoRR abs/1601.07518 (2016) - 2015
- [j29]Alexander I. Barvinok:
On testing Hamiltonicity of graphs. Discret. Math. 338(1): 53-58 (2015) - [j28]Alexander I. Barvinok:
Computing the Partition Function for Cliques in a Graph. Theory Comput. 11: 339-355 (2015) - [i4]Alexander I. Barvinok:
Computing the partition function of a polynomial on the Boolean cube. CoRR abs/1503.07463 (2015) - 2014
- [i3]Alexander I. Barvinok:
Computing the permanent of (some) complex matrices. CoRR abs/1405.1303 (2014) - 2013
- [j27]Alexander I. Barvinok:
A bound for the number of vertices of a polytope with applications. Comb. 33(1): 1-10 (2013) - [j26]Alexander I. Barvinok, Seung Jin Lee, Isabella Novik:
Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes and Large Strictly Antipodal Sets. Discret. Comput. Geom. 49(3): 429-443 (2013) - [j25]Alexander I. Barvinok, J. A. Hartigan:
The number of graphs and a random graph with a given degree sequence. Random Struct. Algorithms 42(3): 301-348 (2013) - 2011
- [j24]Alexander I. Barvinok, Alex Samorodnitsky:
Computing the Partition Function for Perfect Matchings in a Hypergraph. Comb. Probab. Comput. 20(6): 815-835 (2011) - 2010
- [j23]Alexander I. Barvinok, J. A. Hartigan:
Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes. Adv. Appl. Math. 45(2): 252-289 (2010) - [j22]Alexander I. Barvinok:
What Does a Random Contingency Table Look Like? Comb. Probab. Comput. 19(4): 517-539 (2010) - [j21]Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong:
An approximation algorithm for counting contingency tables. Random Struct. Algorithms 37(1): 25-66 (2010)
2000 – 2009
- 2008
- [j20]Alexander I. Barvinok:
Enumerating Contingency Tables via Random Permanents. Comb. Probab. Comput. 17(1): 1-19 (2008) - [j19]Alexander I. Barvinok, Isabella Novik:
A Centrally Symmetric Version of the Cyclic Polytope. Discret. Comput. Geom. 39(1-3): 76-99 (2008) - 2007
- [j18]Alexander I. Barvinok:
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace. Found. Comput. Math. 7(2): 229-244 (2007) - 2006
- [j17]Alexander I. Barvinok:
Computing the Ehrhart quasi-polynomial of a rational simplex. Math. Comput. 75(255): 1449-1466 (2006) - 2005
- [i2]Alexander I. Barvinok, Alex Samorodnitsky:
Random Weighting, Asymptotic Counting, and Inverse Isoperimetry. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [r1]Alexander I. Barvinok:
Lattice Points and Lattice Polytopes. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 153-176 - 2003
- [j16]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) - [j15]Alexander I. Barvinok, Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem. Math. Oper. Res. 28(1): 64-91 (2003) - 2002
- [b1]Alexander I. Barvinok:
A course in convexity. Graduate studies in mathematics 54, American Mathematical Society 2002, ISBN 978-0-8218-2968-4, pp. I-X, 1-366 - [j14]Alexander I. Barvinok:
Estimating L8 Norms by L2k Norms for Functions on Orbits. Found. Comput. Math. 2(4): 393-412 (2002) - [c7]Alexander I. Barvinok, Tamon Stephen:
The Distribution of Values in the Quadratic Assignment Problem. IPCO 2002: 367-383 - [i1]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) - 2001
- [j13]Alexander I. Barvinok:
A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints. Discret. Comput. Geom. 25(1): 23-31 (2001)
1990 – 1999
- 1999
- [j12]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
- [c6]Alexander I. Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe:
The Maximum Traveling Salesman Problem Under Polyhedral Norms. IPCO 1998: 195-201 - 1997
- [j11]Alexander I. Barvinok:
Computing Mixed Discriminants, Mixed Volumes, and Permanents. Discret. Comput. Geom. 18(2): 205-237 (1997) - [j10]Alexander I. Barvinok:
Measure concentration in optimization. Math. Program. 79: 33-53 (1997) - [j9]Alexander I. Barvinok:
Approximate counting via random optimization. Random Struct. Algorithms 11(2): 187-198 (1997) - 1996
- [j8]Alexander I. Barvinok:
Two Algorithmic Results for the Traveling Salesman Problem. Math. Oper. Res. 21(1): 65-84 (1996) - 1995
- [j7]Alexander I. Barvinok:
Problems of Distance Geometry and Convex Properties of Quadratic Maps. Discret. Comput. Geom. 13: 189-202 (1995) - [j6]Alexander I. Barvinok:
New algorithms for linear k-matroid intersection and matroid k-parity problems. Math. Program. 69: 449-470 (1995) - [c5]Alexander I. Barvinok:
Integral Geometry of Higher-Dimensional Polytopes and the Average Case in Combinatorial Optimization. FOCS 1995: 275-283 - 1994
- [j5]Alexander I. Barvinok:
Computing the Ehrhart Polynomial of a Convex Lattice Polytope. Discret. Comput. Geom. 12: 35-48 (1994) - [j4]Alexander I. Barvinok:
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed. Math. Oper. Res. 19(4): 769-779 (1994) - 1993
- [j3]Alexander I. Barvinok:
Feasibility Testing for Systems of Real Quadratic Equations. Discret. Comput. Geom. 10: 1-13 (1993) - [j2]Alexander I. Barvinok:
Computing the Volume, Counting Integral Points, and Exponential Sums. Discret. Comput. Geom. 10: 123-141 (1993) - [c4]Alexander I. Barvinok:
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed. FOCS 1993: 566-572 - 1992
- [j1]Alexander I. Barvinok:
On equivariant generalization of Dehn-Sommerville equations. Eur. J. Comb. 13(6): 419-428 (1992) - [c3]Alexander I. Barvinok:
Computing the Volume, Counting Integral Points, and Exponential Sums. SCG 1992: 161-170 - [c2]Alexander I. Barvinok:
Optimization Problems on Matroids and Exponential Sums. IPCO 1992: 316-333 - [c1]Alexander I. Barvinok:
Feasibility Testing for Systems of Real Quadratic Equations. STOC 1992: 126-132
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
