Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/cpc/cpc28.bht:"
download as .bib file
@article{DBLP:journals/cpc/AndrenCM19,
author = {Lina Jansson Andr{\'{e}}n and
Carl Johan Casselgren and
Klas Markstr{\"{o}}m},
title = {Restricted completion of sparse partial Latin squares},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {675--695},
year = {2019},
url = {https://doi.org/10.1017/S096354831800055X},
doi = {10.1017/S096354831800055X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AndrenCM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AumullerDHKP19,
author = {Martin Aum{\"{u}}ller and
Martin Dietzfelbinger and
Clemens Heuberger and
Daniel Krenn and
Helmut Prodinger},
title = {Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated
Lattice Paths},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {485--518},
year = {2019},
url = {https://doi.org/10.1017/S096354831800041X},
doi = {10.1017/S096354831800041X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/AumullerDHKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BaloghTW19,
author = {J{\'{o}}zsef Balogh and
Andrew Treglown and
Zsolt Adam Wagner},
title = {Tilings in Randomly Perturbed Dense Graphs},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {159--176},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000366},
doi = {10.1017/S0963548318000366},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BaloghTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BarvinokR19,
author = {Alexander I. Barvinok and
Guus Regts},
title = {Weighted counting of solutions to sparse systems of equations},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {696--719},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000105},
doi = {10.1017/S0963548319000105},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BarvinokR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BatesS19,
author = {Erik Bates and
Lisa Sauermann},
title = {An Upper Bound on the Size of Avoidance Couplings},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {325--334},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000500},
doi = {10.1017/S0963548318000500},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BatesS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BennettB19,
author = {Patrick Bennett and
Tom Bohman},
title = {A natural barrier in random greedy hypergraph matching},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {816--825},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000051},
doi = {10.1017/S0963548319000051},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BennettB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bienvenu19,
author = {Fran{\c{c}}ois Bienvenu},
title = {Positive association of the oriented percolation cluster in randomly
oriented graphs},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {811--815},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000191},
doi = {10.1017/S0963548319000191},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Bienvenu19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BlancaCGRT19,
author = {Antonio Blanca and
Yuxuan Chen and
David J. Galvin and
Dana Randall and
Prasad Tetali},
title = {Phase Coexistence for the Hard-Core Model on {\(\mathbb{Z}\)}2},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {1--22},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000238},
doi = {10.1017/S0963548318000238},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BlancaCGRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BousquetEHV19,
author = {Nicolas Bousquet and
Louis Esperet and
Ararat Harutyunyan and
R{\'{e}}mi de Joannis de Verclos},
title = {Exact Distance Colouring in Trees},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {177--186},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000378},
doi = {10.1017/S0963548318000378},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BousquetEHV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CaiHJJS19,
author = {Xing Shi Cai and
Cecilia Holmgren and
Svante Janson and
Tony Johansson and
Fiona Skerman},
title = {Inversions in Split Trees and Conditional Galton-Watson Trees},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {335--364},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000512},
doi = {10.1017/S0963548318000512},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CaiHJJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CannonLS19,
author = {Sarah Cannon and
David A. Levin and
Alexandre Stauffer},
title = {Polynomial Mixing of the Edge-Flip Markov Chain for Unbiased Dyadic
Tilings},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {365--387},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000470},
doi = {10.1017/S0963548318000470},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CannonLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ColletDK19,
author = {G. Collet and
Michael Drmota and
Lukas Daniel Klausner},
title = {Limit laws of planar maps with prescribed vertex degrees},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {519--541},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000573},
doi = {10.1017/S0963548318000573},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ColletDK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DesalvoP19,
author = {Stephen Desalvo and
Igor Pak},
title = {Limit Shapes via Bijections},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {187--240},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000330},
doi = {10.1017/S0963548318000330},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DesalvoP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DrmotaMS19,
author = {Michael Drmota and
Abram Magner and
Wojciech Szpankowski},
title = {Asymmetric R{\'{e}}nyi Problem},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {542--573},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000329},
doi = {10.1017/S0963548318000329},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DrmotaMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/EllisL19,
author = {David Ellis and
Noam Lifshitz},
title = {On the union of intersecting families},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {826--839},
year = {2019},
url = {https://doi.org/10.1017/S096354831900004X},
doi = {10.1017/S096354831900004X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/EllisL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ErgemlidzeGM19,
author = {Beka Ergemlidze and
Ervin Gy{\"{o}}ri and
Abhishek Methuku},
title = {Tur{\'{a}}n Number of an Induced Complete Bipartite Graph Plus
an Odd Cycle},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {241--252},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000354},
doi = {10.1017/S0963548318000354},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/ErgemlidzeGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/EsperetKT19,
author = {Louis Esperet and
Ross J. Kang and
St{\'{e}}phan Thomass{\'{e}}},
title = {Separation Choosability and Dense Bipartite Induced Subgraphs},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {720--732},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000026},
doi = {10.1017/S0963548319000026},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/EsperetKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FoxLZ19,
author = {Jacob Fox and
L{\'{a}}szl{\'{o}} Mikl{\'{o}}s Lov{\'{a}}sz and
Yufei Zhao},
title = {A fast new algorithm for weak graph regularity},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {777--790},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000075},
doi = {10.1017/S0963548319000075},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FoxLZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Frankl19,
author = {Peter Frankl},
title = {A near-exponential improvement of a bound of Erd{\H{o}}s and Lov{\'{a}}sz
on maximal intersecting families},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {733--739},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000142},
doi = {10.1017/S0963548319000142},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/Frankl19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FujitaLW19,
author = {Shinya Fujita and
Ruonan Li and
Guanghui Wang},
title = {Decomposing edge-coloured graphs under colour degree constraints},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {755--767},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000014},
doi = {10.1017/S0963548319000014},
timestamp = {Mon, 14 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FujitaLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GaoHZ19,
author = {Wei Gao and
Jie Han and
Yi Zhao},
title = {Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose
Cycles},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {840--870},
year = {2019},
url = {https://doi.org/10.1017/S096354831900021X},
doi = {10.1017/S096354831900021X},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GaoHZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GeilM19,
author = {Olav Geil and
Umberto Mart{\'{\i}}nez{-}Pe{\~{n}}as},
title = {Bounding the Number of Common Zeros of Multivariate Polynomials and
Their Consecutive Derivatives},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {253--279},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000342},
doi = {10.1017/S0963548318000342},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GeilM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GoelA19,
author = {Gopal Goel and
Andrew Ahn},
title = {Discrete derivative asymptotics of the {\(\beta\)}-Hermite eigenvalues},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {657--674},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000087},
doi = {10.1017/S0963548319000087},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GoelA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GoldschmidtP19,
author = {Christina Goldschmidt and
Michal Przykucki},
title = {Parking on a Random Tree},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {23--45},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000457},
doi = {10.1017/S0963548318000457},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GoldschmidtP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GrossG19,
author = {Renan Gross and
Uri Grupel},
title = {Indistinguishable Sceneries on the Boolean Hypercube},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {46--60},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000305},
doi = {10.1017/S0963548318000305},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GrossG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HammK19,
author = {Arran Hamm and
Jeff Kahn},
title = {On Erd{\H{o}}s-Ko-Rado for Random Hypergraphs {II}},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {61--80},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000433},
doi = {10.1017/S0963548318000433},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/HammK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HammK19a,
author = {Arran Hamm and
Jeff Kahn},
title = {On Erd{\H{o}}s-Ko-Rado for random hypergraphs {I}},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {881--916},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000117},
doi = {10.1017/S0963548319000117},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/HammK19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HendreyW19,
author = {Kevin Hendrey and
David R. Wood},
title = {Defective and clustered choosability of sparse graphs},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {791--810},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000063},
doi = {10.1017/S0963548319000063},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HendreyW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HolroydLW19,
author = {Alexander E. Holroyd and
Lionel Levine and
Peter Winkler},
title = {Abelian Logic Gates},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {388--422},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000482},
doi = {10.1017/S0963548318000482},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HolroydLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HwangNZ19,
author = {Hsien{-}Kuei Hwang and
Ralph Neininger and
Marek Zaionc},
title = {Preface},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {483--484},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000166},
doi = {10.1017/S0963548319000166},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HwangNZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Janson19,
author = {Svante Janson},
title = {Random Recursive Trees and Preferential Attachment Trees are Random
Split Trees},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {81--99},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000226},
doi = {10.1017/S0963548318000226},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Janson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/JavadiKOP19,
author = {Ramin Javadi and
Farideh Khoeini and
G. R. Omidi and
Alexey Pokrovskiy},
title = {On the Size-Ramsey Number of Cycles},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {871--880},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000221},
doi = {10.1017/S0963548319000221},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/JavadiKOP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Kang19,
author = {Dong Yeap Kang},
title = {Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {423--464},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000469},
doi = {10.1017/S0963548318000469},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Kang19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KangO19,
author = {Dong Yeap Kang and
Sang{-}il Oum},
title = {Improper colouring of graphs with no odd clique minor},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {740--754},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000548},
doi = {10.1017/S0963548318000548},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KangO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KralLMP19,
author = {Daniel Kr{\'{a}}l' and
Bernard Lidick{\'{y}} and
Ta{\'{\i}}sa L. Martins and
Yanitsa Pehova},
title = {Decomposing Graphs into Edges and Triangles},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {465--472},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000421},
doi = {10.1017/S0963548318000421},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KralLMP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KubaP19,
author = {Markus Kuba and
Alois Panholzer},
title = {Combinatorial Analysis of Growth Models for Series-Parallel Networks},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {574--599},
year = {2019},
url = {https://doi.org/10.1017/S096354831800038X},
doi = {10.1017/S096354831800038X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KubaP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KupavskiiMS19,
author = {Andrey Kupavskii and
Nabil H. Mustafa and
Konrad J. Swanepoel},
title = {Bounding the Size of an Almost-Equidistant Set in Euclidean Space},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {280--286},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000287},
doi = {10.1017/S0963548318000287},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KupavskiiMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LiM19,
author = {Jiange Li and
Mokshay Madiman},
title = {A Combinatorial Approach to Small Ball Inequalities for Sums and Differences},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {100--129},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000494},
doi = {10.1017/S0963548318000494},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/LiM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Linusson19,
author = {Svante Linusson},
title = {Erratum to 'On Percolation and the Bunkbed Conjecture'},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {917--918},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000038},
doi = {10.1017/S0963548319000038},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/Linusson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LoS19,
author = {Allan Lo and
Nicol{\'{a}}s Sanhueza{-}Matamala},
title = {An asymptotic bound for the strong chromatic number},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {768--776},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000561},
doi = {10.1017/S0963548318000561},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/LoS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Martinsson19,
author = {Anders Martinsson},
title = {A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {287--302},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000391},
doi = {10.1017/S0963548318000391},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Martinsson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Marton19,
author = {Katalin Marton},
title = {Logarithmic Sobolev inequalities in discrete product spaces},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {919--935},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000099},
doi = {10.1017/S0963548319000099},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Marton19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MubayiT19,
author = {Dhruv Mubayi and
Caroline Terry},
title = {An Extremal Graph Problem with a Transcendental Solution},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {2},
pages = {303--324},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000299},
doi = {10.1017/S0963548318000299},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/MubayiT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MustafaR19,
author = {Nabil H. Mustafa and
Saurabh Ray},
title = {On a Problem of Danzer},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {3},
pages = {473--482},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000445},
doi = {10.1017/S0963548318000445},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/MustafaR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/PobleteV19,
author = {Patricio V. Poblete and
Alfredo Viola},
title = {Analysis of Robin Hood and Other Hashing Algorithms Under the Random
Probing Model, With and Without Deletions},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {600--617},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000408},
doi = {10.1017/S0963548318000408},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/PobleteV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RalaivaosaonaW19,
author = {Dimbinaina Ralaivaosaona and
Stephan G. Wagner},
title = {A central limit theorem for additive functionals of increasing trees},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {618--637},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000585},
doi = {10.1017/S0963548318000585},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RalaivaosaonaW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RasendrahasinaR19,
author = {Vonjy Rasendrahasina and
Andry Rasoanaivo and
Vlady Ravelomanana},
title = {Expected Maximum Block Size in Critical Random Graphs},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {4},
pages = {638--655},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000154},
doi = {10.1017/S0963548319000154},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RasendrahasinaR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Rassmann19,
author = {Felicia Ra{\ss}mann},
title = {On the Number of Solutions in Random Graph k-Colouring},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {1},
pages = {130--158},
year = {2019},
url = {https://doi.org/10.1017/S0963548318000251},
doi = {10.1017/S0963548318000251},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Rassmann19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Uzzell19,
author = {Andrew J. Uzzell},
title = {An Improved Upper Bound for Bootstrap Percolation in All Dimensions},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {6},
pages = {936--960},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000130},
doi = {10.1017/S0963548319000130},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Uzzell19.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.
retrieved on 2024-04-25 18:10 CEST from data curated 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:
