Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mark Jerrum
@article{DBLP:journals/dcg/GuoJ23,
author = {Heng Guo and
Mark Jerrum},
title = {Counting Vertices of Integral Polytopes Defined by Facets},
journal = {Discret. Comput. Geom.},
volume = {70},
number = {3},
pages = {975--990},
year = {2023},
url = {https://doi.org/10.1007/s00454-022-00406-8},
doi = {10.1007/S00454-022-00406-8},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/GuoJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/theoretics/00010J023,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
title = {A simple polynomial-time approximation algorithm for the total variation
distance between two product distributions},
journal = {TheoretiCS},
volume = {2},
year = {2023},
url = {https://doi.org/10.46298/theoretics.23.7},
doi = {10.46298/THEORETICS.23.7},
timestamp = {Mon, 19 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/theoretics/00010J023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sosa/00010J023,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
editor = {Telikepalli Kavitha and
Kurt Mehlhorn},
title = {A simple polynomial-time approximation algorithm for the total variation
distance between two product distributions},
booktitle = {2023 Symposium on Simplicity in Algorithms, {SOSA} 2023, Florence,
Italy, January 23-25, 2023},
pages = {343--347},
publisher = {{SIAM}},
year = {2023},
url = {https://doi.org/10.1137/1.9781611977585.ch30},
doi = {10.1137/1.9781611977585.CH30},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sosa/00010J023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-07821,
author = {Konrad Anand and
Mark Jerrum},
title = {Perfect Sampling of q-Spin Systems on {\(\mathbb{Z}\)}\({}^{\mbox{2}}\)
via Weak Spatial Mixing},
journal = {CoRR},
volume = {abs/2302.07821},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.07821},
doi = {10.48550/ARXIV.2302.07821},
eprinttype = {arXiv},
eprint = {2302.07821},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-07821.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AnandJ22,
author = {Konrad Anand and
Mark Jerrum},
title = {Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {3},
pages = {1280--1295},
year = {2022},
url = {https://doi.org/10.1137/21m1437433},
doi = {10.1137/21M1437433},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AnandJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-00740,
author = {Weiming Feng and
Heng Guo and
Mark Jerrum and
Jiaheng Wang},
title = {A simple polynomial-time approximation algorithm for total variation
distances between product distributions},
journal = {CoRR},
volume = {abs/2208.00740},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.00740},
doi = {10.48550/ARXIV.2208.00740},
eprinttype = {arXiv},
eprint = {2208.00740},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-00740.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DellJMAP22,
author = {Holger Dell and
Mark Richard Jerrum and
Haiko M{\"{u}}ller and
Konrad Anand and
Marcus Pappik},
title = {Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar
22482)},
journal = {Dagstuhl Reports},
volume = {12},
number = {11},
pages = {124--145},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.11.124},
doi = {10.4230/DAGREP.12.11.124},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DellJMAP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JerrumM21,
author = {Mark Jerrum and
Tam{\'{a}}s Makai},
title = {The Size of the Giant Joint Component in a Binomial Random Double
Graph},
journal = {Electron. J. Comb.},
volume = {28},
number = {1},
pages = {1},
year = {2021},
url = {https://doi.org/10.37236/8846},
doi = {10.37236/8846},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/JerrumM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GuoJ21,
author = {Heng Guo and
Mark Jerrum},
title = {Approximately counting bases of bicircular matroids},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {1},
pages = {124--135},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000292},
doi = {10.1017/S0963548320000292},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GuoJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerHJM21,
author = {Martin E. Dyer and
Marc Heinrich and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {Polynomial-time approximation algorithms for the antiferromagnetic
Ising model on line graphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {6},
pages = {905--921},
year = {2021},
url = {https://doi.org/10.1017/S0963548321000080},
doi = {10.1017/S0963548321000080},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerHJM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DyerJMV21,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller and
Kristina Vuskovic},
title = {Counting Weighted Independent Sets beyond the Permanent},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {1503--1524},
year = {2021},
url = {https://doi.org/10.1137/20M1347747},
doi = {10.1137/20M1347747},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DyerJMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-01469,
author = {Heng Guo and
Mark Jerrum},
title = {Counting vertices of integer polytopes defined by facets},
journal = {CoRR},
volume = {abs/2105.01469},
year = {2021},
url = {https://arxiv.org/abs/2105.01469},
eprinttype = {arXiv},
eprint = {2105.01469},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-01469.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-07744,
author = {Mark Jerrum},
title = {Fundamentals of Partial Rejection Sampling},
journal = {CoRR},
volume = {abs/2106.07744},
year = {2021},
url = {https://arxiv.org/abs/2106.07744},
eprinttype = {arXiv},
eprint = {2106.07744},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-07744.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-15992,
author = {Konrad Anand and
Mark Jerrum},
title = {Perfect Sampling in Infinite Spin Systems via Strong Spatial Mixing},
journal = {CoRR},
volume = {abs/2106.15992},
year = {2021},
url = {https://arxiv.org/abs/2106.15992},
eprinttype = {arXiv},
eprint = {2106.15992},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-15992.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/DyerGGJV20,
author = {Martin E. Dyer and
Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum and
Eric Vigoda},
title = {Random Walks on Small World Networks},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {3},
pages = {37:1--37:33},
year = {2020},
url = {https://doi.org/10.1145/3382208},
doi = {10.1145/3382208},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/DyerGGJV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-07944,
author = {Martin E. Dyer and
Marc Heinrich and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {Polynomial-time approximation algorithms for the antiferromagnetic
Ising model on line graphs},
journal = {CoRR},
volume = {abs/2005.07944},
year = {2020},
url = {https://arxiv.org/abs/2005.07944},
eprinttype = {arXiv},
eprint = {2005.07944},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-07944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuoJL19,
author = {Heng Guo and
Mark Jerrum and
Jingcheng Liu},
title = {Uniform Sampling Through the Lov{\'{a}}sz Local Lemma},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {18:1--18:31},
year = {2019},
url = {https://doi.org/10.1145/3310131},
doi = {10.1145/3310131},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuoJL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GuoJ19,
author = {Heng Guo and
Mark Jerrum},
title = {A Polynomial-Time Approximation Algorithm for All-Terminal Network
Reliability},
journal = {{SIAM} J. Comput.},
volume = {48},
number = {3},
pages = {964--978},
year = {2019},
url = {https://doi.org/10.1137/18M1201846},
doi = {10.1137/18M1201846},
timestamp = {Wed, 24 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GuoJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GoldbergJ19,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating Pairwise Correlations in the Ising Model},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {4},
pages = {23:1--23:20},
year = {2019},
url = {https://doi.org/10.1145/3337785},
doi = {10.1145/3337785},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GoldbergJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-03414,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller and
Kristina Vuskovic},
title = {Counting weighted independent sets beyond the permanent},
journal = {CoRR},
volume = {abs/1909.03414},
year = {2019},
url = {http://arxiv.org/abs/1909.03414},
eprinttype = {arXiv},
eprint = {1909.03414},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-03414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001J18,
author = {Heng Guo and
Mark Jerrum},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {A Polynomial-Time Approximation Algorithm for All-Terminal Network
Reliability},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {68:1--68:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.68},
doi = {10.4230/LIPICS.ICALP.2018.68},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/0001J18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/0001J18a,
author = {Heng Guo and
Mark Jerrum},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Perfect Simulation of the Hard Disks Model by Partial Rejection Sampling},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {69:1--69:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.69},
doi = {10.4230/LIPICS.ICALP.2018.69},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/0001J18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-07342,
author = {Heng Guo and
Mark Jerrum},
title = {Perfect simulation of the Hard Disks Model by Partial Rejection Sampling},
journal = {CoRR},
volume = {abs/1801.07342},
year = {2018},
url = {http://arxiv.org/abs/1801.07342},
eprinttype = {arXiv},
eprint = {1801.07342},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-07342.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-09548,
author = {Heng Guo and
Mark Jerrum},
title = {Approximately counting bases of bicircular matroids},
journal = {CoRR},
volume = {abs/1808.09548},
year = {2018},
url = {http://arxiv.org/abs/1808.09548},
eprinttype = {arXiv},
eprint = {1808.09548},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-09548.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-05830,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating Pairwise Correlations in the Ising Model},
journal = {CoRR},
volume = {abs/1810.05830},
year = {2018},
url = {http://arxiv.org/abs/1810.05830},
eprinttype = {arXiv},
eprint = {1810.05830},
timestamp = {Tue, 30 Oct 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-05830.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JerrumM17,
author = {Mark Jerrum and
Kitty Meeks},
title = {The parameterised complexity of counting even and odd induced subgraphs},
journal = {Comb.},
volume = {37},
number = {5},
pages = {965--990},
year = {2017},
url = {https://doi.org/10.1007/s00493-016-3338-5},
doi = {10.1007/S00493-016-3338-5},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JerrumM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerJM17,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {On the Switch Markov Chain for Perfect Matchings},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {12:1--12:33},
year = {2017},
url = {https://doi.org/10.1145/2822322},
doi = {10.1145/2822322},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BulatovGJRZ17,
author = {Andrei Bulatov and
Leslie Ann Goldberg and
Mark Jerrum and
David Richerby and
Stanislav Zivn{\'{y}}},
title = {Functional clones and expressibility of partition functions},
journal = {Theor. Comput. Sci.},
volume = {687},
pages = {11--39},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.05.001},
doi = {10.1016/J.TCS.2017.05.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BulatovGJRZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GalanisGJ17,
author = {Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum},
title = {A Complexity Trichotomy for Approximately Counting List \emph{H}-Colorings},
journal = {{ACM} Trans. Comput. Theory},
volume = {9},
number = {2},
pages = {9:1--9:22},
year = {2017},
url = {https://doi.org/10.1145/3037381},
doi = {10.1145/3037381},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GalanisGJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GuoJ17,
author = {Heng Guo and
Mark Jerrum},
editor = {Philip N. Klein},
title = {Random cluster dynamics for the Ising model is rapidly mixing},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1818--1827},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.118},
doi = {10.1137/1.9781611974782.118},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/GuoJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuoJ017,
author = {Heng Guo and
Mark Jerrum and
Jingcheng Liu},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
title = {Uniform sampling through the Lovasz local lemma},
booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
pages = {342--355},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055410},
doi = {10.1145/3055399.3055410},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuoJ017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/dagstuhl/Jerrum17,
author = {Mark Jerrum},
editor = {Andrei A. Krokhin and
Stanislav Zivn{\'{y}}},
title = {Counting Constraint Satisfaction Problems},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
series = {Dagstuhl Follow-Ups},
volume = {7},
pages = {205--231},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/DFU.Vol7.15301.8},
doi = {10.4230/DFU.VOL7.15301.8},
timestamp = {Mon, 03 Aug 2020 17:29:58 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Jerrum17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerGGJV17,
author = {Martin E. Dyer and
Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum and
Eric Vigoda},
title = {Random Walks on Small World Networks},
journal = {CoRR},
volume = {abs/1707.02467},
year = {2017},
url = {http://arxiv.org/abs/1707.02467},
eprinttype = {arXiv},
eprint = {1707.02467},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DyerGGJV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-08561,
author = {Heng Guo and
Mark Jerrum},
title = {A simple {FPRAS} for bi-directed reachability},
journal = {CoRR},
volume = {abs/1709.08561},
year = {2017},
url = {http://arxiv.org/abs/1709.08561},
eprinttype = {arXiv},
eprint = {1709.08561},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-08561.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BezakovaGJ17,
author = {Ivona Bez{\'{a}}kov{\'{a}} and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Computational Counting (Dagstuhl Seminar 18341)},
journal = {Dagstuhl Reports},
volume = {7},
number = {8},
pages = {23--44},
year = {2017},
url = {https://doi.org/10.4230/DagRep.7.8.23},
doi = {10.4230/DAGREP.7.8.23},
timestamp = {Fri, 09 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BezakovaGJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CaiGGGJSV16,
author = {Jin{-}Yi Cai and
Andreas Galanis and
Leslie Ann Goldberg and
Heng Guo and
Mark Jerrum and
Daniel Stefankovic and
Eric Vigoda},
title = {{\#}BIS-hardness for 2-spin systems on bipartite bounded degree graphs
in the tree non-uniqueness region},
journal = {J. Comput. Syst. Sci.},
volume = {82},
number = {5},
pages = {690--711},
year = {2016},
url = {https://doi.org/10.1016/j.jcss.2015.11.009},
doi = {10.1016/J.JCSS.2015.11.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CaiGGGJSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalanisGJ16,
author = {Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximately Counting H-Colorings is {\textdollar}{\textbackslash}{\#}{\textbackslash}mathrm\{BIS\}{\textdollar}-Hard},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {680--711},
year = {2016},
url = {https://doi.org/10.1137/15M1020551},
doi = {10.1137/15M1020551},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalanisGJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GoldbergJ16,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The complexity of counting locally maximal satisfying assignments
of Boolean CSPs},
journal = {Theor. Comput. Sci.},
volume = {634},
pages = {35--46},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.04.008},
doi = {10.1016/J.TCS.2016.04.008},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GoldbergJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GalanisGJ16,
author = {Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {A Complexity Trichotomy for Approximately Counting List H-Colourings},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {46:1--46:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.46},
doi = {10.4230/LIPICS.ICALP.2016.46},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GalanisGJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DyerJM16,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
editor = {Robert Krauthgamer},
title = {On the switch Markov chain for perfect matchings},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1972--1983},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch138},
doi = {10.1137/1.9781611974331.CH138},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerJM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoldbergJ16,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {A complexity trichotomy for approximately counting list H-colourings},
journal = {CoRR},
volume = {abs/1602.03985},
year = {2016},
url = {http://arxiv.org/abs/1602.03985},
eprinttype = {arXiv},
eprint = {1602.03985},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoldbergJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuoJ16a,
author = {Heng Guo and
Mark Jerrum},
title = {Random cluster dynamics for the Ising model is rapidly mixing},
journal = {CoRR},
volume = {abs/1605.00139},
year = {2016},
url = {http://arxiv.org/abs/1605.00139},
eprinttype = {arXiv},
eprint = {1605.00139},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuoJ16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BulatovGJRZ16,
author = {Andrei A. Bulatov and
Leslie Ann Goldberg and
Mark Jerrum and
David Richerby and
Stanislav Zivn{\'{y}}},
title = {Functional Clones and Expressibility of Partition Functions},
journal = {CoRR},
volume = {abs/1609.07377},
year = {2016},
url = {http://arxiv.org/abs/1609.07377},
eprinttype = {arXiv},
eprint = {1609.07377},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BulatovGJRZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GuoJL16,
author = {Heng Guo and
Mark Jerrum and
Jingcheng Liu},
title = {Uniform Sampling through the Lov{\'{a}}sz Local Lemma},
journal = {CoRR},
volume = {abs/1611.01647},
year = {2016},
url = {http://arxiv.org/abs/1611.01647},
eprinttype = {arXiv},
eprint = {1611.01647},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GuoJL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenDGJLMR15,
author = {Xi Chen and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Pinyan Lu and
Colin McQuillan and
David Richerby},
title = {The complexity of approximating conservative counting CSPs},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {1},
pages = {311--329},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.06.006},
doi = {10.1016/J.JCSS.2014.06.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ChenDGJLMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GoldbergJM15,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Colin McQuillan},
title = {Approximating the partition function of planar two-state spin systems},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {1},
pages = {330--358},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.06.007},
doi = {10.1016/J.JCSS.2014.06.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GoldbergJM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JerrumM15,
author = {Mark Jerrum and
Kitty Meeks},
title = {The parameterised complexity of counting connected subgraphs and graph
motifs},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {4},
pages = {702--716},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.11.015},
doi = {10.1016/J.JCSS.2014.11.015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JerrumM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pnas/GoldbergJ15,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {A complexity classification of spin systems with an external field},
journal = {Proc. Natl. Acad. Sci. {USA}},
volume = {112},
number = {43},
pages = {13161--13166},
year = {2015},
url = {https://doi.org/10.1073/pnas.1505664112},
doi = {10.1073/PNAS.1505664112},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pnas/GoldbergJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/FabenJ15,
author = {John D. Faben and
Mark Jerrum},
title = {The Complexity of Parity Graph Homomorphism: An Initial Investigation},
journal = {Theory Comput.},
volume = {11},
pages = {35--57},
year = {2015},
url = {https://doi.org/10.4086/toc.2015.v011a002},
doi = {10.4086/TOC.2015.V011A002},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/FabenJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/JerrumM15,
author = {Mark Jerrum and
Kitty Meeks},
title = {Some Hard Families of Parameterized Counting Problems},
journal = {{ACM} Trans. Comput. Theory},
volume = {7},
number = {3},
pages = {11:1--11:18},
year = {2015},
url = {https://doi.org/10.1145/2786017},
doi = {10.1145/2786017},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/JerrumM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GalanisGJ15,
author = {Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Approximately Counting H-Colourings is {\#}{\textbackslash}mathrm
{BIS} {\#} {BIS} -Hard},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {529--541},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_43},
doi = {10.1007/978-3-662-47672-7\_43},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GalanisGJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerJM15,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {On the switch Markov chain for perfect matchings},
journal = {CoRR},
volume = {abs/1501.07725},
year = {2015},
url = {http://arxiv.org/abs/1501.07725},
eprinttype = {arXiv},
eprint = {1501.07725},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DyerJM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GalanisGJ15,
author = {Andreas Galanis and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximately Counting H-Colourings is {\#}BIS-Hard},
journal = {CoRR},
volume = {abs/1502.01335},
year = {2015},
url = {http://arxiv.org/abs/1502.01335},
eprinttype = {arXiv},
eprint = {1502.01335},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GalanisGJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GoldbergJ15,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The complexity of Boolean {\#}MaximalCSP},
journal = {CoRR},
volume = {abs/1509.03543},
year = {2015},
url = {http://arxiv.org/abs/1509.03543},
eprinttype = {arXiv},
eprint = {1509.03543},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GoldbergJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJ14,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Computing the Sign of the Tutte Polynomial},
journal = {{SIAM} J. Comput.},
volume = {43},
number = {6},
pages = {1921--1952},
year = {2014},
url = {https://doi.org/10.1137/12088330X},
doi = {10.1137/12088330X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GoldbergJ14,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Approximately Counting Tree Homomorphisms},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {2},
pages = {8:1--8:31},
year = {2014},
url = {https://doi.org/10.1145/2600917},
doi = {10.1145/2600917},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GoldbergJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/CaiGGGJSV14,
author = {Jin{-}Yi Cai and
Andreas Galanis and
Leslie Ann Goldberg and
Heng Guo and
Mark Jerrum and
Daniel Stefankovic and
Eric Vigoda},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {{\#}BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs
in the Tree Non-uniqueness Region},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {582--595},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.582},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.582},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/CaiGGGJSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JerrumM14,
author = {Mark Jerrum and
Kitty Meeks},
title = {The parameterised complexity of counting even and odd induced subgraphs},
journal = {CoRR},
volume = {abs/1410.3375},
year = {2014},
url = {http://arxiv.org/abs/1410.3375},
eprinttype = {arXiv},
eprint = {1410.3375},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JerrumM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BulatovDGJM13,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Colin McQuillan},
title = {The expressibility of functions on the boolean domain, with applications
to counting CSPs},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {32:1--32:36},
year = {2013},
url = {https://doi.org/10.1145/2528401},
doi = {10.1145/2528401},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BulatovDGJM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GoldbergJ13,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating the Tutte polynomial of a binary matroid and other related
combinatorial polynomials},
journal = {J. Comput. Syst. Sci.},
volume = {79},
number = {1},
pages = {68--78},
year = {2013},
url = {https://doi.org/10.1016/j.jcss.2012.04.005},
doi = {10.1016/J.JCSS.2012.04.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GoldbergJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJ13,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {A Polynomial-Time Algorithm for Estimating the Partition Function
of the Ferromagnetic Ising Model on a Regular Matroid},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {3},
pages = {1132--1157},
year = {2013},
url = {https://doi.org/10.1137/110851213},
doi = {10.1137/110851213},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChenDGJLMR13,
author = {Xi Chen and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Pinyan Lu and
Colin McQuillan and
David Richerby},
editor = {Natacha Portier and
Thomas Wilke},
title = {The complexity of approximating conservative counting CSPs},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {148--159},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.148},
doi = {10.4230/LIPICS.STACS.2013.148},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChenDGJLMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-6306,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Approximately Counting Tree Homomorphisms},
journal = {CoRR},
volume = {abs/1305.6306},
year = {2013},
url = {http://arxiv.org/abs/1305.6306},
eprinttype = {arXiv},
eprint = {1305.6306},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-6306.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JerrumM13,
author = {Mark Jerrum and
Kitty Meeks},
title = {The Parameterised Complexity of Counting Connected Subgraphs},
journal = {CoRR},
volume = {abs/1308.1575},
year = {2013},
url = {http://arxiv.org/abs/1308.1575},
eprinttype = {arXiv},
eprint = {1308.1575},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JerrumM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FabenJ13,
author = {John D. Faben and
Mark Jerrum},
title = {The complexity of parity graph homomorphism: an initial investigation},
journal = {CoRR},
volume = {abs/1309.4033},
year = {2013},
url = {http://arxiv.org/abs/1309.4033},
eprinttype = {arXiv},
eprint = {1309.4033},
timestamp = {Sun, 24 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FabenJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JerrumM13a,
author = {Mark Jerrum and
Kitty Meeks},
title = {Some hard classes of parameterised counting problems},
journal = {CoRR},
volume = {abs/1310.6524},
year = {2013},
url = {http://arxiv.org/abs/1310.6524},
eprinttype = {arXiv},
eprint = {1310.6524},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JerrumM13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CaiGGJ13,
author = {Jin{-}Yi Cai and
Leslie Ann Goldberg and
Heng Guo and
Mark Jerrum},
title = {Approximating the Partition Function of Two-Spin Systems on Bipartite
Graphs},
journal = {CoRR},
volume = {abs/1311.4451},
year = {2013},
url = {http://arxiv.org/abs/1311.4451},
eprinttype = {arXiv},
eprint = {1311.4451},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CaiGGJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BurgisserGJK13,
author = {Peter B{\"{u}}rgisser and
Leslie Ann Goldberg and
Mark Jerrum and
Pascal Koiran},
title = {Computational Counting (Dagstuhl Seminar 13031)},
journal = {Dagstuhl Reports},
volume = {3},
number = {1},
pages = {47--66},
year = {2013},
url = {https://doi.org/10.4230/DagRep.3.1.47},
doi = {10.4230/DAGREP.3.1.47},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BurgisserGJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GoldbergJ12,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Inapproximability of the Tutte polynomial of a planar graph},
journal = {Comput. Complex.},
volume = {21},
number = {4},
pages = {605--642},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0046-4},
doi = {10.1007/S00037-012-0046-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GoldbergJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldbergJ12,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating the partition function of the ferromagnetic potts model},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {25:1--25:31},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371660},
doi = {10.1145/2371656.2371660},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoldbergJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BulatovDGJJR12,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
Mark Jerrum and
David Richerby},
title = {The complexity of weighted and unweighted {\#}CSP},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {2},
pages = {681--688},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.12.002},
doi = {10.1016/J.JCSS.2011.12.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BulatovDGJJR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoldbergJ12,
author = {Leslie Ann Goldberg and
Mark Jerrum},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {The Complexity of Computing the Sign of the Tutte Polynomial (and
Consequent {\#}P-hardness of Approximation)},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {399--410},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_34},
doi = {10.1007/978-3-642-31594-7\_34},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoldbergJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BulatovDGJ12,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Log-supermodular functions, functional clones and counting CSPs},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {302--313},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.302},
doi = {10.4230/LIPICS.STACS.2012.302},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BulatovDGJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-0313,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Computing the Sign of the Tutte Polynomial (and
consequent {\#}P-hardness of Approximation)},
journal = {CoRR},
volume = {abs/1202.0313},
year = {2012},
url = {http://arxiv.org/abs/1202.0313},
eprinttype = {arXiv},
eprint = {1202.0313},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-0313.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-1783,
author = {Xi Chen and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Pinyan Lu and
Colin McQuillan and
David Richerby},
title = {The complexity of approximating conservative counting CSPs},
journal = {CoRR},
volume = {abs/1208.1783},
year = {2012},
url = {http://arxiv.org/abs/1208.1783},
eprinttype = {arXiv},
eprint = {1208.1783},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-4987,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Colin McQuillan},
title = {Approximating the partition function of planar two-state spin systems},
journal = {CoRR},
volume = {abs/1208.4987},
year = {2012},
url = {http://arxiv.org/abs/1208.4987},
eprinttype = {arXiv},
eprint = {1208.4987},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-4987.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoldbergJ11,
author = {Leslie Ann Goldberg and
Mark Jerrum},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {A Polynomial-Time Algorithm for Estimating the Partition Function
of the Ferromagnetic Ising Model on a Regular Matroid},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {521--532},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_44},
doi = {10.1007/978-3-642-22006-7\_44},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoldbergJ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1108-5288,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Log-supermodular functions, functional clones and counting CSPs},
journal = {CoRR},
volume = {abs/1108.5288},
year = {2011},
url = {http://arxiv.org/abs/1108.5288},
eprinttype = {arXiv},
eprint = {1108.5288},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1108-5288.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1109-5242,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {A Counterexample to rapid mixing of the Ge-Stefankovic Process},
journal = {CoRR},
volume = {abs/1109.5242},
year = {2011},
url = {http://arxiv.org/abs/1109.5242},
eprinttype = {arXiv},
eprint = {1109.5242},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1109-5242.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/Jerrum10,
author = {Mark Jerrum},
title = {Constraint satisfaction problems and computational complexity: technical
persepctive},
journal = {Commun. {ACM}},
volume = {53},
number = {9},
pages = {98},
year = {2010},
url = {https://doi.org/10.1145/1810891.1810913},
doi = {10.1145/1810891.1810913},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cacm/Jerrum10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DyerGJ10,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {A Complexity Dichotomy For Hypergraph Partition Functions},
journal = {Comput. Complex.},
volume = {19},
number = {4},
pages = {605--633},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0300-6},
doi = {10.1007/S00037-010-0300-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/DyerGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DyerGJ10,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {An approximation trichotomy for Boolean {\#}CSP},
journal = {J. Comput. Syst. Sci.},
volume = {76},
number = {3-4},
pages = {267--277},
year = {2010},
url = {https://doi.org/10.1016/j.jcss.2009.08.003},
doi = {10.1016/J.JCSS.2009.08.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DyerGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldbergJK10,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Marek Karpinski},
title = {The mixing time of Glauber dynamics for coloring regular trees},
journal = {Random Struct. Algorithms},
volume = {36},
number = {4},
pages = {464--476},
year = {2010},
url = {https://doi.org/10.1002/rsa.20303},
doi = {10.1002/RSA.20303},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GoldbergJK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergGJT10,
author = {Leslie Ann Goldberg and
Martin Grohe and
Mark Jerrum and
Marc Thurley},
title = {A Complexity Dichotomy for Partition Functions with Mixed Signs},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {3336--3402},
year = {2010},
url = {https://doi.org/10.1137/090757496},
doi = {10.1137/090757496},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergGJT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoldbergJ10,
author = {Leslie Ann Goldberg and
Mark Jerrum},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Approximating the Partition Function of the Ferromagnetic Potts Model},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {396--407},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_34},
doi = {10.1007/978-3-642-14165-2\_34},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoldbergJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2010P10481,
editor = {Peter B{\"{u}}rgisser and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Computational Counting, 28.11. - 03.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10481},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/portals/10481/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2010P10481.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BurgisserGJ10,
author = {Peter B{\"{u}}rgisser and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Peter B{\"{u}}rgisser and
Leslie Ann Goldberg and
Mark Jerrum},
title = {10481 Abstracts Collection - Computational Counting},
booktitle = {Computational Counting, 28.11. - 03.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10481},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2945/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BurgisserGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BurgisserGJ10a,
author = {Peter B{\"{u}}rgisser and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Peter B{\"{u}}rgisser and
Leslie Ann Goldberg and
Mark Jerrum},
title = {10481 Executive Summary - Computational Counting},
booktitle = {Computational Counting, 28.11. - 03.12.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10481},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2011/2944/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BurgisserGJ10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-0986,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating the partition function of the ferromagnetic Potts model},
journal = {CoRR},
volume = {abs/1002.0986},
year = {2010},
url = {http://arxiv.org/abs/1002.0986},
eprinttype = {arXiv},
eprint = {1002.0986},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-0986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1005-2678,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
Mark Jerrum and
David Richerby},
title = {The complexity of weighted and unweighted {\#}CSP},
journal = {CoRR},
volume = {abs/1005.2678},
year = {2010},
url = {http://arxiv.org/abs/1005.2678},
eprinttype = {arXiv},
eprint = {1005.2678},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1005-2678.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-5234,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating the Tutte polynomial of a binary matroid and other related
combinatorial polynomials},
journal = {CoRR},
volume = {abs/1006.5234},
year = {2010},
url = {http://arxiv.org/abs/1006.5234},
eprinttype = {arXiv},
eprint = {1006.5234},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-5234.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-6231,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {A polynomial-time algorithm for estimating the partition function
of the ferromagnetic Ising model on a regular matroid},
journal = {CoRR},
volume = {abs/1010.6231},
year = {2010},
url = {http://arxiv.org/abs/1010.6231},
eprinttype = {arXiv},
eprint = {1010.6231},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-6231.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerGJ09,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Weighted Boolean {\#}CSP},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {5},
pages = {1970--1986},
year = {2009},
url = {https://doi.org/10.1137/070690201},
doi = {10.1137/070690201},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerGJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GoldbergGJT09,
author = {Leslie Ann Goldberg and
Martin Grohe and
Mark Jerrum and
Marc Thurley},
editor = {Susanne Albers and
Jean{-}Yves Marion},
title = {A Complexity Dichotomy for Partition Functions with Mixed Signs},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
series = {LIPIcs},
volume = {3},
pages = {493--504},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.STACS.2009.1821},
doi = {10.4230/LIPICS.STACS.2009.1821},
timestamp = {Tue, 22 Jun 2021 15:43:57 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GoldbergGJT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-1724,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Inapproximability of the Tutte polynomial of a planar graph},
journal = {CoRR},
volume = {abs/0907.1724},
year = {2009},
url = {http://arxiv.org/abs/0907.1724},
eprinttype = {arXiv},
eprint = {0907.1724},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-1724.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerGJ08,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Dobrushin Conditions and Systematic Scan},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {6},
pages = {761--779},
year = {2008},
url = {https://doi.org/10.1017/S0963548308009437},
doi = {10.1017/S0963548308009437},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerGJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GoldbergJ08,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Inapproximability of the Tutte polynomial},
journal = {Inf. Comput.},
volume = {206},
number = {7},
pages = {908--929},
year = {2008},
url = {https://doi.org/10.1016/j.ic.2008.04.003},
doi = {10.1016/J.IC.2008.04.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GoldbergJ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2008P8201,
editor = {Martin E. Dyer and
Mark Jerrum and
Marek Karpinski},
title = {Design and Analysis of Randomized and Approximation Algorithms, 11.05.
- 16.05.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08201},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/portals/08201/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2008P8201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DyerJK08,
author = {Martin E. Dyer and
Mark Jerrum and
Marek Karpinski},
editor = {Martin E. Dyer and
Mark Jerrum and
Marek Karpinski},
title = {08201 Abstracts Collection - Design and Analysis of Randomized and
Approximation Algorithms},
booktitle = {Design and Analysis of Randomized and Approximation Algorithms, 11.05.
- 16.05.2008},
series = {Dagstuhl Seminar Proceedings},
volume = {08201},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1551/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DyerJK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0804-1932,
author = {Leslie Ann Goldberg and
Martin Grohe and
Mark Jerrum and
Marc Thurley},
title = {A complexity dichotomy for partition functions with mixed signs},
journal = {CoRR},
volume = {abs/0804.1932},
year = {2008},
url = {http://arxiv.org/abs/0804.1932},
eprinttype = {arXiv},
eprint = {0804.1932},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0804-1932.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0806-0921,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Marek Karpinski},
title = {The Mixing Time of Glauber Dynamics for Colouring Regular Trees},
journal = {CoRR},
volume = {abs/0806.0921},
year = {2008},
url = {http://arxiv.org/abs/0806.0921},
eprinttype = {arXiv},
eprint = {0806.0921},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-0921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-0037,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {A complexity dichotomy for hypergraph partition functions},
journal = {CoRR},
volume = {abs/0811.0037},
year = {2008},
url = {http://arxiv.org/abs/0811.0037},
eprinttype = {arXiv},
eprint = {0811.0037},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-0037.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GoldbergJ07,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Ferromagnetic Ising with Local Fields},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {1},
pages = {43--61},
year = {2007},
url = {https://doi.org/10.1017/S096354830600767X},
doi = {10.1017/S096354830600767X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GoldbergJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldbergJ07,
author = {Leslie Ann Goldberg and
Mark Jerrum},
editor = {David S. Johnson and
Uriel Feige},
title = {Inapproximability of the Tutte polynomial},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {459--468},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250858},
doi = {10.1145/1250790.1250858},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldbergJ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0704-3683,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {The Complexity of Weighted Boolean {\#}CSP},
journal = {CoRR},
volume = {abs/0704.3683},
year = {2007},
url = {http://arxiv.org/abs/0704.3683},
eprinttype = {arXiv},
eprint = {0704.3683},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0704-3683.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0710-4272,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {An approximation trichotomy for Boolean {\#}CSP},
journal = {CoRR},
volume = {abs/0710.4272},
year = {2007},
url = {http://arxiv.org/abs/0710.4272},
eprinttype = {arXiv},
eprint = {0710.4272},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0710-4272.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-math-0702744,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Matrix norms and rapid mixing for spin systems},
journal = {CoRR},
volume = {abs/math/0702744},
year = {2007},
url = {http://arxiv.org/abs/math/0702744},
eprinttype = {arXiv},
eprint = {math/0702744},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-math-0702744.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Jerrum06,
author = {Mark Jerrum},
title = {Two Remarks Concerning Balanced Matroids},
journal = {Comb.},
volume = {26},
number = {6},
pages = {733--742},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0039-5},
doi = {10.1007/S00493-006-0039-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Jerrum06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CryanDGJM06,
author = {Mary Cryan and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Russell A. Martin},
title = {Rapidly Mixing Markov Chains for Sampling Contingency Tables with
a Constant Number of Rows},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {1},
pages = {247--278},
year = {2006},
url = {https://doi.org/10.1137/S0097539703434243},
doi = {10.1137/S0097539703434243},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CryanDGJM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DyerGJ06,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Dobrushin Conditions and Systematic Scan},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {327--338},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_31},
doi = {10.1007/11830924\_31},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/DyerGJ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0605140,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Inapproximability of the Tutte polynomial},
journal = {CoRR},
volume = {abs/cs/0605140},
year = {2006},
url = {http://arxiv.org/abs/cs/0605140},
eprinttype = {arXiv},
eprint = {cs/0605140},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0605140.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2005P5201,
editor = {Martin E. Dyer and
Mark Jerrum and
Marek Karpinski},
title = {Design and Analysis of Randomized and Approximation Algorithms, 15.05.
- 20.05.2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05201},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/portals/05201/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2005P5201.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DyerJK05,
author = {Martin E. Dyer and
Mark Jerrum and
Marek Karpinski},
editor = {Martin E. Dyer and
Mark Jerrum and
Marek Karpinski},
title = {05201 Abstracts Collection - Design and Analysis of Randomized and
Approximation Algorithms},
booktitle = {Design and Analysis of Randomized and Approximation Algorithms, 15.05.
- 20.05.2005},
series = {Dagstuhl Seminar Proceedings},
volume = {05201},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"{u}}r Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2005},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/319/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DyerJK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-075,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Dobrushin conditions and Systematic Scan},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-075}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-075/index.html},
eprinttype = {ECCC},
eprint = {TR05-075},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-075.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DyerGGJ03,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum},
title = {The Relative Complexity of Approximate Counting Problems},
journal = {Algorithmica},
volume = {38},
number = {3},
pages = {471--500},
year = {2004},
url = {https://doi.org/10.1007/s00453-003-1073-y},
doi = {10.1007/S00453-003-1073-Y},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DyerGGJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DyerGJ04,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
title = {Counting and sampling H-colourings?},
journal = {Inf. Comput.},
volume = {189},
number = {1},
pages = {1--16},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2003.09.001},
doi = {10.1016/J.IC.2003.09.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/DyerGJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JerrumSV04,
author = {Mark Jerrum and
Alistair Sinclair and
Eric Vigoda},
title = {A polynomial-time approximation algorithm for the permanent of a matrix
with nonnegative entries},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {671--697},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008738},
doi = {10.1145/1008731.1008738},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JerrumSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJKP04,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Sampath Kannan and
Mike Paterson},
title = {A bound on the capacity of backoff and acknowledgment-based protocols},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {2},
pages = {313--331},
year = {2004},
url = {https://doi.org/10.1137/S0097539700381851},
doi = {10.1137/S0097539700381851},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJKP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GoldbergJP03,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Mike Paterson},
title = {The computational complexity of two-state spin systems},
journal = {Random Struct. Algorithms},
volume = {23},
number = {2},
pages = {133--154},
year = {2003},
url = {https://doi.org/10.1002/rsa.10090},
doi = {10.1002/RSA.10090},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GoldbergJP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GoldbergJ02,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The "Burnside Process" Converges Slowly},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {21--34},
year = {2002},
url = {https://doi.org/10.1017/S096354830100493X},
doi = {10.1017/S096354830100493X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GoldbergJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerGGIJ02,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Gabriel Istrate and
Mark Jerrum},
title = {Convergence Of The Iterated Prisoner's Dilemma Game},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {135--147},
year = {2002},
url = {https://doi.org/10.1017/S096354830100503X},
doi = {10.1017/S096354830100503X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerGGIJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerFJ02,
author = {Martin E. Dyer and
Alan M. Frieze and
Mark Jerrum},
title = {On Counting Independent Sets in Sparse Graphs},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {5},
pages = {1527--1541},
year = {2002},
url = {https://doi.org/10.1137/S0097539701383844},
doi = {10.1137/S0097539701383844},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerFJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CryanDGJM02,
author = {Mary Cryan and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Russell A. Martin},
title = {Rapidly Mixing Markov Chains for Sampling Contingency Tables with
a Constant Number of Rows},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {711--720},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181996},
doi = {10.1109/SFCS.2002.1181996},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CryanDGJM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JerrumS02,
author = {Mark Jerrum and
Jung{-}Bae Son},
title = {Spectral Gap and log-Sobolev Constant for Balanced Matroids},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {721},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181997},
doi = {10.1109/SFCS.2002.1181997},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JerrumS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/DyerGJ02,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Jos{\'{e}} D. P. Rolim and
Salil P. Vadhan},
title = {Counting and Sampling H-Colourings},
booktitle = {Randomization and Approximation Techniques, 6th International Workshop,
{RANDOM} 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2483},
pages = {51--67},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45726-7\_5},
doi = {10.1007/3-540-45726-7\_5},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/DyerGJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/DyerJV02,
author = {Martin E. Dyer and
Mark Jerrum and
Eric Vigoda},
editor = {Jos{\'{e}} D. P. Rolim and
Salil P. Vadhan},
title = {Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs},
booktitle = {Randomization and Approximation Techniques, 6th International Workshop,
{RANDOM} 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2483},
pages = {68--77},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45726-7\_6},
doi = {10.1007/3-540-45726-7\_6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/random/DyerJV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/DyerJV01,
author = {Martin E. Dyer and
Mark Jerrum and
Eric Vigoda},
editor = {Jaroslav Nesetril and
Peter Winkler},
title = {Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs},
booktitle = {Graphs, Morphisms and Statistical Physics, Proceedings of a {DIMACS}
Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {63},
pages = {87--95},
publisher = {{DIMACS/AMS}},
year = {2001},
url = {https://doi.org/10.1090/dimacs/063/06},
doi = {10.1090/DIMACS/063/06},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/DyerJV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JerrumSV01,
author = {Mark Jerrum and
Alistair Sinclair and
Eric Vigoda},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {A polynomial-time approximation algorithm for the permanent of a matrix
with non-negative entries},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {712--721},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380877},
doi = {10.1145/380752.380877},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JerrumSV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmsjcm/GoldbergJ00,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Counting Unlabelled Subtrees of a Tree is {\#}P-complete},
journal = {{LMS} J. Comput. Math.},
volume = {3},
pages = {117--124},
year = {2000},
url = {https://doi.org/10.1112/s1461157000000243},
doi = {10.1112/S1461157000000243},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmsjcm/GoldbergJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerGGJM00,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum and
Michael Mitzenmacher},
title = {An Extension of Path Coupling and Its Application to the Glauber Dynamics
for Graph Colorings},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {6},
pages = {1962--1975},
year = {2000},
url = {https://doi.org/10.1137/S0097539700372708},
doi = {10.1137/S0097539700372708},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerGGJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DyerGGJ00,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum},
editor = {Klaus Jansen and
Samir Khuller},
title = {On the relative complexity of approximate counting problems},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {108--119},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_12},
doi = {10.1007/3-540-44436-X\_12},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/approx/DyerGGJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GoldbergJKP00,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Sampath Kannan and
Mike Paterson},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {705--716},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_59},
doi = {10.1007/3-540-45022-X\_59},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GoldbergJKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DyerGGJM00,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Catherine S. Greenhill and
Mark Jerrum and
Michael Mitzenmacher},
editor = {David B. Shmoys},
title = {An extension of path coupling and its application to the Glauber dynamics
for graph colourings (extended abstract)},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {616--624},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338614},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerGGJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-079,
author = {Mark Jerrum and
Eric Vigoda},
title = {A polynomial-time approximation algorithm for the permanent of a matrix
with non-negative entries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-079}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-079/index.html},
eprinttype = {ECCC},
eprint = {TR00-079},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-079.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BubleyDGJ99,
author = {Russ Bubley and
Martin E. Dyer and
Catherine S. Greenhill and
Mark Jerrum},
title = {On Approximately Counting Colorings of Small Degree Graphs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {387--400},
year = {1999},
url = {https://doi.org/10.1137/S0097539798338175},
doi = {10.1137/S0097539798338175},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BubleyDGJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJ99,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Randomly Sampling Molecules},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {3},
pages = {834--853},
year = {1999},
url = {https://doi.org/10.1137/S0097539797318864},
doi = {10.1137/S0097539797318864},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DyerFJ99,
author = {Martin E. Dyer and
Alan M. Frieze and
Mark Jerrum},
title = {On Counting Independent Sets in Sparse Graphs},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {210--217},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814593},
doi = {10.1109/SFFCS.1999.814593},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DyerFJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HirshfeldJ99,
author = {Yoram Hirshfeld and
Mark Jerrum},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Bisimulation Equivanlence Is Decidable for Normed Process Algebra},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {412--421},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_38},
doi = {10.1007/3-540-48523-6\_38},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HirshfeldJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/JerrumS98,
author = {Mark Jerrum and
Gregory B. Sorkin},
title = {The Metropolis Algorithm for Graph Bisection},
journal = {Discret. Appl. Math.},
volume = {82},
number = {1-3},
pages = {155--175},
year = {1998},
url = {https://doi.org/10.1016/S0166-218X(97)00133-9},
doi = {10.1016/S0166-218X(97)00133-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/JerrumS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BubleyDJ98,
author = {Russ Bubley and
Martin E. Dyer and
Mark Jerrum},
title = {An elementary analysis of a procedure for sampling points in a convex
body},
journal = {Random Struct. Algorithms},
volume = {12},
number = {3},
pages = {213--235},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1098-2418(199805)12:3\&\#60;213::AID-RSA1\&\#62;3.0.CO;2-Y},
doi = {10.1002/(SICI)1098-2418(199805)12:3\&\#60;213::AID-RSA1\&\#62;3.0.CO;2-Y},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BubleyDJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJM98,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Philip D. MacKenzie},
title = {An Omega(sqrt\{log log n\}) Lower Bound for Routing in Optical Networks},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {4},
pages = {1083--1098},
year = {1998},
url = {https://doi.org/10.1137/S0097539794272569},
doi = {10.1137/S0097539794272569},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerFJ98,
author = {Martin E. Dyer and
Alan M. Frieze and
Mark Jerrum},
title = {Approximately Counting Hamilton Paths and Cycles in Dense Graphs},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {5},
pages = {1262--1272},
year = {1998},
url = {https://doi.org/10.1137/S009753979426112X},
doi = {10.1137/S009753979426112X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerFJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/GoldbergJ98,
author = {Leslie Ann Goldberg and
Mark Jerrum},
editor = {Michael Luby and
Jos{\'{e}} D. P. Rolim and
Maria J. Serna},
title = {The "Burnside Process" Converges Slowly},
booktitle = {Randomization and Approximation Techniques in Computer Science, Second
International Workshop, RANDOM'98, Barcelona, Spain, October 8-10,
1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1518},
pages = {331--345},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49543-6\_26},
doi = {10.1007/3-540-49543-6\_26},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/GoldbergJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FriezeJ97,
author = {Alan M. Frieze and
Mark Jerrum},
title = {Improved Approximation Algorithms for {MAX} k-CUT and {MAX} {BISECTION}},
journal = {Algorithmica},
volume = {18},
number = {1},
pages = {67--81},
year = {1997},
url = {https://doi.org/10.1007/BF02523688},
doi = {10.1007/BF02523688},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FriezeJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GoreJKSM97,
author = {Vivek Gore and
Mark Jerrum and
Sampath Kannan and
Z. Sweedyk and
Stephen R. Mahaney},
title = {A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free
Language},
journal = {Inf. Comput.},
volume = {134},
number = {1},
pages = {59--74},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2621},
doi = {10.1006/INCO.1997.2621},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GoreJKSM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GoldbergJLR97,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Frank Thomson Leighton and
Satish Rao},
title = {Doubly Logarithmic Communication Algorithms for Optical-Communication
Parallel Computers},
journal = {{SIAM} J. Comput.},
volume = {26},
number = {4},
pages = {1100--1119},
year = {1997},
url = {https://doi.org/10.1137/S0097539793259483},
doi = {10.1137/S0097539793259483},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GoldbergJLR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GoldbergJ97,
author = {Leslie Ann Goldberg and
Mark Jerrum},
editor = {Michael E. Saks},
title = {Randomly Sampling Molecules},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {183--192},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314255},
timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
biburl = {https://dblp.org/rec/conf/soda/GoldbergJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoreJ97,
author = {Vivek Gore and
Mark Jerrum},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {The Swendsen-Wang Process Does Not Always Mix Rapidly},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {674--681},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258662},
doi = {10.1145/258533.258662},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoreJ97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JerrumV96,
author = {Mark Jerrum and
Umesh V. Vazirani},
title = {A Mildly Exponential Approximation Algorithm for the Permanent},
journal = {Algorithmica},
volume = {16},
number = {4/5},
pages = {392--401},
year = {1996},
url = {https://doi.org/10.1007/BF01940871},
doi = {10.1007/BF01940871},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JerrumV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FriezeJMRW96,
author = {Alan M. Frieze and
Mark Jerrum and
Michael Molloy and
Robert W. Robinson and
Nicholas C. Wormald},
title = {Generating and Counting Hamilton Cycles in Random Regular Graphs},
journal = {J. Algorithms},
volume = {21},
number = {1},
pages = {176--198},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0042},
doi = {10.1006/JAGM.1996.0042},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FriezeJMRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/HirshfeldJM96,
author = {Yoram Hirshfeld and
Mark Jerrum and
Faron Moller},
title = {A Polynomial-Time Algorithm for Deciding Bisimulation Equivalence
of Normed Basic Parallel Processes},
journal = {Math. Struct. Comput. Sci.},
volume = {6},
number = {3},
pages = {251--259},
year = {1996},
url = {https://doi.org/10.1017/S0960129500000992},
doi = {10.1017/S0960129500000992},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/HirshfeldJM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HirshfeldJM96,
author = {Yoram Hirshfeld and
Mark Jerrum and
Faron Moller},
title = {A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free
Processes},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {143--159},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00064-X},
doi = {10.1016/0304-3975(95)00064-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HirshfeldJM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FriezeJK96,
author = {Alan M. Frieze and
Mark Jerrum and
Ravi Kannan},
title = {Learning Linear Transformations},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {359--368},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548495},
doi = {10.1109/SFCS.1996.548495},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FriezeJK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FriezeJ95,
author = {Alan M. Frieze and
Mark Jerrum},
title = {An Analysis of a Monte Carlo Algorithm for Estimating the Permanent},
journal = {Comb.},
volume = {15},
number = {1},
pages = {67--83},
year = {1995},
url = {https://doi.org/10.1007/BF01294460},
doi = {10.1007/BF01294460},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FriezeJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ml/GoldbergJ95,
author = {Paul W. Goldberg and
Mark Jerrum},
title = {Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized
by Real Numbers},
journal = {Mach. Learn.},
volume = {18},
number = {2-3},
pages = {131--148},
year = {1995},
url = {https://doi.org/10.1007/BF00993408},
doi = {10.1007/BF00993408},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ml/GoldbergJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Jerrum95,
author = {Mark Jerrum},
title = {A Very Simple Algorithm for Estimating the Number of k-Colorings of
a Low-Degree Graph},
journal = {Random Struct. Algorithms},
volume = {7},
number = {2},
pages = {157--166},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240070205},
doi = {10.1002/RSA.3240070205},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Jerrum95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FriezeJ95,
author = {Alan M. Frieze and
Mark Jerrum},
editor = {Egon Balas and
Jens Clausen},
title = {Improved Approximation Algorithms for {MAX} \emph{k}-CUT and {MAX}
{BISECTION}},
booktitle = {Integer Programming and Combinatorial Optimization, 4th International
{IPCO} Conference, Copenhagen, Denmark, May 29-31, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {920},
pages = {1--13},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-59408-6\_37},
doi = {10.1007/3-540-59408-6\_37},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FriezeJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Jerrum94,
author = {Mark Jerrum},
title = {Simple Translation-Invariant Concepts Are Hard to Learn},
journal = {Inf. Comput.},
volume = {113},
number = {2},
pages = {300--311},
year = {1994},
url = {https://doi.org/10.1006/inco.1994.1074},
doi = {10.1006/INCO.1994.1074},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Jerrum94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Jerrum94,
author = {Mark Jerrum},
title = {Counting Trees in a Graph is {\#}P-Complete},
journal = {Inf. Process. Lett.},
volume = {51},
number = {3},
pages = {111--116},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00085-9},
doi = {10.1016/0020-0190(94)00085-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Jerrum94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/IrvingJ94,
author = {Robert W. Irving and
Mark Jerrum},
title = {Three-Dimensional Statistical Data Security Problems},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {1},
pages = {170--184},
year = {1994},
url = {https://doi.org/10.1137/S0097539790191010},
doi = {10.1137/S0097539790191010},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/IrvingJ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HirshfeldJM94,
author = {Yoram Hirshfeld and
Mark Jerrum and
Faron Moller},
title = {A Polynomial-time Algorithm for Deciding Equivalence of Normed Context-free
Processes},
booktitle = {35th Annual Symposium on Foundations of Computer Science, Santa Fe,
New Mexico, USA, 20-22 November 1994},
pages = {623--631},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SFCS.1994.365729},
doi = {10.1109/SFCS.1994.365729},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HirshfeldJM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DyerFJ94,
author = {Martin E. Dyer and
Alan M. Frieze and
Mark Jerrum},
editor = {Daniel Dominic Sleator},
title = {Approximately Counting Hamilton Cycles in Dense Graphs},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {336--343},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314557},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/DyerFJ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GoldbergJM94,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Philip D. MacKenzie},
editor = {Lawrence Snyder and
Charles E. Leiserson},
title = {An W(log log n) Lower Bound for Routing in Optical Networks},
booktitle = {Proceedings of the 6th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '94, Cape May, New Jersey, USA, June 27-29,
1994},
pages = {147--156},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/181014.181093},
doi = {10.1145/181014.181093},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GoldbergJM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JerrumS93,
author = {Mark Jerrum and
Alistair Sinclair},
title = {Polynomial-Time Approximation Algorithms for the Ising Model},
journal = {{SIAM} J. Comput.},
volume = {22},
number = {5},
pages = {1087--1116},
year = {1993},
url = {https://doi.org/10.1137/0222066},
doi = {10.1137/0222066},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/JerrumS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GoldbergJ93,
author = {Paul Goldberg and
Mark Jerrum},
editor = {Lenny Pitt},
title = {Bounding the Vapnik-Chervonenkis Dimension of Concept Classes Parameterized
by Real Numbers},
booktitle = {Proceedings of the Sixth Annual {ACM} Conference on Computational
Learning Theory, {COLT} 1993, Santa Cruz, CA, USA, July 26-28, 1993},
pages = {361--369},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/168304.168377},
doi = {10.1145/168304.168377},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/colt/GoldbergJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JerrumS93,
author = {Mark Jerrum and
Gregory B. Sorkin},
title = {Simulated Annealing for Graph Bisection},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {94--103},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366878},
doi = {10.1109/SFCS.1993.366878},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JerrumS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Jerrum93,
author = {Mark Jerrum},
editor = {Giovanni Rinaldi and
Laurence A. Wolsey},
title = {An analysis of a Monte Carlo algorithm for estimating the permanent},
booktitle = {Proceedings of the 3rd Integer Programming and Combinatorial Optimization
Conference, Erice, Italy, April 29 - May 1, 1993},
pages = {171--182},
publisher = {{CIACO}},
year = {1993},
timestamp = {Wed, 09 Oct 2002 11:26:33 +0200},
biburl = {https://dblp.org/rec/conf/ipco/Jerrum93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GoldbergJLR93,
author = {Leslie Ann Goldberg and
Mark Jerrum and
Frank Thomson Leighton and
Satish Rao},
editor = {Lawrence Snyder},
title = {A Doubly Logarithmic Communication Algorithm for the Completely Connected
Optical Communication Parallel Computer},
booktitle = {Proceedings of the 5th Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '93, Velen, Germany, June 30 - July 2, 1993},
pages = {300--309},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/165231.166108},
doi = {10.1145/165231.166108},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GoldbergJLR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Jerrum92,
author = {Mark Jerrum},
title = {Large Cliques Elude the Metropolis Process},
journal = {Random Struct. Algorithms},
volume = {3},
number = {4},
pages = {347--360},
year = {1992},
url = {https://doi.org/10.1002/rsa.3240030402},
doi = {10.1002/RSA.3240030402},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Jerrum92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/Jerrum92,
author = {Mark Jerrum},
editor = {Joel Friedman},
title = {Uniform Sampling Modulo a Group of Symmetries Using Markov Chain Simulation},
booktitle = {Expanding Graphs, Proceedings of a {DIMACS} Workshop, Princeton, New
Jersey, USA, May 11-14, 1992},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {10},
pages = {37--47},
publisher = {{DIMACS/AMS}},
year = {1992},
url = {https://doi.org/10.1090/dimacs/010/04},
doi = {10.1090/DIMACS/010/04},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/Jerrum92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JerrumV92,
author = {Mark Jerrum and
Umesh V. Vazirani},
title = {A Mildly Exponential Approximation Algorithm for the Permanent},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {320--326},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267759},
doi = {10.1109/SFCS.1992.267759},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JerrumV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JerrumS90,
author = {Mark Jerrum and
Alistair Sinclair},
title = {Fast Uniform Generation of Regular Graphs},
journal = {Theor. Comput. Sci.},
volume = {73},
number = {1},
pages = {91--100},
year = {1990},
url = {https://doi.org/10.1016/0304-3975(90)90164-D},
doi = {10.1016/0304-3975(90)90164-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JerrumS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JerrumS90,
author = {Mark Jerrum and
Alistair Sinclair},
editor = {Mike Paterson},
title = {Polynomial-Time Approximation Algorithms for Ising Model (Extended
Abstract)},
booktitle = {Automata, Languages and Programming, 17th International Colloquium,
ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {443},
pages = {462--475},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0032051},
doi = {10.1007/BFB0032051},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JerrumS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/SinclairJ89,
author = {Alistair Sinclair and
Mark Jerrum},
title = {Approximate Counting, Uniform Generation and Rapidly Mixing Markov
Chains},
journal = {Inf. Comput.},
volume = {82},
number = {1},
pages = {93--133},
year = {1989},
url = {https://doi.org/10.1016/0890-5401(89)90067-9},
doi = {10.1016/0890-5401(89)90067-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/SinclairJ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/JerrumS89,
author = {Mark Jerrum and
Alistair Sinclair},
title = {Approximating the Permanent},
journal = {{SIAM} J. Comput.},
volume = {18},
number = {6},
pages = {1149--1178},
year = {1989},
url = {https://doi.org/10.1137/0218077},
doi = {10.1137/0218077},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/JerrumS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cga/GaoKMRSJ88,
author = {Shaodi Gao and
Michael Kaufmann and
Kurt Mehlhorn and
Wolfgang R{\"{u}}lling and
Christoph Storb and
Mark Jerrum},
editor = {Hartmut Noltemeier},
title = {On Continuous Homotopic One Layer Routing},
booktitle = {Computational Geometry and its Applications, CG'88, International
Workshop on Computational Geometry, W{\"{u}}rzburg, Germany,
March 24-25, 1988},
series = {Lecture Notes in Computer Science},
volume = {333},
pages = {55--70},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-50335-8\_24},
doi = {10.1007/3-540-50335-8\_24},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/cga/GaoKMRSJ88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/GaoJKMR89,
author = {Shaodi Gao and
Mark Jerrum and
Michael Kaufmann and
Kurt Mehlhorn and
Wolfgang R{\"{u}}lling},
editor = {Herbert Edelsbrunner},
title = {On Continuous Homotopic One Layer Routing},
booktitle = {Proceedings of the Fourth Annual Symposium on Computational Geometry,
Urbana-Champaign, IL, USA, June 6-8, 1988},
pages = {392--402},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/73393.73433},
doi = {10.1145/73393.73433},
timestamp = {Mon, 14 Jun 2021 16:25:17 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/GaoJKMR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JerrumS88,
author = {Mark Jerrum and
Alistair Sinclair},
editor = {Janos Simon},
title = {Conductance and the Rapid Mixing Property for Markov Chains: the Approximation
of the Permanent Resolved (Preliminary Version)},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {235--244},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62234},
doi = {10.1145/62212.62234},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JerrumS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/SinclairJ87,
author = {Alistair Sinclair and
Mark Jerrum},
editor = {Herbert G{\"{o}}ttler and
Hans J{\"{u}}rgen Schneider},
title = {Approximate Counting, Uniform Generation and Rapidly Mixing Markov
Chains},
booktitle = {Graph-Theoretic Concepts in Computer Science, International Workshop,
{WG} '87, Kloster Banz/Staffelstein, Germany, June 29 - July 1, 1987,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {314},
pages = {134--148},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/3-540-19422-3\_11},
doi = {10.1007/3-540-19422-3\_11},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/SinclairJ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Jerrum86,
author = {Mark Jerrum},
title = {A Compact Representation for Permutation Groups},
journal = {J. Algorithms},
volume = {7},
number = {1},
pages = {60--78},
year = {1986},
url = {https://doi.org/10.1016/0196-6774(86)90038-6},
doi = {10.1016/0196-6774(86)90038-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Jerrum86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JerrumVV86,
author = {Mark Jerrum and
Leslie G. Valiant and
Vijay V. Vazirani},
title = {Random Generation of Combinatorial Structures from a Uniform Distribution},
journal = {Theor. Comput. Sci.},
volume = {43},
pages = {169--188},
year = {1986},
url = {https://doi.org/10.1016/0304-3975(86)90174-X},
doi = {10.1016/0304-3975(86)90174-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JerrumVV86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Jerrum85,
author = {Mark Jerrum},
title = {The Complexity of Finding Minimum-Length Generator Sequences},
journal = {Theor. Comput. Sci.},
volume = {36},
pages = {265--289},
year = {1985},
url = {https://doi.org/10.1016/0304-3975(85)90047-7},
doi = {10.1016/0304-3975(85)90047-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Jerrum85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Jerrum85,
author = {Mark Jerrum},
editor = {Wilfried Brauer},
title = {Random Generation of Combinatorial Structures from a Uniform Distribution
(Extended Abstract)},
booktitle = {Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece,
July 15-19, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {194},
pages = {290--299},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0015754},
doi = {10.1007/BFB0015754},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Jerrum85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/JerrumS84,
author = {Mark Jerrum and
Sven Skyum},
title = {Families of Fixed Degree Graphs for Processor Interconnection},
journal = {{IEEE} Trans. Computers},
volume = {33},
number = {2},
pages = {190--194},
year = {1984},
url = {https://doi.org/10.1109/TC.1984.1676410},
doi = {10.1109/TC.1984.1676410},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/JerrumS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Jerrum84,
author = {Mark Jerrum},
editor = {Jan Paredaens},
title = {The Complexity of Finding Minimum-Length Generator Sequences (Extended
Abstract)},
booktitle = {Automata, Languages and Programming, 11th Colloquium, Antwerp, Belgium,
July 16-20, 1984, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {172},
pages = {270--280},
publisher = {Springer},
year = {1984},
url = {https://doi.org/10.1007/3-540-13345-3\_24},
doi = {10.1007/3-540-13345-3\_24},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Jerrum84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JerrumS82,
author = {Mark Jerrum and
Marc Snir},
title = {Some Exact Complexity Results for Straight-Line Computations over
Semirings},
journal = {J. {ACM}},
volume = {29},
number = {3},
pages = {874--897},
year = {1982},
url = {https://doi.org/10.1145/322326.322341},
doi = {10.1145/322326.322341},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JerrumS82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Jerrum82,
author = {Mark Jerrum},
title = {A Compact Representation for Permutation Groups},
booktitle = {23rd Annual Symposium on Foundations of Computer Science, Chicago,
Illinois, USA, 3-5 November 1982},
pages = {126--133},
publisher = {{IEEE} Computer Society},
year = {1982},
url = {https://doi.org/10.1109/SFCS.1982.52},
doi = {10.1109/SFCS.1982.52},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Jerrum82.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-05-08 20:54 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:
