Search dblp for Publications

export results for "toc:db/journals/cpc/cpc19.bht:"

 download as .bib file

@article{DBLP:journals/cpc/Addario-BerryBL10,
  author       = {Louigi Addario{-}Berry and
                  Nicolas Broutin and
                  G{\'{a}}bor Lugosi},
  title        = {The Longest Minimum-Weight Path in a Complete Graph},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {1--19},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990204},
  doi          = {10.1017/S0963548309990204},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Addario-BerryBL10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlonB10,
  author       = {Noga Alon and
                  B{\'{e}}la Bollob{\'{a}}s},
  title        = {Introduction},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {641},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000362},
  doi          = {10.1017/S0963548310000362},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/AlonB10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlonHK10,
  author       = {Noga Alon and
                  Dan Hefetz and
                  Michael Krivelevich},
  title        = {Playing to Retain the Advantage},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {481--491},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000064},
  doi          = {10.1017/S0963548310000064},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/AlonHK10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AminiHHT10,
  author       = {Omid Amini and
                  Fr{\'{e}}d{\'{e}}ric Havet and
                  Florian Huc and
                  St{\'{e}}phan Thomass{\'{e}}},
  title        = {{WDM} and Directed Star Arboricity},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {161--182},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990551},
  doi          = {10.1017/S0963548309990551},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/AminiHHT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ArpeM10,
  author       = {Jan Arpe and
                  Elchanan Mossel},
  title        = {Application of a Generalization of Russo's Formula to Learning from
                  Multiple Random Oracles},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {183--199},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990277},
  doi          = {10.1017/S0963548309990277},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/ArpeM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BalisterKS10,
  author       = {Paul Balister and
                  Steve Kalikow and
                  Amites Sarkar},
  title        = {The Linus Sequence},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {21--46},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990198},
  doi          = {10.1017/S0963548309990198},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/BalisterKS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BaloghBM10,
  author       = {J{\'{o}}zsef Balogh and
                  B{\'{e}}la Bollob{\'{a}}s and
                  Robert Morris},
  title        = {Bootstrap Percolation in High Dimensions},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {643--692},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000271},
  doi          = {10.1017/S0963548310000271},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/BaloghBM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bar-NoyCOS10,
  author       = {Amotz Bar{-}Noy and
                  Panagiotis Cheilaris and
                  Svetlana Olonetsky and
                  Shakhar Smorodinsky},
  title        = {Online Conflict-Free Colouring for Hypergraphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {493--516},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990587},
  doi          = {10.1017/S0963548309990587},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Bar-NoyCOS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Barvinok10,
  author       = {Alexander I. Barvinok},
  title        = {What Does a Random Contingency Table Look Like?},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {517--539},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000039},
  doi          = {10.1017/S0963548310000039},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Barvinok10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BeveridgeL10,
  author       = {Andrew Beveridge and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
  title        = {Exit Frequency Matrices for Finite Markov Chains},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {541--560},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000118},
  doi          = {10.1017/S0963548310000118},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/BeveridgeL10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BodiniFP10,
  author       = {Olivier Bodini and
                  {\'{E}}ric Fusy and
                  Carine Pivoteau},
  title        = {Random Sampling of Plane Partitions},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {201--226},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990332},
  doi          = {10.1017/S0963548309990332},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/BodiniFP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BruhnS10,
  author       = {Henning Bruhn and
                  Maya Jakobine Stein},
  title        = {Duality of Ends},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {47--60},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990320},
  doi          = {10.1017/S0963548309990320},
  timestamp    = {Sat, 05 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cpc/BruhnS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Coja-Oghlan10,
  author       = {Amin Coja{-}Oghlan},
  title        = {Graph Partitioning via Adaptive Spectral Techniques},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {227--284},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990514},
  doi          = {10.1017/S0963548309990514},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Coja-Oghlan10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CostelloV10,
  author       = {Kevin P. Costello and
                  Van H. Vu},
  title        = {On the Rank of Random Sparse Matrices},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {321--342},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990447},
  doi          = {10.1017/S0963548309990447},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/CostelloV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CzumajS10,
  author       = {Artur Czumaj and
                  Christian Sohler},
  title        = {Testing Expansion in Bounded-Degree Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {693--709},
  year         = {2010},
  url          = {https://doi.org/10.1017/S096354831000012X},
  doi          = {10.1017/S096354831000012X},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cpc/CzumajS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DennertG10,
  author       = {Florian Dennert and
                  Rudolf Gr{\"{u}}bel},
  title        = {On the Subtree Size Profile of Binary Search trees},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {561--578},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990630},
  doi          = {10.1017/S0963548309990630},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/DennertG10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DiaoH10,
  author       = {Yuanan Diao and
                  G{\'{a}}bor Hetyei},
  title        = {Relative Tutte Polynomials for Coloured Graphs and Virtual Knot Theory},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {343--369},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990484},
  doi          = {10.1017/S0963548309990484},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/DiaoH10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DietzfelbingerRWW10,
  author       = {Martin Dietzfelbinger and
                  Jonathan E. Rowe and
                  Ingo Wegener and
                  Philipp Woelfel},
  title        = {Tight Bounds for Blind Search on the Integers and the Reals},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {711--728},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990599},
  doi          = {10.1017/S0963548309990599},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/DietzfelbingerRWW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DingD10,
  author       = {Guoli Ding and
                  Stan Dziobiak},
  title        = {Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {579--591},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000076},
  doi          = {10.1017/S0963548310000076},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/DingD10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DingKLP10,
  author       = {Jian Ding and
                  Jeong Han Kim and
                  Eyal Lubetzky and
                  Yuval Peres},
  title        = {Diameters in Supercritical Random Graphs Via First Passage Percolation},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {729--751},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000301},
  doi          = {10.1017/S0963548310000301},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/DingKLP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FoxKS10,
  author       = {Jacob Fox and
                  Peter Keevash and
                  Benny Sudakov},
  title        = {Directed Graphs Without Short Cycles},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {285--301},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990460},
  doi          = {10.1017/S0963548309990460},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/FoxKS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FoxP10,
  author       = {Jacob Fox and
                  J{\'{a}}nos Pach},
  title        = {A Separator Theorem for String Graphs and its Applications},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {371--390},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990459},
  doi          = {10.1017/S0963548309990459},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/FoxP10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FoxS10,
  author       = {Jacob Fox and
                  Benny Sudakov},
  title        = {Decompositions into Subgraphs of Small Diameter},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {753--774},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000040},
  doi          = {10.1017/S0963548310000040},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/FoxS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GamarnikG10,
  author       = {David Gamarnik and
                  David A. Goldberg},
  title        = {Randomized Greedy Algorithms for Independent Sets and Matchings in
                  Regular Graphs: Exact Results and Finite Girth Corrections},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {61--85},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990186},
  doi          = {10.1017/S0963548309990186},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/GamarnikG10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Goerdt10,
  author       = {Andreas Goerdt},
  title        = {On Random Betweenness Constraints},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {775--790},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000313},
  doi          = {10.1017/S0963548310000313},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Goerdt10.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/cpc/Holmgren10,
  author       = {Cecilia Holmgren},
  title        = {Random Records and Cuttings in Binary Search Trees},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {391--424},
  year         = {2010},
  url          = {https://doi.org/10.1017/S096354830999068X},
  doi          = {10.1017/S096354830999068X},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Holmgren10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KangM10,
  author       = {Ross J. Kang and
                  Colin McDiarmid},
  title        = {The \emph{t}-Improper Chromatic Number of Random Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {87--98},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990216},
  doi          = {10.1017/S0963548309990216},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/KangM10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KubaW10,
  author       = {Markus Kuba and
                  Stephan G. Wagner},
  title        = {Deterministic Edge Weights in Increasing Tree Families},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {99--119},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990228},
  doi          = {10.1017/S0963548309990228},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/KubaW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LuczakT10,
  author       = {Tomasz Luczak and
                  Andrew Thomason},
  title        = {Vicarious Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {819--827},
  year         = {2010},
  url          = {https://doi.org/10.1017/S096354830999054X},
  doi          = {10.1017/S096354830999054X},
  timestamp    = {Wed, 03 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cpc/LuczakT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Lyons10,
  author       = {Russell Lyons},
  title        = {Identities and Inequalities for Tree Entropy},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {303--313},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990605},
  doi          = {10.1017/S0963548309990605},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Lyons10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mani10,
  author       = {Arun P. Mani},
  title        = {Some Inequalities for Whitney-Tutte Polynomials},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {425--439},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990617},
  doi          = {10.1017/S0963548309990617},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Mani10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Matiyasevich10,
  author       = {Yuri V. Matiyasevich},
  title        = {One More Probabilistic Reformulation of the Four Colour Conjecture},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {829--834},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000246},
  doi          = {10.1017/S0963548310000246},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Matiyasevich10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Pikhurko10,
  author       = {Oleg Pikhurko},
  title        = {Finding an Unknown Acyclic Orientation of a Given Graph},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {121--131},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990289},
  doi          = {10.1017/S0963548309990289},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Pikhurko10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Renlund10,
  author       = {Henrik Renlund},
  title        = {First-Passage Percolation with Exponential Times on a Ladder},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {593--601},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000052},
  doi          = {10.1017/S0963548310000052},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Renlund10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RiordanW10,
  author       = {Oliver Riordan and
                  Nicholas C. Wormald},
  title        = {The Diameter of Sparse Random Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {5-6},
  pages        = {835--926},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548310000325},
  doi          = {10.1017/S0963548310000325},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/RiordanW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/SchwerdtfegerRT10,
  author       = {Uwe Schwerdtfeger and
                  Christoph Richard and
                  Bhalchandra Thatte},
  title        = {Area Limit Laws for Symmetry Classes of Staircase Polygons},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {441--461},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990629},
  doi          = {10.1017/S0963548309990629},
  timestamp    = {Fri, 12 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/SchwerdtfegerRT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Tao10,
  author       = {Terence Tao},
  title        = {Sumset and Inverse Sumset Theory for Shannon Entropy},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {4},
  pages        = {603--639},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990642},
  doi          = {10.1017/S0963548309990642},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Tao10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Traldi10,
  author       = {Lorenzo Traldi},
  title        = {Weighted Interlace Polynomials},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {1},
  pages        = {133--157},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990381},
  doi          = {10.1017/S0963548309990381},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Traldi10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Wanless10,
  author       = {Ian M. Wanless},
  title        = {Counting Matchings and Tree-Like Walks in Regular Graphs},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {3},
  pages        = {463--480},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990678},
  doi          = {10.1017/S0963548309990678},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Wanless10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Zhao10,
  author       = {Yufei Zhao},
  title        = {The Number of Independent Sets in a Regular Graph},
  journal      = {Comb. Probab. Comput.},
  volume       = {19},
  number       = {2},
  pages        = {315--320},
  year         = {2010},
  url          = {https://doi.org/10.1017/S0963548309990538},
  doi          = {10.1017/S0963548309990538},
  timestamp    = {Thu, 12 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cpc/Zhao10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}