Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Alexander I. Barvinok
@article{DBLP:journals/rsa/Barvinok23,
author = {Alexander I. Barvinok},
title = {Smoothed counting of 0-1 points in polyhedra},
journal = {Random Struct. Algorithms},
volume = {63},
number = {1},
pages = {27--60},
year = {2023},
url = {https://doi.org/10.1002/rsa.21135},
doi = {10.1002/RSA.21135},
timestamp = {Mon, 15 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Barvinok23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-05405,
author = {Alexander I. Barvinok},
title = {Computing theta function},
journal = {CoRR},
volume = {abs/2208.05405},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.05405},
doi = {10.48550/ARXIV.2208.05405},
eprinttype = {arXiv},
eprint = {2208.05405},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-05405.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-05488,
author = {Alexander I. Barvinok},
title = {Smoothed counting of 0-1 points in polyhedra},
journal = {CoRR},
volume = {abs/2103.05488},
year = {2021},
url = {https://arxiv.org/abs/2103.05488},
eprinttype = {arXiv},
eprint = {2103.05488},
timestamp = {Tue, 16 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-05488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-08119,
author = {Alexander I. Barvinok},
title = {When the positive semidefinite relaxation guarantees a solution to
a system of real quadratic equations},
journal = {CoRR},
volume = {abs/2106.08119},
year = {2021},
url = {https://arxiv.org/abs/2106.08119},
eprinttype = {arXiv},
eprint = {2106.08119},
timestamp = {Thu, 01 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-08119.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-06322,
author = {Alexander I. Barvinok and
Mark Rudelson},
title = {A quick estimate for the volume of a polyhedron},
journal = {CoRR},
volume = {abs/2112.06322},
year = {2021},
url = {https://arxiv.org/abs/2112.06322},
eprinttype = {arXiv},
eprint = {2112.06322},
timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-06322.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/moc/Barvinok20,
author = {Alexander I. Barvinok},
title = {Stability and complexity of mixed discriminants},
journal = {Math. Comput.},
volume = {89},
number = {322},
pages = {717--735},
year = {2020},
url = {https://doi.org/10.1090/mcom/3468},
doi = {10.1090/MCOM/3468},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/Barvinok20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BarvinokP20,
author = {Alexander I. Barvinok and
Anthony Della Pella},
title = {Testing for Dense Subsets in a Graph via the Partition Function},
journal = {{SIAM} J. Discret. Math.},
volume = {34},
number = {1},
pages = {308--327},
year = {2020},
url = {https://doi.org/10.1137/19M1247413},
doi = {10.1137/19M1247413},
timestamp = {Wed, 20 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BarvinokP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-07249,
author = {Alexander I. Barvinok},
title = {Integrating products of quadratic forms},
journal = {CoRR},
volume = {abs/2002.07249},
year = {2020},
url = {https://arxiv.org/abs/2002.07249},
eprinttype = {arXiv},
eprint = {2002.07249},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-07249.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-11232,
author = {Alexander I. Barvinok and
Nicholas Barvinok},
title = {More on zeros and approximation of the Ising partition function},
journal = {CoRR},
volume = {abs/2005.11232},
year = {2020},
url = {https://arxiv.org/abs/2005.11232},
eprinttype = {arXiv},
eprint = {2005.11232},
timestamp = {Fri, 29 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-11232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-09221,
author = {Alexander I. Barvinok},
title = {Testing systems of real quadratic equations for approximate solutions},
journal = {CoRR},
volume = {abs/2006.09221},
year = {2020},
url = {https://arxiv.org/abs/2006.09221},
eprinttype = {arXiv},
eprint = {2006.09221},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-09221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BarvinokR19,
author = {Alexander I. Barvinok and
Guus Regts},
title = {Weighted counting of solutions to sparse systems of equations},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {696--719},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000105},
doi = {10.1017/S0963548319000105},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BarvinokR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-04191,
author = {Alexander I. Barvinok},
title = {Computing permanents of complex diagonally dominant matrices and tensors},
journal = {CoRR},
volume = {abs/1801.04191},
year = {2018},
url = {http://arxiv.org/abs/1801.04191},
eprinttype = {arXiv},
eprint = {1801.04191},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-04191.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-05105,
author = {Alexander I. Barvinok},
title = {Stability and complexity of mixed discriminants},
journal = {CoRR},
volume = {abs/1806.05105},
year = {2018},
url = {http://arxiv.org/abs/1806.05105},
eprinttype = {arXiv},
eprint = {1806.05105},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-05105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-07404,
author = {Alexander I. Barvinok},
title = {Approximating real-rooted and stable polynomials, with combinatorial
applications},
journal = {CoRR},
volume = {abs/1806.07404},
year = {2018},
url = {http://arxiv.org/abs/1806.07404},
eprinttype = {arXiv},
eprint = {1806.07404},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-07404.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-02054,
author = {Alexander I. Barvinok and
Anthony Della Pella},
title = {Searching for dense subsets in a graph via the partition function},
journal = {CoRR},
volume = {abs/1807.02054},
year = {2018},
url = {http://arxiv.org/abs/1807.02054},
eprinttype = {arXiv},
eprint = {1807.02054},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-02054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BarvinokS17,
author = {Alexander I. Barvinok and
Pablo Sober{\'{o}}n},
title = {Computing the partition function for graph homomorphisms},
journal = {Comb.},
volume = {37},
number = {4},
pages = {633--650},
year = {2017},
url = {https://doi.org/10.1007/s00493-016-3357-2},
doi = {10.1007/S00493-016-3357-2},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BarvinokS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Barvinok17,
author = {Alexander I. Barvinok},
title = {Weighted counting of non-negative integer points in a subspace},
journal = {CoRR},
volume = {abs/1706.05423},
year = {2017},
url = {http://arxiv.org/abs/1706.05423},
eprinttype = {arXiv},
eprint = {1706.05423},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Barvinok17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0041359,
author = {Alexander I. Barvinok},
title = {Combinatorics and Complexity of Partition Functions},
series = {Algorithms and combinatorics},
volume = {30},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-51829-9},
doi = {10.1007/978-3-319-51829-9},
isbn = {978-3-319-51828-2},
timestamp = {Tue, 26 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0041359.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/Barvinok16,
author = {Alexander I. Barvinok},
title = {Computing the Permanent of (Some) Complex Matrices},
journal = {Found. Comput. Math.},
volume = {16},
number = {2},
pages = {329--342},
year = {2016},
url = {https://doi.org/10.1007/s10208-014-9243-7},
doi = {10.1007/S10208-014-9243-7},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/Barvinok16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BarvinokS16,
author = {Alexander I. Barvinok and
Pablo Sober{\'{o}}n},
title = {Computing the partition function for graph homomorphisms with multiplicities},
journal = {J. Comb. Theory, Ser. {A}},
volume = {137},
pages = {1--26},
year = {2016},
url = {https://doi.org/10.1016/j.jcta.2015.08.001},
doi = {10.1016/J.JCTA.2015.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BarvinokS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Barvinok16,
author = {Alexander I. Barvinok},
title = {Approximating permanents and hafnians of positive matrices},
journal = {CoRR},
volume = {abs/1601.07518},
year = {2016},
url = {http://arxiv.org/abs/1601.07518},
eprinttype = {arXiv},
eprint = {1601.07518},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Barvinok16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Barvinok15,
author = {Alexander I. Barvinok},
title = {On testing Hamiltonicity of graphs},
journal = {Discret. Math.},
volume = {338},
number = {1},
pages = {53--58},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2014.08.021},
doi = {10.1016/J.DISC.2014.08.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Barvinok15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/Barvinok15,
author = {Alexander I. Barvinok},
title = {Computing the Partition Function for Cliques in a Graph},
journal = {Theory Comput.},
volume = {11},
pages = {339--355},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a013},
doi = {10.4086/TOC.2015.V011A013},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/Barvinok15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Barvinok15,
author = {Alexander I. Barvinok},
title = {Computing the partition function of a polynomial on the Boolean cube},
journal = {CoRR},
volume = {abs/1503.07463},
year = {2015},
url = {http://arxiv.org/abs/1503.07463},
eprinttype = {arXiv},
eprint = {1503.07463},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Barvinok15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Barvinok14,
author = {Alexander I. Barvinok},
title = {Computing the permanent of (some) complex matrices},
journal = {CoRR},
volume = {abs/1405.1303},
year = {2014},
url = {http://arxiv.org/abs/1405.1303},
eprinttype = {arXiv},
eprint = {1405.1303},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Barvinok14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Barvinok13,
author = {Alexander I. Barvinok},
title = {A bound for the number of vertices of a polytope with applications},
journal = {Comb.},
volume = {33},
number = {1},
pages = {1--10},
year = {2013},
url = {https://doi.org/10.1007/s00493-013-2870-9},
doi = {10.1007/S00493-013-2870-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Barvinok13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BarvinokLN13,
author = {Alexander I. Barvinok and
Seung Jin Lee and
Isabella Novik},
title = {Explicit Constructions of Centrally Symmetric k-Neighborly Polytopes
and Large Strictly Antipodal Sets},
journal = {Discret. Comput. Geom.},
volume = {49},
number = {3},
pages = {429--443},
year = {2013},
url = {https://doi.org/10.1007/s00454-013-9495-z},
doi = {10.1007/S00454-013-9495-Z},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BarvinokLN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarvinokH13,
author = {Alexander I. Barvinok and
J. A. Hartigan},
title = {The number of graphs and a random graph with a given degree sequence},
journal = {Random Struct. Algorithms},
volume = {42},
number = {3},
pages = {301--348},
year = {2013},
url = {https://doi.org/10.1002/rsa.20409},
doi = {10.1002/RSA.20409},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarvinokH13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BarvinokS11,
author = {Alexander I. Barvinok and
Alex Samorodnitsky},
title = {Computing the Partition Function for Perfect Matchings in a Hypergraph},
journal = {Comb. Probab. Comput.},
volume = {20},
number = {6},
pages = {815--835},
year = {2011},
url = {https://doi.org/10.1017/S0963548311000435},
doi = {10.1017/S0963548311000435},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BarvinokS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/BarvinokH10,
author = {Alexander I. Barvinok and
J. A. Hartigan},
title = {Maximum entropy Gaussian approximations for the number of integer
points and volumes of polytopes},
journal = {Adv. Appl. Math.},
volume = {45},
number = {2},
pages = {252--289},
year = {2010},
url = {https://doi.org/10.1016/j.aam.2010.01.004},
doi = {10.1016/J.AAM.2010.01.004},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aam/BarvinokH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Barvinok10,
author = {Alexander I. Barvinok},
title = {What Does a Random Contingency Table Look Like?},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {4},
pages = {517--539},
year = {2010},
url = {https://doi.org/10.1017/S0963548310000039},
doi = {10.1017/S0963548310000039},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Barvinok10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarvinokLSY10,
author = {Alexander I. Barvinok and
Zur Luria and
Alex Samorodnitsky and
Alexander Yong},
title = {An approximation algorithm for counting contingency tables},
journal = {Random Struct. Algorithms},
volume = {37},
number = {1},
pages = {25--66},
year = {2010},
url = {https://doi.org/10.1002/rsa.20301},
doi = {10.1002/RSA.20301},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarvinokLSY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Barvinok08,
author = {Alexander I. Barvinok},
title = {Enumerating Contingency Tables via Random Permanents},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {1},
pages = {1--19},
year = {2008},
url = {https://doi.org/10.1017/S0963548307008668},
doi = {10.1017/S0963548307008668},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Barvinok08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/BarvinokN08,
author = {Alexander I. Barvinok and
Isabella Novik},
title = {A Centrally Symmetric Version of the Cyclic Polytope},
journal = {Discret. Comput. Geom.},
volume = {39},
number = {1-3},
pages = {76--99},
year = {2008},
url = {https://doi.org/10.1007/s00454-007-9034-x},
doi = {10.1007/S00454-007-9034-X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/BarvinokN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/Barvinok07,
author = {Alexander I. Barvinok},
title = {Integration and Optimization of Multivariate Polynomials by Restriction
onto a Random Subspace},
journal = {Found. Comput. Math.},
volume = {7},
number = {2},
pages = {229--244},
year = {2007},
url = {https://doi.org/10.1007/s10208-005-0178-x},
doi = {10.1007/S10208-005-0178-X},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/Barvinok07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/moc/Barvinok06,
author = {Alexander I. Barvinok},
title = {Computing the Ehrhart quasi-polynomial of a rational simplex},
journal = {Math. Comput.},
volume = {75},
number = {255},
pages = {1449--1466},
year = {2006},
url = {https://doi.org/10.1090/S0025-5718-06-01836-9},
doi = {10.1090/S0025-5718-06-01836-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/moc/Barvinok06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-065,
author = {Alexander I. Barvinok and
Alex Samorodnitsky},
title = {Random Weighting, Asymptotic Counting, and Inverse Isoperimetry},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-065}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-065/index.html},
eprinttype = {ECCC},
eprint = {TR05-065},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/cg/Barvinok04,
author = {Alexander I. Barvinok},
editor = {Jacob E. Goodman and
Joseph O'Rourke},
title = {Lattice Points and Lattice Polytopes},
booktitle = {Handbook of Discrete and Computational Geometry, Second Edition},
pages = {153--176},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035315.ch7},
doi = {10.1201/9781420035315.CH7},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/cg/Barvinok04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarvinokFJTWW03,
author = {Alexander I. Barvinok and
S{\'{a}}ndor P. Fekete and
David S. Johnson and
Arie Tamir and
Gerhard J. Woeginger and
Russell Woodroofe},
title = {The geometric maximum traveling salesman problem},
journal = {J. {ACM}},
volume = {50},
number = {5},
pages = {641--664},
year = {2003},
url = {https://doi.org/10.1145/876638.876640},
doi = {10.1145/876638.876640},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BarvinokFJTWW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BarvinokS03,
author = {Alexander I. Barvinok and
Tamon Stephen},
title = {The Distribution of Values in the Quadratic Assignment Problem},
journal = {Math. Oper. Res.},
volume = {28},
number = {1},
pages = {64--91},
year = {2003},
url = {https://doi.org/10.1287/moor.28.1.64.14262},
doi = {10.1287/MOOR.28.1.64.14262},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/BarvinokS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0012694,
author = {Alexander I. Barvinok},
title = {A course in convexity},
series = {Graduate studies in mathematics},
volume = {54},
publisher = {American Mathematical Society},
year = {2002},
isbn = {978-0-8218-2968-4},
timestamp = {Mon, 15 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0012694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/focm/Barvinok02,
author = {Alexander I. Barvinok},
title = {Estimating L\({}^{\mbox{8}}\) Norms by L\({}^{\mbox{2k}}\) Norms for
Functions on Orbits},
journal = {Found. Comput. Math.},
volume = {2},
number = {4},
pages = {393--412},
year = {2002},
url = {https://doi.org/10.1007/s102080010031},
doi = {10.1007/S102080010031},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/focm/Barvinok02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BarvinokS02,
author = {Alexander I. Barvinok and
Tamon Stephen},
editor = {William J. Cook and
Andreas S. Schulz},
title = {The Distribution of Values in the Quadratic Assignment Problem},
booktitle = {Integer Programming and Combinatorial Optimization, 9th International
{IPCO} Conference, Cambridge, MA, USA, May 27-29, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2337},
pages = {367--383},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-47867-1\_26},
doi = {10.1007/3-540-47867-1\_26},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BarvinokS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0204024,
author = {Alexander I. Barvinok and
S{\'{a}}ndor P. Fekete and
David S. Johnson and
Arie Tamir and
Gerhard J. Woeginger and
Russell Woodroofe},
title = {The Geometric Maximum Traveling Salesman Problem},
journal = {CoRR},
volume = {cs.DS/0204024},
year = {2002},
url = {https://arxiv.org/abs/cs/0204024},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0204024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Barvinok01,
author = {Alexander I. Barvinok},
title = {A Remark on the Rank of Positive Semidefinite Matrices Subject to
Affine Constraints},
journal = {Discret. Comput. Geom.},
volume = {25},
number = {1},
pages = {23--31},
year = {2001},
url = {https://doi.org/10.1007/s004540010074},
doi = {10.1007/S004540010074},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Barvinok01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Barvinok99,
author = {Alexander I. Barvinok},
title = {Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants
Within a Simply Exponential Factor},
journal = {Random Struct. Algorithms},
volume = {14},
number = {1},
pages = {29--61},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1098-2418(1999010)14:1\&\#60;29::AID-RSA2\&\#62;3.0.CO;2-X},
doi = {10.1002/(SICI)1098-2418(1999010)14:1\&\#60;29::AID-RSA2\&\#62;3.0.CO;2-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Barvinok99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BarvinokJWW98,
author = {Alexander I. Barvinok and
David S. Johnson and
Gerhard J. Woeginger and
Russell Woodroofe},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {The Maximum Traveling Salesman Problem Under Polyhedral Norms},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {195--201},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_15},
doi = {10.1007/3-540-69346-7\_15},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipco/BarvinokJWW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Barvinok97,
author = {Alexander I. Barvinok},
title = {Computing Mixed Discriminants, Mixed Volumes, and Permanents},
journal = {Discret. Comput. Geom.},
volume = {18},
number = {2},
pages = {205--237},
year = {1997},
url = {https://doi.org/10.1007/PL00009316},
doi = {10.1007/PL00009316},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Barvinok97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Barvinok97,
author = {Alexander I. Barvinok},
title = {Measure concentration in optimization},
journal = {Math. Program.},
volume = {79},
pages = {33--53},
year = {1997},
url = {https://doi.org/10.1007/BF02614310},
doi = {10.1007/BF02614310},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Barvinok97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Barvinok97,
author = {Alexander I. Barvinok},
title = {Approximate counting via random optimization},
journal = {Random Struct. Algorithms},
volume = {11},
number = {2},
pages = {187--198},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199709)11:2\&\#60;187::AID-RSA6\&\#62;3.0.CO;2-O},
doi = {10.1002/(SICI)1098-2418(199709)11:2\&\#60;187::AID-RSA6\&\#62;3.0.CO;2-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Barvinok97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Barvinok96,
author = {Alexander I. Barvinok},
title = {Two Algorithmic Results for the Traveling Salesman Problem},
journal = {Math. Oper. Res.},
volume = {21},
number = {1},
pages = {65--84},
year = {1996},
url = {https://doi.org/10.1287/moor.21.1.65},
doi = {10.1287/MOOR.21.1.65},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Barvinok96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Barvinok95,
author = {Alexander I. Barvinok},
title = {Problems of Distance Geometry and Convex Properties of Quadratic Maps},
journal = {Discret. Comput. Geom.},
volume = {13},
pages = {189--202},
year = {1995},
url = {https://doi.org/10.1007/BF02574037},
doi = {10.1007/BF02574037},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Barvinok95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Barvinok95,
author = {Alexander I. Barvinok},
title = {New algorithms for linear k-matroid intersection and matroid k-parity
problems},
journal = {Math. Program.},
volume = {69},
pages = {449--470},
year = {1995},
url = {https://doi.org/10.1007/BF01585571},
doi = {10.1007/BF01585571},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Barvinok95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Barvinok95,
author = {Alexander I. Barvinok},
title = {Integral Geometry of Higher-Dimensional Polytopes and the Average
Case in Combinatorial Optimization},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {275--283},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492483},
doi = {10.1109/SFCS.1995.492483},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Barvinok95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Barvinok94,
author = {Alexander I. Barvinok},
title = {Computing the Ehrhart Polynomial of a Convex Lattice Polytope},
journal = {Discret. Comput. Geom.},
volume = {12},
pages = {35--48},
year = {1994},
url = {https://doi.org/10.1007/BF02574364},
doi = {10.1007/BF02574364},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Barvinok94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Barvinok94,
author = {Alexander I. Barvinok},
title = {A Polynomial Time Algorithm for Counting Integral Points in Polyhedra
When the Dimension is Fixed},
journal = {Math. Oper. Res.},
volume = {19},
number = {4},
pages = {769--779},
year = {1994},
url = {https://doi.org/10.1287/moor.19.4.769},
doi = {10.1287/MOOR.19.4.769},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Barvinok94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Barvinok93,
author = {Alexander I. Barvinok},
title = {Feasibility Testing for Systems of Real Quadratic Equations},
journal = {Discret. Comput. Geom.},
volume = {10},
pages = {1--13},
year = {1993},
url = {https://doi.org/10.1007/BF02573959},
doi = {10.1007/BF02573959},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Barvinok93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/Barvinok93a,
author = {Alexander I. Barvinok},
title = {Computing the Volume, Counting Integral Points, and Exponential Sums},
journal = {Discret. Comput. Geom.},
volume = {10},
pages = {123--141},
year = {1993},
url = {https://doi.org/10.1007/BF02573970},
doi = {10.1007/BF02573970},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/Barvinok93a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Barvinok93,
author = {Alexander I. Barvinok},
title = {A Polynomial Time Algorithm for Counting Integral Points in Polyhedra
when the Dimension Is Fixed},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {566--572},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366830},
doi = {10.1109/SFCS.1993.366830},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Barvinok93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Barvinok92,
author = {Alexander I. Barvinok},
title = {On equivariant generalization of Dehn-Sommerville equations},
journal = {Eur. J. Comb.},
volume = {13},
number = {6},
pages = {419--428},
year = {1992},
url = {https://doi.org/10.1016/0195-6698(92)90001-G},
doi = {10.1016/0195-6698(92)90001-G},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Barvinok92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Barvinok92,
author = {Alexander I. Barvinok},
editor = {David Avis},
title = {Computing the Volume, Counting Integral Points, and Exponential Sums},
booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
Berlin, Germany, June 10-12, 1992},
pages = {161--170},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/142675.142713},
doi = {10.1145/142675.142713},
timestamp = {Mon, 14 Jun 2021 16:24:47 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/Barvinok92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Barvinok92,
author = {Alexander I. Barvinok},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {Optimization Problems on Matroids and Exponential Sums},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {316--333},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Barvinok92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Barvinok92,
author = {Alexander I. Barvinok},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Feasibility Testing for Systems of Real Quadratic Equations},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {126--132},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129725},
doi = {10.1145/129712.129725},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Barvinok92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 02:49 CEST 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:
