default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Martin E. Dyer
@article{DBLP:journals/jcss/GovorovCD23,
author = {Artem Govorov and
Jin{-}Yi Cai and
Martin E. Dyer},
title = {A dichotomy for bounded degree graph homomorphisms with nonnegative
weights},
journal = {J. Comput. Syst. Sci.},
volume = {132},
pages = {1--15},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2022.09.002},
doi = {10.1016/J.JCSS.2022.09.002},
timestamp = {Mon, 12 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GovorovCD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-08499,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill},
title = {A triangle process on graphs with given degree sequence},
journal = {CoRR},
volume = {abs/2301.08499},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.08499},
doi = {10.48550/ARXIV.2301.08499},
eprinttype = {arXiv},
eprint = {2301.08499},
timestamp = {Fri, 27 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-08499.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-01482,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Thick Forests},
journal = {CoRR},
volume = {abs/2309.01482},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.01482},
doi = {10.48550/ARXIV.2309.01482},
eprinttype = {arXiv},
eprint = {2309.01482},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-01482.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/dm/DyerGKRS21,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Pieter Kleer and
James Ross and
Leen Stougie},
title = {Sampling hypergraphs with given degrees},
journal = {Discret. Math.},
volume = {344},
number = {11},
pages = {112566},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112566},
doi = {10.1016/J.DISC.2021.112566},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DyerGKRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerGM21,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
title = {Counting independent sets in graphs with bounded bipartite pathwidth},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {204--237},
year = {2021},
url = {https://doi.org/10.1002/rsa.21003},
doi = {10.1002/RSA.21003},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerGM21.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}
}
@inproceedings{DBLP:conf/iwoca/CooperDG21,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill},
editor = {Paola Flocchini and
Lucia Moura},
title = {A Triangle Process on Regular Graphs},
booktitle = {Combinatorial Algorithms - 32nd International Workshop, {IWOCA} 2021,
Ottawa, ON, Canada, July 5-7, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12757},
pages = {310--323},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79987-8\_22},
doi = {10.1007/978-3-030-79987-8\_22},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/CooperDG21.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}
}
@inproceedings{DBLP:conf/icalp/GovorovCD20,
author = {Artem Govorov and
Jin{-}Yi Cai and
Martin E. Dyer},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative
Weights},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {66:1--66:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.66},
doi = {10.4230/LIPICS.ICALP.2020.66},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GovorovCD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-02021,
author = {Artem Govorov and
Jin{-}Yi Cai and
Martin E. Dyer},
title = {A dichotomy for bounded degree graph homomorphisms with nonnegative
weights},
journal = {CoRR},
volume = {abs/2002.02021},
year = {2020},
url = {https://arxiv.org/abs/2002.02021},
eprinttype = {arXiv},
eprint = {2002.02021},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-02021.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/corr/abs-2006-12021,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Pieter Kleer and
James Ross and
Leen Stougie},
title = {Sampling hypergraphs with given degrees},
journal = {CoRR},
volume = {abs/2006.12021},
year = {2020},
url = {https://arxiv.org/abs/2006.12021},
eprinttype = {arXiv},
eprint = {2006.12021},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-12972,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill},
title = {A triangle process on regular graphs},
journal = {CoRR},
volume = {abs/2012.12972},
year = {2020},
url = {https://arxiv.org/abs/2012.12972},
eprinttype = {arXiv},
eprint = {2012.12972},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-12972.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CooperDGH19,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill and
Andrew J. Handley},
title = {The flip Markov chain for connected regular graphs},
journal = {Discret. Appl. Math.},
volume = {254},
pages = {56--79},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.06.019},
doi = {10.1016/J.DAM.2018.06.019},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CooperDGH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Quasimonotone graphs},
journal = {Discret. Appl. Math.},
volume = {271},
pages = {25--48},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.08.006},
doi = {10.1016/J.DAM.2019.08.006},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijisec/DyerDX19,
author = {James Dyer and
Martin E. Dyer and
Jie Xu},
title = {Practical homomorphic encryption over the integers for secure computation
in the cloud},
journal = {Int. J. Inf. Sec.},
volume = {18},
number = {5},
pages = {549--579},
year = {2019},
url = {https://doi.org/10.1007/s10207-019-00427-0},
doi = {10.1007/S10207-019-00427-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijisec/DyerDX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting independent sets in cocomparability graphs},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {31--36},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.005},
doi = {10.1016/J.IPL.2018.12.005},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/istr/DyerDD19,
author = {James Dyer and
Martin E. Dyer and
Karim Djemame},
title = {Order-preserving encryption using approximate common divisors},
journal = {J. Inf. Secur. Appl.},
volume = {49},
year = {2019},
url = {https://doi.org/10.1016/j.jisa.2019.102391},
doi = {10.1016/J.JISA.2019.102391},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/istr/DyerDD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting Perfect Matchings and the Switch Chain},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {3},
pages = {1146--1174},
year = {2019},
url = {https://doi.org/10.1137/18M1172910},
doi = {10.1137/18M1172910},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DyerGM19,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {298--310},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_23},
doi = {10.1007/978-3-030-30786-8\_23},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DyerGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-04490,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill},
title = {Triangle-creation processes on cubic graphs},
journal = {CoRR},
volume = {abs/1905.04490},
year = {2019},
url = {http://arxiv.org/abs/1905.04490},
eprinttype = {arXiv},
eprint = {1905.04490},
timestamp = {Tue, 28 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-04490.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}
}
@article{DBLP:journals/siamdm/CooperDFR18,
author = {Colin Cooper and
Martin E. Dyer and
Alan M. Frieze and
Nicol{\'{a}}s Rivera},
title = {Discordant Voting Processes on Finite Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {32},
number = {4},
pages = {2398--2420},
year = {2018},
url = {https://doi.org/10.1137/16M1105979},
doi = {10.1137/16M1105979},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CooperDFR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DyerM18,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Quasimonotone Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {190--202},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_16},
doi = {10.1007/978-3-030-00256-5\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DyerM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-06494,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Quasimonotone graphs},
journal = {CoRR},
volume = {abs/1801.06494},
year = {2018},
url = {http://arxiv.org/abs/1801.06494},
eprinttype = {arXiv},
eprint = {1801.06494},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-06494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-09853,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting Independent Sets in Cocomparability Graphs},
journal = {CoRR},
volume = {abs/1808.09853},
year = {2018},
url = {http://arxiv.org/abs/1808.09853},
eprinttype = {arXiv},
eprint = {1808.09853},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-09853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-03195,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
title = {Counting independent sets in graphs with bounded bipartite pathwidth},
journal = {CoRR},
volume = {abs/1812.03195},
year = {2018},
url = {http://arxiv.org/abs/1812.03195},
eprinttype = {arXiv},
eprint = {1812.03195},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-03195.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}
}
@inproceedings{DBLP:conf/esorics/DyerDX17,
author = {James Dyer and
Martin E. Dyer and
Jie Xu},
editor = {Joaqu{\'{\i}}n Garc{\'{\i}}a{-}Alfaro and
Guillermo Navarro{-}Arribas and
Hannes Hartenstein and
Jordi Herrera{-}Joancomart{\'{\i}}},
title = {Order-Preserving Encryption Using Approximate Integer Common Divisors},
booktitle = {Data Privacy Management, Cryptocurrencies and Blockchain Technology
- {ESORICS} 2017 International Workshops, {DPM} 2017 and {CBT} 2017,
Oslo, Norway, September 14-15, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10436},
pages = {257--274},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-67816-0\_15},
doi = {10.1007/978-3-319-67816-0\_15},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esorics/DyerDX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ima/DyerDX17,
author = {James Dyer and
Martin E. Dyer and
Jie Xu},
editor = {M{\'{a}}ire O'Neill},
title = {Practical Homomorphic Encryption Over the Integers for Secure Computation
in the Cloud},
booktitle = {Cryptography and Coding - 16th {IMA} International Conference, {IMACC}
2017, Oxford, UK, December 12-14, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10655},
pages = {44--76},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-71045-7\_3},
doi = {10.1007/978-3-319-71045-7\_3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ima/DyerDX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CooperDGH17,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill and
Andrew J. Handley},
title = {The flip Markov chain for connected regular graphs},
journal = {CoRR},
volume = {abs/1701.03856},
year = {2017},
url = {http://arxiv.org/abs/1701.03856},
eprinttype = {arXiv},
eprint = {1701.03856},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CooperDGH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerDX17,
author = {James Dyer and
Martin E. Dyer and
Jie Xu},
title = {Practical Homomorphic Encryption Over the Integers},
journal = {CoRR},
volume = {abs/1702.07588},
year = {2017},
url = {http://arxiv.org/abs/1702.07588},
eprinttype = {arXiv},
eprint = {1702.07588},
timestamp = {Sun, 10 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DyerDX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerM17,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting perfect matchings and the switch chain},
journal = {CoRR},
volume = {abs/1705.05790},
year = {2017},
url = {http://arxiv.org/abs/1705.05790},
eprinttype = {arXiv},
eprint = {1705.05790},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DyerM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerDX17a,
author = {James Dyer and
Martin E. Dyer and
Jie Xu},
title = {Order-Preserving Encryption Using Approximate Integer Common Divisors},
journal = {CoRR},
volume = {abs/1706.00324},
year = {2017},
url = {http://arxiv.org/abs/1706.00324},
eprinttype = {arXiv},
eprint = {1706.00324},
timestamp = {Sun, 10 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/DyerDX17a.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/dam/DyerGR16,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
David Richerby},
title = {Counting 4{\texttimes}4 matrix partitions of graphs},
journal = {Discret. Appl. Math.},
volume = {213},
pages = {76--92},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2016.05.001},
doi = {10.1016/J.DAM.2016.05.001},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/DyerGR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CooperDFR16,
author = {Colin Cooper and
Martin E. Dyer and
Alan M. Frieze and
Nicolas Rivera},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Discordant Voting Processes on Finite Graphs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {145:1--145:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.145},
doi = {10.4230/LIPICS.ICALP.2016.145},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/CooperDFR16.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/CooperDFR16,
author = {Colin Cooper and
Martin E. Dyer and
Alan M. Frieze and
Nicolas Rivera},
title = {Discordant voting processes on finite graphs},
journal = {CoRR},
volume = {abs/1604.06884},
year = {2016},
url = {http://arxiv.org/abs/1604.06884},
eprinttype = {arXiv},
eprint = {1604.06884},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CooperDFR16.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 = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/ChenDGJLMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DyerFG15,
author = {Martin E. Dyer and
Alan M. Frieze and
Catherine S. Greenhill},
title = {On the chromatic number of a random hypergraph},
journal = {J. Comb. Theory {B}},
volume = {113},
pages = {68--122},
year = {2015},
url = {https://doi.org/10.1016/j.jctb.2015.01.002},
doi = {10.1016/J.JCTB.2015.01.002},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/DyerFG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerS15,
author = {Martin E. Dyer and
Leen Stougie},
title = {Erratum to: Computational complexity of stochastic programming problems},
journal = {Math. Program.},
volume = {153},
number = {2},
pages = {723--725},
year = {2015},
url = {https://doi.org/10.1007/s10107-015-0935-9},
doi = {10.1007/S10107-015-0935-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerS15.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/mp/EDKS14,
author = {Martin E. Dyer and
Ravi Kannan and
Leen Stougie},
title = {A simple randomised algorithm for convex optimisation - Application
to two-stage stochastic programming},
journal = {Math. Program.},
volume = {147},
number = {1-2},
pages = {207--229},
year = {2014},
url = {https://doi.org/10.1007/s10107-013-0718-0},
doi = {10.1007/S10107-013-0718-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/EDKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerGR14,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
David Richerby},
title = {Counting 4{\texttimes}4 Matrix Partitions of Graphs},
journal = {CoRR},
volume = {abs/1407.7799},
year = {2014},
url = {http://arxiv.org/abs/1407.7799},
eprinttype = {arXiv},
eprint = {1407.7799},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DyerGR14.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/rsa/DyerFHV13,
author = {Martin E. Dyer and
Alan M. Frieze and
Thomas P. Hayes and
Eric Vigoda},
title = {Randomly coloring constant degree graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {2},
pages = {181--200},
year = {2013},
url = {https://doi.org/10.1002/rsa.20451},
doi = {10.1002/RSA.20451},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerFHV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerR13,
author = {Martin E. Dyer and
David Richerby},
title = {An Effective Dichotomy for the Counting Constraint Satisfaction Problem},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {3},
pages = {1245--1274},
year = {2013},
url = {https://doi.org/10.1137/100811258},
doi = {10.1137/100811258},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerR13.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 = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChenDGJLMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DyerGJR12,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
title = {The complexity of approximating bounded-degree Boolean {\#}CSP},
journal = {Inf. Comput.},
volume = {220},
pages = {1--14},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2011.12.007},
doi = {10.1016/J.IC.2011.12.007},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/DyerGJR12.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/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 = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BulatovDGJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-0812,
author = {Martin E. Dyer and
Alan M. Frieze and
Catherine S. Greenhill},
title = {On the chromatic number of a random hypergraph},
journal = {CoRR},
volume = {abs/1208.0812},
year = {2012},
url = {http://arxiv.org/abs/1208.0812},
eprinttype = {arXiv},
eprint = {1208.0812},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-0812.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 = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-1783.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DyerM11,
author = {Martin E. Dyer and
Velumailum Mohanaraj},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Pairwise-Interaction Games},
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 = {159--170},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_14},
doi = {10.1007/978-3-642-22006-7\_14},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DyerM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CooperDH11,
author = {Colin Cooper and
Martin E. Dyer and
Andrew J. Handley},
editor = {Dana Randall},
title = {Networks of random cycles},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {933--944},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.72},
doi = {10.1137/1.9781611973082.72},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/CooperDH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DyerR11,
author = {Martin E. Dyer and
David Richerby},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {The {\#}CSP Dichotomy is Decidable},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {261--272},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.261},
doi = {10.4230/LIPICS.STACS.2011.261},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DyerR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3822,
author = {Martin E. Dyer and
Velumailum Mohanaraj},
title = {The Iterated Prisoner's Dilemma on a Cycle},
journal = {CoRR},
volume = {abs/1102.3822},
year = {2011},
url = {http://arxiv.org/abs/1102.3822},
eprinttype = {arXiv},
eprint = {1102.3822},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3822.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-3879,
author = {Colin Cooper and
Martin E. Dyer and
Velumailum Mohanaraj},
title = {On the Imitation Strategy for Games on Graphs},
journal = {CoRR},
volume = {abs/1102.3879},
year = {2011},
url = {http://arxiv.org/abs/1102.3879},
eprinttype = {arXiv},
eprint = {1102.3879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-3879.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/dagstuhl-reports/DyerFFK11,
author = {Martin E. Dyer and
Uriel Feige and
Alan M. Frieze and
Marek Karpinski},
title = {Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl
Seminar 11241)},
journal = {Dagstuhl Reports},
volume = {1},
number = {6},
pages = {24--53},
year = {2011},
url = {https://doi.org/10.4230/DagRep.1.6.24},
doi = {10.4230/DAGREP.1.6.24},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DyerFFK11.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/DyerF10,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Randomly coloring random graphs},
journal = {Random Struct. Algorithms},
volume = {36},
number = {3},
pages = {251--272},
year = {2010},
url = {https://doi.org/10.1002/rsa.20286},
doi = {10.1002/RSA.20286},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/CryanDR10,
author = {Mary Cryan and
Martin E. Dyer and
Dana Randall},
title = {Approximately Counting Integral Flows and Cell-Bounded Contingency
Tables},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {7},
pages = {2683--2703},
year = {2010},
url = {https://doi.org/10.1137/060650544},
doi = {10.1137/060650544},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/CryanDR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DyerGJR10,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {The Complexity of Approximating Bounded-Degree Boolean {\#}CSP},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {323--334},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2466},
doi = {10.4230/LIPICS.STACS.2010.2466},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DyerGJR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DyerR10,
author = {Martin E. Dyer and
David Richerby},
editor = {Leonard J. Schulman},
title = {On the complexity of {\#}CSP},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {725--734},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806789},
doi = {10.1145/1806689.1806789},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DyerR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-4987,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
title = {The Complexity of Approximating Bounded-Degree Boolean {\#}CSP (Extended
Abstract)},
journal = {CoRR},
volume = {abs/1001.4987},
year = {2010},
url = {http://arxiv.org/abs/1001.4987},
eprinttype = {arXiv},
eprint = {1001.4987},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-4987.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-3879,
author = {Martin E. Dyer and
David Richerby},
title = {The Complexity of {\#}CSP},
journal = {CoRR},
volume = {abs/1003.3879},
year = {2010},
url = {http://arxiv.org/abs/1003.3879},
eprinttype = {arXiv},
eprint = {1003.3879},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-3879.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/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}
}
@article{DBLP:journals/tcs/BulatovDGJR09,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
title = {The complexity of weighted Boolean {\#}CSP with mixed signs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3949--3961},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.06.003},
doi = {10.1016/J.TCS.2009.06.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BulatovDGJR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/CooperDH09,
author = {Colin Cooper and
Martin E. Dyer and
Andrew J. Handley},
editor = {Srikanta Tirthapura and
Lorenzo Alvisi},
title = {The flip markov chain and a randomising {P2P} protocol},
booktitle = {Proceedings of the 28th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2009, Calgary, Alberta, Canada, August 10-12, 2009},
pages = {141--150},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1582716.1582742},
doi = {10.1145/1582716.1582742},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/CooperDH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-2663,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
title = {The Complexity of Approximating Bounded-Degree Boolean {\#}CSP},
journal = {CoRR},
volume = {abs/0907.2663},
year = {2009},
url = {http://arxiv.org/abs/0907.2663},
eprinttype = {arXiv},
eprint = {0907.2663},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-2663.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/rsa/BordewichDK08,
author = {Magnus Bordewich and
Martin E. Dyer and
Marek Karpinski},
title = {Path coupling using stopping times and counting independent sets and
colorings in hypergraphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {3},
pages = {375--399},
year = {2008},
url = {https://doi.org/10.1002/rsa.20204},
doi = {10.1002/RSA.20204},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BordewichDK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CryanDMS08,
author = {Mary Cryan and
Martin E. Dyer and
Haiko M{\"{u}}ller and
Leen Stougie},
title = {Random walks on the vertices of transportation polytopes with constant
number of sources},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {333--355},
year = {2008},
url = {https://doi.org/10.1002/rsa.20222},
doi = {10.1002/RSA.20222},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CryanDMS08.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-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/corr/abs-0812-4171,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Markus Jalsenius and
David Richerby},
title = {The Complexity of Weighted Boolean {\#}CSP with Mixed Signs},
journal = {CoRR},
volume = {abs/0812.4171},
year = {2008},
url = {http://arxiv.org/abs/0812.4171},
eprinttype = {arXiv},
eprint = {0812.4171},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-4171.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperDG07,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill},
title = {Sampling Regular Graphs and a Peer-to-Peer Network},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {4},
pages = {557--593},
year = {2007},
url = {https://doi.org/10.1017/S0963548306007978},
doi = {10.1017/S0963548306007978},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperDG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerGP07,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mike Paterson},
title = {On counting homomorphisms to directed acyclic graphs},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {27},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314691},
doi = {10.1145/1314690.1314691},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerGP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BordewichD07,
author = {Magnus Bordewich and
Martin E. Dyer},
title = {Path coupling without contraction},
journal = {J. Discrete Algorithms},
volume = {5},
number = {2},
pages = {280--292},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.04.001},
doi = {10.1016/J.JDA.2006.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BordewichD07.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/mp/DyerS06,
author = {Martin E. Dyer and
Leen Stougie},
title = {Computational complexity of stochastic programming problems},
journal = {Math. Program.},
volume = {106},
number = {3},
pages = {423--432},
year = {2006},
url = {https://doi.org/10.1007/s10107-005-0597-0},
doi = {10.1007/S10107-005-0597-0},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerFFV06,
author = {Martin E. Dyer and
Abraham D. Flaxman and
Alan M. Frieze and
Eric Vigoda},
title = {Randomly coloring sparse random graphs with fewer colors than the
maximum degree},
journal = {Random Struct. Algorithms},
volume = {29},
number = {4},
pages = {450--465},
year = {2006},
url = {https://doi.org/10.1002/rsa.20129},
doi = {10.1002/RSA.20129},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerFFV06.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}
}
@inproceedings{DBLP:conf/icalp/DyerGP06,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mike Paterson},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {On Counting Homomorphisms to Directed Acyclic Graphs},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {38--49},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_5},
doi = {10.1007/11786986\_5},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DyerGP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BordewichDK06,
author = {Magnus Bordewich and
Martin E. Dyer and
Marek Karpinski},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Stopping Times, Metrics and Approximate Counting},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {108--119},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_11},
doi = {10.1007/11786986\_11},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BordewichDK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BordewichDK05,
author = {Magnus Bordewich and
Martin E. Dyer and
Marek Karpinski},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Path Coupling Using Stopping Times},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {19--31},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_3},
doi = {10.1007/11537311\_3},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fct/BordewichDK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CooperDG05,
author = {Colin Cooper and
Martin E. Dyer and
Catherine S. Greenhill},
title = {Sampling regular graphs and a peer-to-peer network},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {980--988},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070574},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CooperDG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CryanDR05,
author = {Mary Cryan and
Martin E. Dyer and
Dana Randall},
editor = {Harold N. Gabow and
Ronald Fagin},
title = {Approximately counting integral flows and cell-bounded contingency
tables},
booktitle = {Proceedings of the 37th Annual {ACM} Symposium on Theory of Computing,
Baltimore, MD, USA, May 22-24, 2005},
pages = {413--422},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1060590.1060652},
doi = {10.1145/1060590.1060652},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CryanDR05.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-002,
author = {Magnus Bordewich and
Martin E. Dyer and
Marek Karpinski},
title = {Path Coupling Using Stopping Times and Counting Independent Sets and
Colourings in Hypergraphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-002}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-002/index.html},
eprinttype = {ECCC},
eprint = {TR05-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-002.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/eccc/ECCC-TR05-121,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mike Paterson},
title = {On counting homomorphisms to directed acyclic graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-121}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-121/index.html},
eprinttype = {ECCC},
eprint = {TR05-121},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-151,
author = {Magnus Bordewich and
Martin E. Dyer and
Marek Karpinski},
title = {Metric Construction, Stopping Times and Path Coupling},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-151}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-151/index.html},
eprinttype = {ECCC},
eprint = {TR05-151},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-151.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/rsa/DyerSVW04,
author = {Martin E. Dyer and
Alistair Sinclair and
Eric Vigoda and
Dror Weitz},
title = {Mixing in time and space for lattice spin systems: {A} combinatorial
view},
journal = {Random Struct. Algorithms},
volume = {24},
number = {4},
pages = {461--479},
year = {2004},
url = {https://doi.org/10.1002/rsa.20004},
doi = {10.1002/RSA.20004},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerSVW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerG04,
author = {Martin E. Dyer and
Catherine S. Greenhill},
title = {Corrigendum: The complexity of counting graph homomorphisms},
journal = {Random Struct. Algorithms},
volume = {25},
number = {3},
pages = {346--352},
year = {2004},
url = {https://doi.org/10.1002/rsa.20036},
doi = {10.1002/RSA.20036},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DyerFHV04,
author = {Martin E. Dyer and
Alan M. Frieze and
Thomas P. Hayes and
Eric Vigoda},
title = {Randomly Coloring Constant Degree Graphs},
booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19
October 2004, Rome, Italy, Proceedings},
pages = {582--589},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/FOCS.2004.57},
doi = {10.1109/FOCS.2004.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DyerFHV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/cg/DyerMW04,
author = {Martin E. Dyer and
Nimrod Megiddo and
Emo Welzl},
editor = {Jacob E. Goodman and
Joseph O'Rourke},
title = {Linear programming},
booktitle = {Handbook of Discrete and Computational Geometry, Second Edition},
pages = {999--1014},
publisher = {Chapman and Hall/CRC},
year = {2004},
url = {https://doi.org/10.1201/9781420035315.pt6},
doi = {10.1201/9781420035315.PT6},
timestamp = {Mon, 08 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/cg/DyerMW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-009,
author = {Martin E. Dyer and
Alan M. Frieze and
Thomas P. Hayes and
Eric Vigoda},
title = {Randomly coloring constant degree graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-009}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-009/index.html},
eprinttype = {ECCC},
eprint = {TR04-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/CryanD03,
author = {Mary Cryan and
Martin E. Dyer},
title = {A polynomial-time algorithm to approximately count contingency tables
when the number of rows is constant},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {2},
pages = {291--310},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00014-X},
doi = {10.1016/S0022-0000(03)00014-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/CryanD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerF03,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Randomly coloring graphs with lower bounds on girth and maximum degree},
journal = {Random Struct. Algorithms},
volume = {23},
number = {2},
pages = {167--179},
year = {2003},
url = {https://doi.org/10.1002/rsa.10087},
doi = {10.1002/RSA.10087},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DyerFM03,
author = {Martin E. Dyer and
Alan M. Frieze and
Michael Molloy},
title = {A probabilistic analysis of randomly generated binary constraint satisfaction
problems},
journal = {Theor. Comput. Sci.},
volume = {290},
number = {3},
pages = {1815--1828},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00317-1},
doi = {10.1016/S0304-3975(02)00317-1},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DyerFM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dmtcs/AbdullahiDP03,
author = {Sammani D. Abdullahi and
Martin E. Dyer and
Les G. Proll},
editor = {Cristian Calude and
Michael J. Dinneen and
Vincent Vajnovszki},
title = {Listing Vertices of Simple Polyhedra Associated with Dual {LI(2)}
Systems},
booktitle = {Discrete Mathematics and Theoretical Computer Science, 4th International
Conference, {DMTCS} 2003, Dijon, France, July 7-12, 2003. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2731},
pages = {89--96},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45066-1\_6},
doi = {10.1007/3-540-45066-1\_6},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dmtcs/AbdullahiDP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CryanDMS03,
author = {Mary Cryan and
Martin E. Dyer and
Haiko M{\"{u}}ller and
Leen Stougie},
title = {Random walks on the vertices of transportation polytopes with constant
number of sources},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {330--339},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644163},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CryanDMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Dyer03,
author = {Martin E. Dyer},
editor = {Lawrence L. Larmore and
Michel X. Goemans},
title = {Approximate counting by dynamic programming},
booktitle = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
June 9-11, 2003, San Diego, CA, {USA}},
pages = {693--699},
publisher = {{ACM}},
year = {2003},
url = {https://doi.org/10.1145/780542.780643},
doi = {10.1145/780542.780643},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Dyer03.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/rsa/DyerGM02,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Michael Molloy},
title = {Very rapid mixing of the Glauber dynamics for proper colorings on
bounded-degree graphs},
journal = {Random Struct. Algorithms},
volume = {20},
number = {1},
pages = {98--114},
year = {2002},
url = {https://doi.org/10.1002/rsa.10020},
doi = {10.1002/RSA.10020},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerGM02.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/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/random/DyerSVW02,
author = {Martin E. Dyer and
Alistair Sinclair and
Eric Vigoda and
Dror Weitz},
editor = {Jos{\'{e}} D. P. Rolim and
Salil P. Vadhan},
title = {Mixing in Time and Space for Lattice Spin Systems: {A} Combinatorial
View},
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 = {149--163},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45726-7\_13},
doi = {10.1007/3-540-45726-7\_13},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/random/DyerSVW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CryanD02,
author = {Mary Cryan and
Martin E. Dyer},
editor = {John H. Reif},
title = {A polynomial-time algorithm to approximately count contingency tables
when the number of rows is constant},
booktitle = {Proceedings on 34th Annual {ACM} Symposium on Theory of Computing,
May 19-21, 2002, Montr{\'{e}}al, Qu{\'{e}}bec, Canada},
pages = {240--249},
publisher = {{ACM}},
year = {2002},
url = {https://doi.org/10.1145/509907.509946},
doi = {10.1145/509907.509946},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CryanD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CooperDF01,
author = {Colin Cooper and
Martin E. Dyer and
Alan M. Frieze},
title = {On Markov Chains for Randomly H-Coloring a Graph},
journal = {J. Algorithms},
volume = {39},
number = {1},
pages = {117--134},
year = {2001},
url = {https://doi.org/10.1006/jagm.2000.1142},
doi = {10.1006/JAGM.2000.1142},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/CooperDF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BorgsCDT01,
author = {Christian Borgs and
Jennifer T. Chayes and
Martin E. Dyer and
Prasad Tetali},
editor = {Jaroslav Nesetril and
Peter Winkler},
title = {On the Sampling Problem for H-Colorings on the Hypercubic Lattice},
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 = {13--28},
publisher = {{DIMACS/AMS}},
year = {2001},
url = {https://doi.org/10.1090/dimacs/063/02},
doi = {10.1090/DIMACS/063/02},
timestamp = {Mon, 22 May 2023 16:07:34 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BorgsCDT01.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 = {Thu, 09 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/DyerJV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DyerF01,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Randomly Colouring Graphs with Lower Bounds on Girth and Maximum Degree},
booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001,
14-17 October 2001, Las Vegas, Nevada, {USA}},
pages = {579--587},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/SFCS.2001.959934},
doi = {10.1109/SFCS.2001.959934},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DyerF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DyerG00,
author = {Martin E. Dyer and
Catherine S. Greenhill},
title = {On Markov Chains for Independent Sets},
journal = {J. Algorithms},
volume = {35},
number = {1},
pages = {17--49},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1071},
doi = {10.1006/JAGM.1999.1071},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/DyerG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerG00,
author = {Martin E. Dyer and
Catherine S. Greenhill},
title = {The complexity of counting graph homomorphisms},
journal = {Random Struct. Algorithms},
volume = {17},
number = {3-4},
pages = {260--289},
year = {2000},
url = {https://doi.org/10.1002/1098-2418(200010/12)17:3/4\&\#60;260::AID-RSA5\&\#62;3.0.CO;2-W},
doi = {10.1002/1098-2418(200010/12)17:3/4\&\#60;260::AID-RSA5\&\#62;3.0.CO;2-W},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DyerG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerS00,
author = {Martin E. Dyer and
Sandeep Sen},
title = {Fast and Optimal Parallel Multidimensional Search in PRAMs with Applications
to Linear Programming and Related Problems},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {5},
pages = {1443--1461},
year = {2000},
url = {https://doi.org/10.1137/S0097539797325727},
doi = {10.1137/S0097539797325727},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerS00.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}
}
@article{DBLP:journals/tcs/DyerG00,
author = {Martin E. Dyer and
Catherine S. Greenhill},
title = {Polynomial-time counting and sampling of two-rowed contingency tables},
journal = {Theor. Comput. Sci.},
volume = {246},
number = {1-2},
pages = {265--278},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00136-X},
doi = {10.1016/S0304-3975(99)00136-X},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DyerG00.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/soda/DyerG00,
author = {Martin E. Dyer and
Catherine S. Greenhill},
editor = {David B. Shmoys},
title = {The complexity of counting graph homomorphisms (extended abstract)},
booktitle = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
pages = {246--255},
publisher = {{ACM/SIAM}},
year = {2000},
url = {http://dl.acm.org/citation.cfm?id=338219.338259},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerG00.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 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerGGJM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BubleyD99,
author = {Russ Bubley and
Martin E. Dyer},
title = {Faster random generation of linear extensions},
journal = {Discret. Math.},
volume = {201},
number = {1-3},
pages = {81--88},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00333-1},
doi = {10.1016/S0012-365X(98)00333-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BubleyD99.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}
}
@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}
}
@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/rsa/DyerG98,
author = {Martin E. Dyer and
Catherine S. Greenhill},
title = {A more rapidly mixing Markov chain for graph colorings},
journal = {Random Struct. Algorithms},
volume = {13},
number = {3-4},
pages = {285--317},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1098-2418(199810/12)13:3/4\&\#60;285::AID-RSA6\&\#62;3.0.CO;2-R},
doi = {10.1002/(SICI)1098-2418(199810/12)13:3/4\&\#60;285::AID-RSA6\&\#62;3.0.CO;2-R},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DyerG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerGH98,
author = {Martin E. Dyer and
Peter Gritzmann and
Alexander Hufnagel},
title = {On the Complexity of Computing Mixed Volumes},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {2},
pages = {356--400},
year = {1998},
url = {https://doi.org/10.1137/S0097539794278384},
doi = {10.1137/S0097539794278384},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerGH98.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/icalp/DyerG98,
author = {Martin E. Dyer and
Catherine S. Greenhill},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {A Genuinely Polynomial-Time Algorithms for Sampling Two-Rowed Contingency
Tables},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {339--350},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055065},
doi = {10.1007/BFB0055065},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/DyerG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BubleyD98,
author = {Russ Bubley and
Martin E. Dyer},
editor = {Howard J. Karloff},
title = {Faster Random Generation of Linear Extensions},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {350--354},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314730},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/BubleyD98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BubleyDG98,
author = {Russ Bubley and
Martin E. Dyer and
Catherine S. Greenhill},
editor = {Howard J. Karloff},
title = {Beating the 2 Delta Bound for Approximately Counting Colourings: {A}
Computer-Assisted Proof of Rapid Mixing},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {355--363},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314731},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BubleyDG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DyerK97,
author = {Martin E. Dyer and
Ravi Kannan},
title = {On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension},
journal = {Math. Oper. Res.},
volume = {22},
number = {3},
pages = {545--549},
year = {1997},
url = {https://doi.org/10.1287/moor.22.3.545},
doi = {10.1287/MOOR.22.3.545},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/DyerK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerKM97,
author = {Martin E. Dyer and
Ravi Kannan and
John Mount},
title = {Sampling contingency tables},
journal = {Random Struct. Algorithms},
volume = {10},
number = {4},
pages = {487--506},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199707)10:4\&\#60;487::AID-RSA4\&\#62;3.0.CO;2-Q},
doi = {10.1002/(SICI)1098-2418(199707)10:4\&\#60;487::AID-RSA4\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DyerKM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BubleyD97,
author = {Russ Bubley and
Martin E. Dyer},
title = {Path Coupling: {A} Technique for Proving Rapid Mixing in Markov Chains},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {223--231},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646111},
doi = {10.1109/SFCS.1997.646111},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BubleyD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BubleyD97,
author = {Russ Bubley and
Martin E. Dyer},
editor = {Michael E. Saks},
title = {Graph Orientations with No Sink and an Approximation for a Hard Case
of {\#}SAT},
booktitle = {Proceedings of the Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 5-7 January 1997, New Orleans, Louisiana, {USA}},
pages = {248--257},
publisher = {{ACM/SIAM}},
year = {1997},
url = {http://dl.acm.org/citation.cfm?id=314161.314263},
timestamp = {Thu, 05 Jul 2018 07:29:42 +0200},
biburl = {https://dblp.org/rec/conf/soda/BubleyD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ai/SmithD96,
author = {Barbara M. Smith and
Martin E. Dyer},
title = {Locating the Phase Transition in Binary Constraint Satisfaction Problems},
journal = {Artif. Intell.},
volume = {81},
number = {1-2},
pages = {155--181},
year = {1996},
url = {https://doi.org/10.1016/0004-3702(95)00052-6},
doi = {10.1016/0004-3702(95)00052-6},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ai/SmithD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/NashDD96,
author = {Jonathan M. Nash and
Peter M. Dew and
Martin E. Dyer},
title = {A Scalable Shared Queue on a Distributed Memory Machine},
journal = {Comput. J.},
volume = {39},
number = {6},
pages = {483--495},
year = {1996},
url = {https://doi.org/10.1093/comjnl/39.6.483},
doi = {10.1093/COMJNL/39.6.483},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cj/NashDD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/europar/NashDDD96,
author = {Jonathan M. Nash and
Peter M. Dew and
John R. Davy and
Martin E. Dyer},
editor = {Luc Boug{\'{e}} and
Pierre Fraigniaud and
Anne Mignotte and
Yves Robert},
title = {Implementation Issues Relating to the {WPRAM} Model for Scalable Computing},
booktitle = {Euro-Par '96 Parallel Processing, Second International Euro-Par Conference,
Lyon, France, August 26-29, 1996, Proceedings, Volume {II}},
series = {Lecture Notes in Computer Science},
volume = {1124},
pages = {319--326},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/BFb0024719},
doi = {10.1007/BFB0024719},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/europar/NashDDD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BroderDFRU95,
author = {Andrei Z. Broder and
Martin E. Dyer and
Alan M. Frieze and
Prabhakar Raghavan and
Eli Upfal},
title = {The Worst-Case Running Time of the Random Simplex Algorithm is Exponential
in the Height},
journal = {Inf. Process. Lett.},
volume = {56},
number = {2},
pages = {79--81},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00101-H},
doi = {10.1016/0020-0190(95)00101-H},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BroderDFRU95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/DyerFS95,
author = {Martin E. Dyer and
Alan M. Frieze and
Stephen Suen},
title = {Ordering Clone Libraries in Computational Biology},
journal = {J. Comput. Biol.},
volume = {2},
number = {2},
pages = {207--218},
year = {1995},
url = {https://doi.org/10.1089/cmb.1995.2.207},
doi = {10.1089/CMB.1995.2.207},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/DyerFS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/joc/DyerFFT95,
author = {Martin E. Dyer and
Trevor I. Fenner and
Alan M. Frieze and
Andrew Thomason},
title = {On Key Storage in Secure Networks},
journal = {J. Cryptol.},
volume = {8},
number = {4},
pages = {189--200},
year = {1995},
url = {https://doi.org/10.1007/BF00191355},
doi = {10.1007/BF00191355},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/joc/DyerFFT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AronsonDFS95,
author = {Jonathan Aronson and
Martin E. Dyer and
Alan M. Frieze and
Stephen Suen},
title = {Randomized Greedy Matching {II}},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {55--74},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060107},
doi = {10.1002/RSA.3240060107},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AronsonDFS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Dyer95,
author = {Martin E. Dyer},
editor = {Jack Snoeyink},
title = {A Parallel Algorithm for Linear Programming in Fixed Dimension},
booktitle = {Proceedings of the Eleventh Annual Symposium on Computational Geometry,
Vancouver, B.C., Canada, June 5-12, 1995},
pages = {345--349},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/220279.220316},
doi = {10.1145/220279.220316},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/Dyer95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/DyerND95,
author = {Martin E. Dyer and
Jonathan M. Nash and
Peter M. Dew},
editor = {Charles E. Leiserson},
title = {An Optimal Randomized Planar Convex Hull Algorithm With Good Empirical
Performance},
booktitle = {7th Annual {ACM} Symposium on Parallel Algorithms and Architectures,
{SPAA} '95, Santa Barbara, California, USA, July 17-19, 1995},
pages = {21--26},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/215399.215407},
doi = {10.1145/215399.215407},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/spaa/DyerND95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Dyer94,
author = {Martin E. Dyer},
title = {On a Universal Chain Problem},
journal = {Discret. Appl. Math.},
volume = {48},
number = {3},
pages = {219--229},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(92)00178-O},
doi = {10.1016/0166-218X(92)00178-O},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Dyer94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/DyerFS94,
author = {Martin E. Dyer and
Alan M. Frieze and
Stephen Suen},
title = {The Probability of Unique Solutions of Sequencing by Hybridization},
journal = {J. Comput. Biol.},
volume = {1},
number = {2},
pages = {105--110},
year = {1994},
url = {https://doi.org/10.1089/cmb.1994.1.105},
doi = {10.1089/CMB.1994.1.105},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/DyerFS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerF94,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Random walks, totally unimodular matrices, and a randomised dual simplex
algorithm},
journal = {Math. Program.},
volume = {64},
pages = {1--16},
year = {1994},
url = {https://doi.org/10.1007/BF01582563},
doi = {10.1007/BF01582563},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AronsonDFS94,
author = {Jonathan Aronson and
Martin E. Dyer and
Alan M. Frieze and
Stephen Suen},
editor = {Daniel Dominic Sleator},
title = {On the Greedy Heuristic for Matchings},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {141--149},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314488},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/AronsonDFS94.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 = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerFJ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerFKKPV93,
author = {Martin E. Dyer and
Alan M. Frieze and
Ravi Kannan and
Ajai Kapoor and
Ljubomir Perkovic and
Umesh V. Vazirani},
title = {A Mildly Exponential Time Algorithm for Approximating the Number of
Solutions to a Multidimensional Knapsack Problem},
journal = {Comb. Probab. Comput.},
volume = {2},
pages = {271--284},
year = {1993},
url = {https://doi.org/10.1017/S0963548300000675},
doi = {10.1017/S0963548300000675},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerFKKPV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerF92,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Probabilistic analysis of the generalised assignment problem},
journal = {Math. Program.},
volume = {55},
pages = {169--181},
year = {1992},
url = {https://doi.org/10.1007/BF01581197},
doi = {10.1007/BF01581197},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerFM92,
author = {Martin E. Dyer and
Zolt{\'{a}}n F{\"{u}}redi and
Colin McDiarmid},
title = {Volumes Spanned by Random Points in the Hypercube},
journal = {Random Struct. Algorithms},
volume = {3},
number = {1},
pages = {91--106},
year = {1992},
url = {https://doi.org/10.1002/rsa.3240030107},
doi = {10.1002/RSA.3240030107},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerFM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/Dyer92,
author = {Martin E. Dyer},
editor = {David Avis},
title = {A Class of Convex Programs with Applications to Computational Geometry},
booktitle = {Proceedings of the Eighth Annual Symposium on Computational Geometry,
Berlin, Germany, June 10-12, 1992},
pages = {9--15},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/142675.142681},
doi = {10.1145/142675.142681},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/compgeom/Dyer92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/DyerF92,
author = {Martin E. Dyer and
Alan M. Frieze},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {Random Walks, Totally Unimodular Matrices and a Randomised Dual Simplex
Algorithm},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {72--84},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/DyerF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerFK91,
author = {Martin E. Dyer and
Alan M. Frieze and
Ravi Kannan},
title = {A Random Polynomial Time Algorithm for Approximating the Volume of
Convex Bodies},
journal = {J. {ACM}},
volume = {38},
number = {1},
pages = {1--17},
year = {1991},
url = {https://doi.org/10.1145/102782.102783},
doi = {10.1145/102782.102783},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerFK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerF91,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Randomized Greedy Matching},
journal = {Random Struct. Algorithms},
volume = {2},
number = {1},
pages = {29--46},
year = {1991},
url = {https://doi.org/10.1002/rsa.3240020104},
doi = {10.1002/RSA.3240020104},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerF91a,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Probabilistic Analysis of a Parallel Algorithm for Finding the Lexicographically
First Depth First Search Tree in a Dense Random Graph},
journal = {Random Struct. Algorithms},
volume = {2},
number = {2},
pages = {233--240},
year = {1991},
url = {https://doi.org/10.1002/rsa.3240020207},
doi = {10.1002/RSA.3240020207},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerF91a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dyer91,
author = {Martin E. Dyer},
title = {On Counting Lattice Points in Polyhedra},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {4},
pages = {695--707},
year = {1991},
url = {https://doi.org/10.1137/0220044},
doi = {10.1137/0220044},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Dyer91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyerF90,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {On an optimization problem with nested constraints},
journal = {Discret. Appl. Math.},
volume = {26},
number = {2-3},
pages = {159--173},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90098-W},
doi = {10.1016/0166-218X(90)90098-W},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyerF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyerW90,
author = {Martin E. Dyer and
Laurence A. Wolsey},
title = {Formulating the single machine sequencing problem with release dates
as a mixed integer program},
journal = {Discret. Appl. Math.},
volume = {26},
number = {2-3},
pages = {255--270},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90104-K},
doi = {10.1016/0166-218X(90)90104-K},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyerW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerF90,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {On Patching Algorithms for Random Asymmetric Travelling Salesman Problems},
journal = {Math. Program.},
volume = {46},
pages = {361--378},
year = {1990},
url = {https://doi.org/10.1007/BF01585751},
doi = {10.1007/BF01585751},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/DyerFM90,
author = {Martin E. Dyer and
Zolt{\'{a}}n F{\"{u}}redi and
Colin McDiarmid},
editor = {William J. Cook and
Paul D. Seymour},
title = {Random Volumes in the n-Cube},
booktitle = {Polyhedral Combinatorics, Proceedings of a {DIMACS} Workshop, Morristown,
New Jersey, USA, June 12-16, 1989},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {1},
pages = {33--38},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/001/04},
doi = {10.1090/DIMACS/001/04},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/DyerFM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/DyerF90,
author = {Martin E. Dyer and
Alan M. Frieze},
editor = {Ravi Kannan and
William R. Pulleyblank},
title = {Probabilistic Analysis of the Generalised Assignment Problem},
booktitle = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
pages = {189--200},
publisher = {University of Waterloo Press},
year = {1990},
timestamp = {Wed, 09 Oct 2002 12:35:47 +0200},
biburl = {https://dblp.org/rec/conf/ipco/DyerF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DyerF89,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {The Solution of Some Random NP-Hard Problems in Polynomial Expected
Time},
journal = {J. Algorithms},
volume = {10},
number = {4},
pages = {451--489},
year = {1989},
url = {https://doi.org/10.1016/0196-6774(89)90001-1},
doi = {10.1016/0196-6774(89)90001-1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/DyerF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/DyerF89,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Probabilistic Analysis of the Multidimensional Knapsack Problem},
journal = {Math. Oper. Res.},
volume = {14},
number = {1},
pages = {162--176},
year = {1989},
url = {https://doi.org/10.1287/moor.14.1.162},
doi = {10.1287/MOOR.14.1.162},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/DyerF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerF89,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {A randomized algorithm for fixed-dimensional linear programming},
journal = {Math. Program.},
volume = {44},
number = {1-3},
pages = {203--212},
year = {1989},
url = {https://doi.org/10.1007/BF01587088},
doi = {10.1007/BF01587088},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DyerFK89,
author = {Martin E. Dyer and
Alan M. Frieze and
Ravi Kannan},
editor = {David S. Johnson},
title = {A Random Polynomial Time Algorithm for Approximating the Volume of
Convex Bodies},
booktitle = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
May 14-17, 1989, Seattle, Washington, {USA}},
pages = {375--381},
publisher = {{ACM}},
year = {1989},
url = {https://doi.org/10.1145/73007.73043},
doi = {10.1145/73007.73043},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DyerFK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DyerF88,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {On the Complexity of Computing the Volume of a Polyhedron},
journal = {{SIAM} J. Comput.},
volume = {17},
number = {5},
pages = {967--974},
year = {1988},
url = {https://doi.org/10.1137/0217060},
doi = {10.1137/0217060},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/DyerF88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyerW87,
author = {Martin E. Dyer and
John Walker},
title = {An algorithm for a separable integer programming problem with cumulatively
bounded variables},
journal = {Discret. Appl. Math.},
volume = {16},
number = {2},
pages = {135--149},
year = {1987},
url = {https://doi.org/10.1016/0166-218X(87)90070-9},
doi = {10.1016/0166-218X(87)90070-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyerW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DyerF86,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Planar 3DM is NP-Complete},
journal = {J. Algorithms},
volume = {7},
number = {2},
pages = {174--184},
year = {1986},
url = {https://doi.org/10.1016/0196-6774(86)90002-7},
doi = {10.1016/0196-6774(86)90002-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/DyerF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerFM86,
author = {Martin E. Dyer and
Alan M. Frieze and
Colin J. H. McDiarmid},
title = {On linear programs with random costs},
journal = {Math. Program.},
volume = {35},
number = {1},
pages = {3--16},
year = {1986},
url = {https://doi.org/10.1007/BF01589437},
doi = {10.1007/BF01589437},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerFM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dyer86,
author = {Martin E. Dyer},
title = {On a Multidimensional Search Technique and its Application to the
Euclidean One-Centre Problem},
journal = {{SIAM} J. Comput.},
volume = {15},
number = {3},
pages = {725--738},
year = {1986},
url = {https://doi.org/10.1137/0215052},
doi = {10.1137/0215052},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Dyer86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DyerF86,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {Fast Solution of Some Random NP-Hard Problems},
booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto,
Canada, 27-29 October 1986},
pages = {331--336},
publisher = {{IEEE} Computer Society},
year = {1986},
url = {https://doi.org/10.1109/SFCS.1986.17},
doi = {10.1109/SFCS.1986.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DyerF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyerF85,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {On the complexity of partitioning graphs into connected subgraphs},
journal = {Discret. Appl. Math.},
volume = {10},
number = {2},
pages = {139--153},
year = {1985},
url = {https://doi.org/10.1016/0166-218X(85)90008-3},
doi = {10.1016/0166-218X(85)90008-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyerF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DyerF84,
author = {Martin E. Dyer and
Alan M. Frieze},
title = {A Partitioning Algorithm for Minimum Weighted Euclidean Matching},
journal = {Inf. Process. Lett.},
volume = {18},
number = {2},
pages = {59--62},
year = {1984},
url = {https://doi.org/10.1016/0020-0190(84)90024-3},
doi = {10.1016/0020-0190(84)90024-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DyerF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Dyer84,
author = {Martin E. Dyer},
title = {An O(\emph{n}) algorithm for the multiple-choice knapsack linear program},
journal = {Math. Program.},
volume = {29},
number = {1},
pages = {57--63},
year = {1984},
url = {https://doi.org/10.1007/BF02591729},
doi = {10.1007/BF02591729},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Dyer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Dyer84,
author = {Martin E. Dyer},
title = {Linear Time Algorithms for Two- and Three-Variable Linear Programs},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {1},
pages = {31--45},
year = {1984},
url = {https://doi.org/10.1137/0213003},
doi = {10.1137/0213003},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Dyer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Dyer83,
author = {Martin E. Dyer},
title = {The Complexity of Vertex Enumeration Methods},
journal = {Math. Oper. Res.},
volume = {8},
number = {3},
pages = {381--402},
year = {1983},
url = {https://doi.org/10.1287/moor.8.3.381},
doi = {10.1287/MOOR.8.3.381},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/Dyer83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerW83,
author = {Martin E. Dyer and
John Walker},
title = {A note on bicriterion programming},
journal = {Math. Program.},
volume = {27},
number = {3},
pages = {355--361},
year = {1983},
url = {https://doi.org/10.1007/BF02591909},
doi = {10.1007/BF02591909},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerW82,
author = {Martin E. Dyer and
John Walker},
title = {Solving the subproblem in the lagrangian dual of separable discrete
programs with linear constraints},
journal = {Math. Program.},
volume = {24},
number = {1},
pages = {107--112},
year = {1982},
url = {https://doi.org/10.1007/BF01585097},
doi = {10.1007/BF01585097},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerP80,
author = {Martin E. Dyer and
Les G. Proll},
title = {Eliminating extraneous edges in Greenberg's algorithm},
journal = {Math. Program.},
volume = {19},
number = {1},
pages = {106--110},
year = {1980},
url = {https://doi.org/10.1007/BF01581632},
doi = {10.1007/BF01581632},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerP80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Dyer80,
author = {Martin E. Dyer},
title = {Calculating surrogate constraints},
journal = {Math. Program.},
volume = {19},
number = {1},
pages = {255--278},
year = {1980},
url = {https://doi.org/10.1007/BF01581647},
doi = {10.1007/BF01581647},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/Dyer80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/DyerP77,
author = {Martin E. Dyer and
Les G. Proll},
title = {An algorithm for determining all extreme points of a convex polytope},
journal = {Math. Program.},
volume = {12},
number = {1},
pages = {81--96},
year = {1977},
url = {https://doi.org/10.1007/BF01593771},
doi = {10.1007/BF01593771},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mp/DyerP77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-08-05 21:16 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:
