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/cpc13.bht:"
download as .bib file
@article{DBLP:journals/cpc/AlonS04,
author = {Noga Alon and
Uri Stav},
title = {New Bounds on Parent-Identifying Codes: The Case of Multiple Parents},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {795--807},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006388},
doi = {10.1017/S0963548304006388},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlonS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlonsoCGJRS04,
author = {Laurent Alonso and
Philippe Chassaing and
Florent Gillet and
Svante Janson and
Edward M. Reingold and
Ren{\'{e}} Schott},
title = {Quicksort with Unreliable Comparisons: {A} Probabilistic Analysis},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {419--449},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006297},
doi = {10.1017/S0963548304006297},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlonsoCGJRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AronovPST04,
author = {Boris Aronov and
J{\'{a}}nos Pach and
Micha Sharir and
G{\'{a}}bor Tardos},
title = {Distinct Distances in Three and Higher Dimensions},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {283--293},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006091},
doi = {10.1017/S0963548304006091},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AronovPST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AtkinsonF04,
author = {Geoffrey Atkinson and
Alan M. Frieze},
title = {On the b-Independence Number of Sparse Random Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {295--309},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006108},
doi = {10.1017/S0963548304006108},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AtkinsonF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BalisterGLS04,
author = {Paul N. Balister and
Ervin Gy{\"{o}}ri and
Jen{\"{o}} Lehel and
Richard H. Schelp},
title = {Longest Paths in Circular Arc Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {311--317},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006145},
doi = {10.1017/S0963548304006145},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/BalisterGLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Barany04,
author = {Imre B{\'{a}}r{\'{a}}ny},
title = {Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in
Combinatorics and Geometry, by {J} Matousek, Springer, 2003, 196 pp},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {280--282},
year = {2004},
url = {https://doi.org/10.1017/S096354830400608X},
doi = {10.1017/S096354830400608X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Barany04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BiluL04,
author = {Yonatan Bilu and
Nathan Linial},
title = {Ramanujan Signing of Regular Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {911--912},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006509},
doi = {10.1017/S0963548304006509},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BiluL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bollobas04,
author = {B{\'{e}}la Bollob{\'{a}}s},
title = {How Sharp is the Concentration of the Chromatic Number?},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {115--117},
year = {2004},
url = {https://doi.org/10.1017/S0963548303006060},
doi = {10.1017/S0963548303006060},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Bollobas04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BollobasL04,
author = {B{\'{e}}la Bollob{\'{a}}s and
Imre Leader},
title = {Isoperimetric Problems for r-sets},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {277--279},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006078},
doi = {10.1017/S0963548304006078},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BollobasL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BollobasS04,
author = {B{\'{e}}la Bollob{\'{a}}s and
Alex D. Scott},
title = {Max Cut for Random Graphs with a Planted Partition},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {451--474},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006303},
doi = {10.1017/S0963548304006303},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BollobasS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bordewich04,
author = {Magnus Bordewich},
title = {Approximating the Number of Acyclic Orientations for a Class of Sparse
Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {1--16},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005844},
doi = {10.1017/S0963548303005844},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Bordewich04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Bovier04,
author = {Anton Bovier},
title = {Spin Glasses: {A} Challenge for Mathematicians - Cavity and Mean Field
Models, cby Michel Talagrand},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {913--915},
year = {2004},
url = {https://doi.org/10.1017/S096354830421656X},
doi = {10.1017/S096354830421656X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Bovier04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ChauvinFGG04,
author = {Brigitte Chauvin and
Philippe Flajolet and
Dani{\`{e}}le Gardy and
Bernhard Gittenberger},
title = {And/Or Trees Revisited},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {475--497},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006273},
doi = {10.1017/S0963548304006273},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/ChauvinFGG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperF04,
author = {Colin Cooper and
Alan M. Frieze},
title = {The Size of the Largest Strongly Connected Component of a Random Digraph
with a Given Degree Sequence},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {319--337},
year = {2004},
url = {https://doi.org/10.1017/S096354830400611X},
doi = {10.1017/S096354830400611X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DaireauxV04,
author = {Benoit Daireaux and
Brigitte Vall{\'{e}}e},
title = {Dynamical Analysis of the Parametrized Lehmer-Euclid Algorithm},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {499--536},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006261},
doi = {10.1017/S0963548304006261},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DaireauxV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DessmarkP04,
author = {Anders Dessmark and
Andrzej Pelc},
title = {Distributed Colouring and Communication in Rings with Local Knowledge},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {123--136},
year = {2004},
url = {https://doi.org/10.1017/S0963548303006011},
doi = {10.1017/S0963548303006011},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DessmarkP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DongK04,
author = {Feng Ming Dong and
Khee Meng Koh},
title = {Two Results on Real Zeros of Chromatic Polynomials},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {809--813},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006418},
doi = {10.1017/S0963548304006418},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DongK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DrmotaS04,
author = {Michael Drmota and
Wojciech Szpankowski},
title = {Special Issue on Analysis of Algorithms},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {415--417},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006455},
doi = {10.1017/S0963548304006455},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DrmotaS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DuboisLM04,
author = {Olivier Dubois and
Guy Louchard and
Jacques Mandler},
title = {Additive Decompositions, Random Allocations, and Threshold Phenomena},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {537--575},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006224},
doi = {10.1017/S0963548304006224},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DuboisLM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DuchonFLS04,
author = {Philippe Duchon and
Philippe Flajolet and
Guy Louchard and
Gilles Schaeffer},
title = {Boltzmann Samplers for the Random Generation of Combinatorial Structures},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {577--625},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006315},
doi = {10.1017/S0963548304006315},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DuchonFLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Evans04,
author = {Steven N. Evans},
title = {Embedding a Markov Chain into a Random Walk on a Permutation Group},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {339--351},
year = {2004},
url = {https://doi.org/10.1017/S096354830300600X},
doi = {10.1017/S096354830300600X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Evans04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Friedgut04,
author = {Ehud Friedgut},
title = {Influences in Product Spaces: {KKL} and {BKKKL} Revisited},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {17--29},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005832},
doi = {10.1017/S0963548303005832},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Friedgut04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Gacs04,
author = {P{\'{e}}ter G{\'{a}}cs},
title = {Compatible Sequences and a Slow Winkler Percolation},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {815--856},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006340},
doi = {10.1017/S0963548304006340},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Gacs04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GalvinK04,
author = {David J. Galvin and
Jeff Kahn},
title = {On Phase Transition in the Hard-Core Model on Math},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {137--164},
year = {2004},
url = {https://doi.org/10.1017/S0963548303006035},
doi = {10.1017/S0963548303006035},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/GalvinK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GarmoJK04,
author = {Hans Garmo and
Svante Janson and
Michal Karonski},
title = {On Generalized Random Railways},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {31--35},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005820},
doi = {10.1017/S0963548303005820},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GarmoJK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GerkeM04,
author = {Stefanie Gerke and
Colin McDiarmid},
title = {On the Number of Edges in Random Planar Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {165--183},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005947},
doi = {10.1017/S0963548303005947},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GerkeM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Gnedin04,
author = {Alexander V. Gnedin},
title = {Three Sampling Formulas},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {185--193},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005996},
doi = {10.1017/S0963548303005996},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Gnedin04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Haxell04,
author = {Penny E. Haxell},
title = {On the Strong Chromatic Number},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {857--865},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006157},
doi = {10.1017/S0963548304006157},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Haxell04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Holst04,
author = {Lars Holst},
title = {Logarithmic Combinatorial Structures: {A} Probabilistic Approach,
by RichardcArratia, A. D. Barbour and Simon Tavar{\'{e}}},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {916--917},
year = {2004},
url = {https://doi.org/10.1017/S0963548304226566},
doi = {10.1017/S0963548304226566},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Holst04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HushS04,
author = {Don R. Hush and
Clint Scovel},
title = {Fat-Shattering of Affine Functions},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {353--360},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005911},
doi = {10.1017/S0963548303005911},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HushS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/JelenkovicR04,
author = {Predrag R. Jelenkovic and
Ana Radovanovic},
title = {Optimizing {LRU} Caching for Variable Document Sizes},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {627--643},
year = {2004},
url = {https://doi.org/10.1017/S096354830400625X},
doi = {10.1017/S096354830400625X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/JelenkovicR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Johnson04,
author = {J. Robert Johnson},
title = {A Disproof of the Fon-der-Flaass Conjecture},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {195--201},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005960},
doi = {10.1017/S0963548303005960},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Johnson04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KezdyS04,
author = {Andr{\'{e}} E. K{\'{e}}zdy and
Hunter S. Snevily},
title = {Polynomials that Vanish on Distinct nth Roots of Unity},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {37--59},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005923},
doi = {10.1017/S0963548303005923},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KezdyS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KohayakawaRS04,
author = {Yoshiharu Kohayakawa and
Vojtech R{\"{o}}dl and
Mathias Schacht},
title = {The Tur{\'{a}}n Theorem for Random Graphs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {61--91},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005856},
doi = {10.1017/S0963548303005856},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KohayakawaRS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KuhnO04,
author = {Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Large Topological Cliques in Graphs Without a 4-Cycle},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {93--102},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005650},
doi = {10.1017/S0963548303005650},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KuhnO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KuhnO04a,
author = {Daniela K{\"{u}}hn and
Deryk Osthus},
title = {Subdivisions of K\({}_{\mbox{r+2}}\) in Graphs of Average Degree at
Least r+epsilon and Large but Constant Girth},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {361--371},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006169},
doi = {10.1017/S0963548304006169},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KuhnO04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Leader04,
author = {Imre Leader},
title = {Extremal Combinatorics: with Applications in Computer Science by Stasys
Jukna, Springer, 2001, xvii + 375 pp},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {119--121},
year = {2004},
url = {https://doi.org/10.1017/S096354830321244X},
doi = {10.1017/S096354830321244X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Leader04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/McColm04,
author = {Gregory L. McColm},
title = {Threshold Functions for Random Graphs on a Line Segment},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {373--387},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006121},
doi = {10.1017/S0963548304006121},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/McColm04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MilenkovicC04,
author = {Olgica Milenkovic and
Kevin J. Compton},
title = {Probabilistic Transforms for Combinatorial Urn Models},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {645--675},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006285},
doi = {10.1017/S0963548304006285},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/MilenkovicC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MorrisPP04,
author = {Kate Morris and
Alois Panholzer and
Helmut Prodinger},
title = {On Some Parameters in Heap Ordered Trees},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {677--696},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006194},
doi = {10.1017/S0963548304006194},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/MorrisPP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Panholzer04,
author = {Alois Panholzer},
title = {Distribution of the Steiner Distance in Generalized M-ary Search Trees},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {717--733},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006212},
doi = {10.1017/S0963548304006212},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Panholzer04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Parviainen04,
author = {Robert Parviainen},
title = {Random Assignment with Integer Costs},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {103--113},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005819},
doi = {10.1017/S0963548303005819},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Parviainen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Pebody04,
author = {Luke Pebody},
title = {The Reconstructibility of Finite Abelian Groups},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {867--892},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005807},
doi = {10.1017/S0963548303005807},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Pebody04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/PemantleW04,
author = {Robin Pemantle and
Mark C. Wilson},
title = {Asymptotics of Multivariate Sequences {II:} Multiple Points of the
Singular Variety},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {735--761},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006248},
doi = {10.1017/S0963548304006248},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/PemantleW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Schachinger04,
author = {Werner Schachinger},
title = {Concentration of Size and Path Length of Tries},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {763--793},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006200},
doi = {10.1017/S0963548304006200},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Schachinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Scott04,
author = {Alexander D. Scott},
title = {Topics in Graph Automorphisms and Reconstruction by Josef Lauri and
Raffaele Scapellato, Cambridge University Press, 2003, 172 pp},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {1},
pages = {122},
year = {2004},
url = {https://doi.org/10.1017/S0963548303222446},
doi = {10.1017/S0963548303222446},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Scott04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/SharirW04,
author = {Micha Sharir and
Emo Welzl},
title = {Point-Line Incidences in Space},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {203--220},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005935},
doi = {10.1017/S0963548303005935},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/SharirW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/SmorodinskyS04,
author = {Shakhar Smorodinsky and
Micha Sharir},
title = {Selecting Points that are Heavily Covered by Pseudo-Circles, Spheres
or Rectangles},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {389--411},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005984},
doi = {10.1017/S0963548303005984},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/SmorodinskyS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Sokal04,
author = {Alan D. Sokal},
title = {Chromatic Roots are Dense in the Whole Complex Plane},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {221--261},
year = {2004},
url = {https://doi.org/10.1017/S0963548303006023},
doi = {10.1017/S0963548303006023},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Sokal04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Solymosi04,
author = {J{\'{o}}zsef Solymosi},
title = {A Note on a Question of Erdos and Graham},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {263--267},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005959},
doi = {10.1017/S0963548303005959},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Solymosi04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/The04,
author = {Michel Nguy{\^{e}}n{-}Th{\^{e}}},
title = {Area and Inertial Moment of Dyck Paths},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {4-5},
pages = {697--716},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006339},
doi = {10.1017/S0963548304006339},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/The04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Thomason04,
author = {Andrew Thomason},
title = {Two Minor Problems},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {3},
pages = {412},
year = {2004},
url = {https://doi.org/10.1017/S0963548304006236},
doi = {10.1017/S0963548304006236},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/Thomason04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Traldi04,
author = {Lorenzo Traldi},
title = {A Subset Expansion of the Coloured Tutte Polynomial},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {2},
pages = {269--275},
year = {2004},
url = {https://doi.org/10.1017/S0963548303005972},
doi = {10.1017/S0963548303005972},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Traldi04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Yuster04,
author = {Raphael Yuster},
title = {Families of Trees Decompose the Random Graph in an Arbitrary Way},
journal = {Comb. Probab. Comput.},
volume = {13},
number = {6},
pages = {893--910},
year = {2004},
url = {https://doi.org/10.1017/S096354830400639X},
doi = {10.1017/S096354830400639X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Yuster04.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-06-04 01:09 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:
