Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Catherine S. Greenhill
@article{DBLP:journals/cpc/GreenhillIMM23,
author = {Catherine S. Greenhill and
Mikhail Isaev and
Tam{\'{a}}s Makai and
Brendan D. McKay},
title = {Degree sequences of sufficiently dense random uniform hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {32},
number = {2},
pages = {183--224},
year = {2023},
url = {https://doi.org/10.1017/S0963548322000190},
doi = {10.1017/S0963548322000190},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillIMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GreenhillMP23,
author = {Catherine S. Greenhill and
Bernard Mans and
Ali Pourmiri},
title = {Balanced allocation on hypergraphs},
journal = {J. Comput. Syst. Sci.},
volume = {138},
pages = {103459},
year = {2023},
url = {https://doi.org/10.1016/j.jcss.2023.05.004},
doi = {10.1016/J.JCSS.2023.05.004},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GreenhillMP23.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/combinatorica/AyreCG22,
author = {Peter J. Ayre and
Amin Coja{-}Oghlan and
Catherine S. Greenhill},
title = {Lower Bounds on the Chromatic Number of Random Graphs},
journal = {Comb.},
volume = {42},
number = {5},
pages = {617--658},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4236-z},
doi = {10.1007/S00493-021-4236-Z},
timestamp = {Tue, 03 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/AyreCG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GreenhillIL22,
author = {Catherine S. Greenhill and
Mikhail Isaev and
Gary Liang},
title = {Spanning trees in random regular uniform hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {31},
number = {1},
pages = {29--53},
year = {2022},
url = {https://doi.org/10.1017/S0963548321000158},
doi = {10.1017/S0963548321000158},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillIL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ErdosGMMSS22,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Catherine S. Greenhill and
Tam{\'{a}}s R{\'{o}}bert Mezei and
Istv{\'{a}}n Mikl{\'{o}}s and
Daniel Solt{\'{e}}sz and
Lajos Soukup},
title = {The mixing time of switch Markov chains: {A} unified approach},
journal = {Eur. J. Comb.},
volume = {99},
pages = {103421},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2021.103421},
doi = {10.1016/J.EJC.2021.103421},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/ErdosGMMSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GreenhillIM21,
author = {Catherine S. Greenhill and
Mikhail Isaev and
Brendan D. McKay},
title = {Subgraph counts for dense random graphs with specified degrees},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {3},
pages = {460--497},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000498},
doi = {10.1017/S0963548320000498},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillIM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GaoG21,
author = {Pu Gao and
Catherine S. Greenhill},
title = {Mixing time of the switch Markov chain and stable degree sequences},
journal = {Discret. Appl. Math.},
volume = {291},
pages = {143--162},
year = {2021},
url = {https://doi.org/10.1016/j.dam.2020.12.004},
doi = {10.1016/J.DAM.2020.12.004},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GaoG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AldosariG21,
author = {Haya S. Aldosari and
Catherine S. Greenhill},
title = {The average number of spanning hypertrees in sparse uniform hypergraphs},
journal = {Discret. Math.},
volume = {344},
number = {1},
pages = {112192},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112192},
doi = {10.1016/J.DISC.2020.112192},
timestamp = {Wed, 18 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AldosariG21.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}
}
@inproceedings{DBLP:conf/bcc/Greenhill21,
author = {Catherine S. Greenhill},
editor = {Konrad K. Dabrowski and
Maximilien Gadouleau and
Nicholas Georgiou and
Matthew Johnson and
George B. Mertzios and
Dani{\"{e}}l Paulusma},
title = {Generating graphs randomly},
booktitle = {Surveys in Combinatorics, 2021: Invited lectures from the 28th British
Combinatorial Conference, Durham, UK, July 5-9, 2021},
pages = {133--186},
publisher = {Cambridge University Press},
year = {2021},
url = {https://doi.org/10.1017/9781009036214.005},
doi = {10.1017/9781009036214.005},
timestamp = {Mon, 10 Jan 2022 15:48:53 +0100},
biburl = {https://dblp.org/rec/conf/bcc/Greenhill21.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/jctb/AltmanGIR20,
author = {Daniel Altman and
Catherine S. Greenhill and
Mikhail Isaev and
Reshma Ramadurai},
title = {A threshold result for loose Hamiltonicity in random regular uniform
hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {142},
pages = {307--373},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2019.11.001},
doi = {10.1016/J.JCTB.2019.11.001},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/AltmanGIR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GreenhillMP20,
author = {Catherine S. Greenhill and
Bernard Mans and
Ali Pourmiri},
editor = {Jaroslaw Byrka and
Raghu Meka},
title = {Balanced Allocation on Dynamic Hypergraphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual
Conference},
series = {LIPIcs},
volume = {176},
pages = {11:1--11:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.11},
doi = {10.4230/LIPICS.APPROX/RANDOM.2020.11},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GreenhillMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-09938,
author = {Ryan L. Mann and
Luke Mathieson and
Catherine S. Greenhill},
title = {On the Parameterised Complexity of Induced Multipartite Graph Parameters},
journal = {CoRR},
volume = {abs/2004.09938},
year = {2020},
url = {https://arxiv.org/abs/2004.09938},
eprinttype = {arXiv},
eprint = {2004.09938},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-09938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-07588,
author = {Catherine S. Greenhill and
Bernard Mans and
Ali Pourmiri},
title = {Balanced Allocation on Dynamic Hypergraphs},
journal = {CoRR},
volume = {abs/2006.07588},
year = {2020},
url = {https://arxiv.org/abs/2006.07588},
eprinttype = {arXiv},
eprint = {2006.07588},
timestamp = {Wed, 17 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-07588.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/combinatorics/GaoG19,
author = {Pu Gao and
Catherine S. Greenhill},
title = {Uniform Generation of Spanning Regular Subgraphs of a Dense Graph},
journal = {Electron. J. Comb.},
volume = {26},
number = {4},
pages = {4},
year = {2019},
url = {https://doi.org/10.37236/8251},
doi = {10.37236/8251},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GaoG19.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/ejc/AldosariG19,
author = {Haya S. Aldosari and
Catherine S. Greenhill},
title = {Enumerating sparse uniform hypergraphs with given degree sequence
and forbidden edges},
journal = {Eur. J. Comb.},
volume = {77},
pages = {68--77},
year = {2019},
url = {https://doi.org/10.1016/j.ejc.2018.11.002},
doi = {10.1016/J.EJC.2018.11.002},
timestamp = {Thu, 10 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/AldosariG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AyreCG19,
author = {Peter J. Ayre and
Amin Coja{-}Oghlan and
Catherine S. Greenhill},
title = {Hypergraph coloring up to condensation},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {615--652},
year = {2019},
url = {https://doi.org/10.1002/rsa.20824},
doi = {10.1002/RSA.20824},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AyreCG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AyreG19,
author = {Peter J. Ayre and
Catherine S. Greenhill},
title = {Rigid Colorings of Hypergraphs and Contiguity},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {3},
pages = {1575--1606},
year = {2019},
url = {https://doi.org/10.1137/18M1207211},
doi = {10.1137/18M1207211},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AyreG19.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-1903-06600,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Catherine S. Greenhill and
Tam{\'{a}}s R{\'{o}}bert Mezei and
Istv{\'{a}}n Mikl{\'{o}}s and
Daniel Solt{\'{e}}sz and
Lajos Soukup},
title = {The mixing time of the swap (switch) Markov chains: a unified approach},
journal = {CoRR},
volume = {abs/1903.06600},
year = {2019},
url = {http://arxiv.org/abs/1903.06600},
eprinttype = {arXiv},
eprint = {1903.06600},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-06600.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/tcs/GreenhillS18,
author = {Catherine S. Greenhill and
Matteo Sfragara},
title = {The switch Markov chain for sampling irregular graphs and digraphs},
journal = {Theor. Comput. Sci.},
volume = {719},
pages = {1--20},
year = {2018},
url = {https://doi.org/10.1016/j.tcs.2017.11.010},
doi = {10.1016/J.TCS.2017.11.010},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/GreenhillS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-00964,
author = {Pu Gao and
Catherine S. Greenhill},
title = {Uniform generation of spanning regular subgraphs of a dense graph},
journal = {CoRR},
volume = {abs/1807.00964},
year = {2018},
url = {http://arxiv.org/abs/1807.00964},
eprinttype = {arXiv},
eprint = {1807.00964},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-00964.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/corr/abs-1812-09691,
author = {Peter J. Ayre and
Amin Coja{-}Oghlan and
Catherine S. Greenhill},
title = {Lower bounds on the chromatic number of random graphs},
journal = {CoRR},
volume = {abs/1812.09691},
year = {2018},
url = {http://arxiv.org/abs/1812.09691},
eprinttype = {arXiv},
eprint = {1812.09691},
timestamp = {Thu, 03 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-09691.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GreenhillIKM17,
author = {Catherine S. Greenhill and
Mikhail Isaev and
Matthew Kwan and
Brendan D. McKay},
title = {The average number of spanning trees in sparse graphs with given degrees},
journal = {Eur. J. Comb.},
volume = {63},
pages = {6--25},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.02.003},
doi = {10.1016/J.EJC.2017.02.003},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/GreenhillIKM17.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/GreenhillS17,
author = {Catherine S. Greenhill and
Matteo Sfragara},
title = {The switch Markov chain for sampling irregular graphs and digraphs},
journal = {CoRR},
volume = {abs/1701.07101},
year = {2017},
url = {http://arxiv.org/abs/1701.07101},
eprinttype = {arXiv},
eprint = {1701.07101},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GreenhillS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BlinovskyG16,
author = {Vladimir M. Blinovsky and
Catherine S. Greenhill},
title = {Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given
Degrees},
journal = {Electron. J. Comb.},
volume = {23},
number = {3},
pages = {3},
year = {2016},
url = {https://doi.org/10.37236/5512},
doi = {10.37236/5512},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BlinovskyG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BlinovskyG16,
author = {Vladimir M. Blinovsky and
Catherine S. Greenhill},
title = {Asymptotic enumeration of sparse uniform hypergraphs with given degrees},
journal = {Eur. J. Comb.},
volume = {51},
pages = {287--296},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.06.004},
doi = {10.1016/J.EJC.2015.06.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BlinovskyG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BordewichGP16,
author = {Magnus Bordewich and
Catherine S. Greenhill and
Viresh Patel},
title = {Mixing of the Glauber dynamics for the ferromagnetic Potts model},
journal = {Random Struct. Algorithms},
volume = {48},
number = {1},
pages = {21--52},
year = {2016},
url = {https://doi.org/10.1002/rsa.20569},
doi = {10.1002/RSA.20569},
timestamp = {Tue, 04 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BordewichGP16.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, Ser. {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 = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DyerFG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Greenhill15,
author = {Catherine S. Greenhill},
editor = {Piotr Indyk},
title = {The switch Markov chain for sampling irregular graphs (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {1564--1572},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.103},
doi = {10.1137/1.9781611973730.103},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/Greenhill15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AyreCG15,
author = {Peter J. Ayre and
Amin Coja{-}Oghlan and
Catherine S. Greenhill},
title = {Hypergraph coloring up to condensation},
journal = {CoRR},
volume = {abs/1508.01841},
year = {2015},
url = {http://arxiv.org/abs/1508.01841},
eprinttype = {arXiv},
eprint = {1508.01841},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AyreCG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GreenhillKW14,
author = {Catherine S. Greenhill and
Matthew Kwan and
David Wind},
title = {On the Number of Spanning Trees in Random Regular Graphs},
journal = {Electron. J. Comb.},
volume = {21},
number = {1},
pages = {1},
year = {2014},
url = {https://doi.org/10.37236/3752},
doi = {10.37236/3752},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GreenhillKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Greenhill14,
author = {Catherine S. Greenhill},
title = {The switch Markov chain for sampling irregular graphs},
journal = {CoRR},
volume = {abs/1412.5249},
year = {2014},
url = {http://arxiv.org/abs/1412.5249},
eprinttype = {arXiv},
eprint = {1412.5249},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Greenhill14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GreenhillM13,
author = {Catherine S. Greenhill and
Brendan D. McKay},
title = {Asymptotic Enumeration of Sparse Multigraphs with Given Degrees},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {2064--2089},
year = {2013},
url = {https://doi.org/10.1137/130913419},
doi = {10.1137/130913419},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GreenhillM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-4055,
author = {Catherine S. Greenhill and
Mario Ullrich},
title = {Heat-bath Markov chains have no negative eigenvalues},
journal = {CoRR},
volume = {abs/1301.4055},
year = {2013},
url = {http://arxiv.org/abs/1301.4055},
eprinttype = {arXiv},
eprint = {1301.4055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-4055.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0776,
author = {Magnus Bordewich and
Catherine S. Greenhill and
Viresh Patel},
title = {Mixing of the Glauber dynamics for the ferromagnetic Potts model},
journal = {CoRR},
volume = {abs/1305.0776},
year = {2013},
url = {http://arxiv.org/abs/1305.0776},
eprinttype = {arXiv},
eprint = {1305.0776},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1305-0776.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-6668,
author = {Catherine S. Greenhill},
title = {Making Markov chains less lazy},
journal = {CoRR},
volume = {abs/1203.6668},
year = {2012},
url = {http://arxiv.org/abs/1203.6668},
eprinttype = {arXiv},
eprint = {1203.6668},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-6668.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/combinatorics/Greenhill11,
author = {Catherine S. Greenhill},
title = {A Polynomial Bound on the Mixing Time of a Markov Chain for Sampling
Regular Directed Graphs},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/721},
doi = {10.37236/721},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Greenhill11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ccds/CanfieldGGMR10,
author = {E. Rodney Canfield and
Zhicheng Gao and
Catherine S. Greenhill and
Brendan D. McKay and
Robert W. Robinson},
title = {Asymptotic enumeration of correlation-immune boolean functions},
journal = {Cryptogr. Commun.},
volume = {2},
number = {1},
pages = {111--126},
year = {2010},
url = {https://doi.org/10.1007/s12095-010-0019-x},
doi = {10.1007/S12095-010-0019-X},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ccds/CanfieldGGMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GreenhillJR10,
author = {Catherine S. Greenhill and
Svante Janson and
Andrzej Rucinski},
title = {On the Number of Perfect Matchings in Random Lifts},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {5-6},
pages = {791--817},
year = {2010},
url = {https://doi.org/10.1017/S0963548309990654},
doi = {10.1017/S0963548309990654},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillJR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GreenhillM09,
author = {Catherine S. Greenhill and
Brendan D. McKay},
title = {Random dense bipartite graphs and directed graphs with specified degrees},
journal = {Random Struct. Algorithms},
volume = {35},
number = {2},
pages = {222--249},
year = {2009},
url = {https://doi.org/10.1002/rsa.20273},
doi = {10.1002/RSA.20273},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GreenhillM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/CanfieldGGMR09,
author = {E. Rodney Canfield and
Zhicheng Gao and
Catherine S. Greenhill and
Brendan D. McKay and
Robert W. Robinson},
title = {Asymptotic enumeration of correlation-immune boolean functions},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {460},
year = {2009},
url = {http://eprint.iacr.org/2009/460},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/CanfieldGGMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aam/GreenhillM08,
author = {Catherine S. Greenhill and
Brendan D. McKay},
title = {Asymptotic enumeration of sparse nonnegative integer matrices with
specified row and column sums},
journal = {Adv. Appl. Math.},
volume = {41},
number = {4},
pages = {459--481},
year = {2008},
url = {https://doi.org/10.1016/j.aam.2008.01.002},
doi = {10.1016/J.AAM.2008.01.002},
timestamp = {Thu, 01 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aam/GreenhillM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GreenhillHW08,
author = {Catherine S. Greenhill and
Fred B. Holt and
Nicholas C. Wormald},
title = {Expansion properties of a random regular graph after random vertex
deletions},
journal = {Eur. J. Comb.},
volume = {29},
number = {5},
pages = {1139--1150},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.06.021},
doi = {10.1016/J.EJC.2007.06.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GreenhillHW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CanfieldGM08,
author = {E. Rodney Canfield and
Catherine S. Greenhill and
Brendan D. McKay},
title = {Asymptotic enumeration of dense 0-1 matrices with specified line sums},
journal = {J. Comb. Theory, Ser. {A}},
volume = {115},
number = {1},
pages = {32--66},
year = {2008},
url = {https://doi.org/10.1016/j.jcta.2007.03.009},
doi = {10.1016/J.JCTA.2007.03.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/CanfieldGM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CavenaghGW08,
author = {Nicholas J. Cavenagh and
Catherine S. Greenhill and
Ian M. Wanless},
title = {The cycle structure of two rows in a random Latin square},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {286--309},
year = {2008},
url = {https://doi.org/10.1002/rsa.20216},
doi = {10.1002/RSA.20216},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CavenaghGW08.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/combinatorics/GreenhillR06,
author = {Catherine S. Greenhill and
Andrzej Rucinski},
title = {Neighbour-Distinguishing Edge Colourings of Random Regular Graphs},
journal = {Electron. J. Comb.},
volume = {13},
number = {1},
year = {2006},
url = {https://doi.org/10.37236/1103},
doi = {10.37236/1103},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GreenhillR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GreenhillMW06,
author = {Catherine S. Greenhill and
Brendan D. McKay and
Xiaoji Wang},
title = {Asymptotic enumeration of sparse 0-1 matrices with irregular row and
column sums},
journal = {J. Comb. Theory, Ser. {A}},
volume = {113},
number = {2},
pages = {291--324},
year = {2006},
url = {https://doi.org/10.1016/j.jcta.2005.03.005},
doi = {10.1016/J.JCTA.2005.03.005},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/GreenhillMW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GerkeGW06,
author = {Stefanie Gerke and
Catherine S. Greenhill and
Nicholas C. Wormald},
title = {The generalized acyclic edge chromatic number of random regular graphs},
journal = {J. Graph Theory},
volume = {53},
number = {2},
pages = {101--125},
year = {2006},
url = {https://doi.org/10.1002/jgt.20167},
doi = {10.1002/JGT.20167},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GerkeGW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrinkmannGGMTW05,
author = {Gunnar Brinkmann and
Sam Greenberg and
Catherine S. Greenhill and
Brendan D. McKay and
Robin Thomas and
Paul Wollan},
title = {Generation of simple quadrangulations of the sphere},
journal = {Discret. Math.},
volume = {305},
number = {1-3},
pages = {33--54},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.10.005},
doi = {10.1016/J.DISC.2005.10.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrinkmannGGMTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GreenhillP05,
author = {Catherine S. Greenhill and
Oleg Pikhurko},
title = {Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree
Graphs},
journal = {Graphs Comb.},
volume = {21},
number = {4},
pages = {407--419},
year = {2005},
url = {https://doi.org/10.1007/s00373-005-0635-y},
doi = {10.1007/S00373-005-0635-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GreenhillP05.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}
}
@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/gc/GreenhillRW04,
author = {Catherine S. Greenhill and
Andrzej Rucinski and
Nicholas C. Wormald},
title = {Random Hypergraph Processes with Degree Restrictions},
journal = {Graphs Comb.},
volume = {20},
number = {3},
pages = {319--332},
year = {2004},
url = {https://doi.org/10.1007/s00373-004-0571-2},
doi = {10.1007/S00373-004-0571-2},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GreenhillRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GreenhillKW04,
author = {Catherine S. Greenhill and
Jeong Han Kim and
Nicholas C. Wormald},
title = {Hamiltonian decompositions of random bipartite regular graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {90},
number = {2},
pages = {195--222},
year = {2004},
url = {https://doi.org/10.1016/j.jctb.2003.07.001},
doi = {10.1016/J.JCTB.2003.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GreenhillKW04.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}
}
@article{DBLP:journals/cpc/GreenhillRW03,
author = {Catherine S. Greenhill and
Andrzej Rucinski and
Nicholas C. Wormald},
title = {Connectedness Of The Degree Bounded Star Process},
journal = {Comb. Probab. Comput.},
volume = {12},
number = {3},
pages = {269--283},
year = {2003},
url = {https://doi.org/10.1017/S0963548302005357},
doi = {10.1017/S0963548302005357},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillRW03.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/cpc/GreenhillJKW02,
author = {Catherine S. Greenhill and
Svante Janson and
Jeong Han Kim and
Nicholas C. Wormald},
title = {Permutation Pseudographs And Contiguity},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {273--298},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005065},
doi = {10.1017/S0963548301005065},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillJKW02.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/cc/Greenhill00,
author = {Catherine S. Greenhill},
title = {The complexity of counting colourings and independent sets in sparse
graphs and hypergraphs},
journal = {Comput. Complex.},
volume = {9},
number = {1},
pages = {52--72},
year = {2000},
url = {https://doi.org/10.1007/PL00001601},
doi = {10.1007/PL00001601},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/Greenhill00.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/lmsjcm/Greenhill00,
author = {Catherine S. Greenhill},
title = {An Algorithm for Recognising the Exterior Square of a Multiset},
journal = {{LMS} J. Comput. Math.},
volume = {3},
pages = {96--116},
year = {2000},
url = {https://doi.org/10.1112/s1461157000000231},
doi = {10.1112/S1461157000000231},
timestamp = {Fri, 05 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmsjcm/Greenhill00.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/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/siamcomp/BubleyDGJ99,
author = {Russ Bubley and
Martin E. Dyer and
Catherine S. Greenhill and
Mark Jerrum},
title = {On Approximately Counting Colorings of Small Degree Graphs},
journal = {{SIAM} J. Comput.},
volume = {29},
number = {2},
pages = {387--400},
year = {1999},
url = {https://doi.org/10.1137/S0097539798338175},
doi = {10.1137/S0097539798338175},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BubleyDGJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/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}
}
@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/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 = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/BubleyDG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsc/Greenhill95,
author = {Catherine S. Greenhill},
title = {Theoretical and Experimental Comparison of Efficiency of Finite Field
Extensions},
journal = {J. Symb. Comput.},
volume = {20},
number = {4},
pages = {419--429},
year = {1995},
url = {https://doi.org/10.1006/jsco.1995.1057},
doi = {10.1006/JSCO.1995.1057},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jsc/Greenhill95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-02 23:51 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:
