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/cpc11.bht:"
download as .bib file
@article{DBLP:journals/cpc/AlmP02,
author = {Sven Erick Alm and
Robert Parviainen},
title = {Lower And Upper Bounds For The Time Constant Of First-Passage Percolation},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {433--445},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005266},
doi = {10.1017/S0963548302005266},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlmP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlmS02,
author = {Sven Erick Alm and
Gregory B. Sorkin},
title = {Exact Expectations And Distributions For The Random Assignment Problem},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {217--248},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005114},
doi = {10.1017/S0963548302005114},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlmS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/AlonM02,
author = {Noga Alon and
Bojan Mohar},
title = {The Chromatic Number Of Graph Powers},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {1--10},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004965},
doi = {10.1017/S0963548301004965},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/AlonM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BealsLNPS02,
author = {Robert Beals and
Charles R. Leedham{-}Green and
Alice C. Niemeyer and
Cheryl E. Praeger and
{\'{A}}kos Seress},
title = {Permutations With Restricted Cycle Structure And An Algorithmic Application},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {447--464},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005217},
doi = {10.1017/S0963548302005217},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BealsLNPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BellenbaumD02,
author = {Patrick Bellenbaum and
Reinhard Diestel},
title = {Two Short Proofs Concerning Tree-Decompositions},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {541--547},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005369},
doi = {10.1017/S0963548302005369},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BellenbaumD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Borkar02,
author = {Vivek S. Borkar},
title = {On The Lock-In Probability Of Stochastic Approximation},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {11--20},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004953},
doi = {10.1017/S0963548301004953},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Borkar02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/BoucheronV02,
author = {St{\'{e}}phane Boucheron and
Wenceslas Fernandez de la Vega},
title = {On {A} Square Packing Problem},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {113--127},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005041},
doi = {10.1017/S0963548301005041},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/BoucheronV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperF02,
author = {Colin Cooper and
Alan M. Frieze},
title = {Multi-Coloured Hamilton Cycles In Random Edge-Coloured Graphs},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {129--133},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005004},
doi = {10.1017/S0963548301005004},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperFR02,
author = {Colin Cooper and
Alan M. Frieze and
Bruce A. Reed},
title = {Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {249--261},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005090},
doi = {10.1017/S0963548301005090},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperFR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperFRR02,
author = {Colin Cooper and
Alan M. Frieze and
Bruce A. Reed and
Oliver Riordan},
title = {Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic
Number},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {323--341},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005254},
doi = {10.1017/S0963548302005254},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperFRR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Dobson02,
author = {Edward Dobson},
title = {Packing Trees Into The Complete Graph},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {263--272},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005077},
doi = {10.1017/S0963548301005077},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Dobson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Dobson02a,
author = {Edward Dobson},
title = {Constructing Trees In Graphs Whose Complement Has No K2, {S}},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {343--347},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005102},
doi = {10.1017/S0963548302005102},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Dobson02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Dohmen02,
author = {Klaus Dohmen},
title = {Bonferroni-Type Inequalities Via Chordal Graphs},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {349--351},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005151},
doi = {10.1017/S0963548302005151},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Dohmen02.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/GoldbergJ02,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {The "Burnside Process" Converges Slowly},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {21--34},
year = {2002},
url = {https://doi.org/10.1017/S096354830100493X},
doi = {10.1017/S096354830100493X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GoldbergJ02.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/cpc/HwangT02,
author = {Hsien{-}Kuei Hwang and
Tsung{-}Hsi Tsai},
title = {Quickselect And The Dickman Function},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {353--371},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005138},
doi = {10.1017/S0963548302005138},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/HwangT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/JuknaS02,
author = {Stasys Jukna and
Georg Schnitger},
title = {Triangle-Freeness Is Hard To Detect},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {549--569},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005333},
doi = {10.1017/S0963548302005333},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/JuknaS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KezdyS02,
author = {Andr{\'{e}} E. K{\'{e}}zdy and
Hunter S. Snevily},
title = {Distinct Sums Modulo {N} And Tree Embeddings},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {35--42},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004874},
doi = {10.1017/S0963548301004874},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/KezdyS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KrivelevichSV02,
author = {Michael Krivelevich and
Benny Sudakov and
Van H. Vu},
title = {A Sharp Threshold For Network Reliability},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {465--474},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005199},
doi = {10.1017/S0963548302005199},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KrivelevichSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/KubickiLM02,
author = {Grzegorz Kubicki and
Jen{\"{o}} Lehel and
Michal Morayne},
title = {A Ratio Inequality For Binary Trees And The Best Secretary},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {149--161},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004977},
doi = {10.1017/S0963548301004977},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/KubickiLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Kutin02,
author = {Samuel Kutin},
title = {Constructing Large Set Systems With Given Intersection Sizes Modulo
Composite Numbers},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {475--486},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005242},
doi = {10.1017/S0963548302005242},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Kutin02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/LeeW02,
author = {Orlando Lee and
Yoshiko Wakabayashi},
title = {On The Circuit Cover Problemfor Mixed Graphs},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {43--59},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004989},
doi = {10.1017/S0963548301004989},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/LeeW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mansson02,
author = {Marianne M{\aa}nsson},
title = {Pattern Avoidance And Overlap In Strings},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {393--402},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005187},
doi = {10.1017/S0963548302005187},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Mansson02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Manstavicius02,
author = {Eugenijus Manstavicius},
title = {Mappings On Decomposable Combinatorial Structures: Analytic Approach},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {61--78},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005016},
doi = {10.1017/S0963548301005016},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Manstavicius02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mcdiarmid02,
author = {Colin McDiarmid},
title = {Concentration For Independent Permutations},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {163--178},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005089},
doi = {10.1017/S0963548301005089},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Mcdiarmid02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MckayWW02,
author = {Brendan D. McKay and
Ian M. Wanless and
Nicholas C. Wormald},
title = {Asymptotic Enumeration Of Graphs With {A} Given Upper Bound On The
Maximum Degree},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {373--392},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005229},
doi = {10.1017/S0963548302005229},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/MckayWW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mossel02,
author = {Elchanan Mossel},
title = {The Minesweeper Game: Percolation And Complexity},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {487--499},
year = {2002},
url = {https://doi.org/10.1017/S096354830200528X},
doi = {10.1017/S096354830200528X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Mossel02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Mubayi02,
author = {Dhruv Mubayi},
title = {Some Exact Results And New Asymptotics For Hypergraph Tur{\'{a}}n
Numbers},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {299--309},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005028},
doi = {10.1017/S0963548301005028},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Mubayi02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Myers02,
author = {Joseph Samuel Myers},
title = {Graphs Without Large Complete Minors Are Quasi-Random},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {571--585},
year = {2002},
url = {https://doi.org/10.1017/S096354830200531X},
doi = {10.1017/S096354830200531X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Myers02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Neininger02,
author = {Ralph Neininger},
title = {The Wiener Index Of Random Trees},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {587--597},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005321},
doi = {10.1017/S0963548302005321},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Neininger02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Nikiforov02,
author = {Vladimir Nikiforov},
title = {Some Inequalities For The Largest Eigenvalue Of {A} Graph},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {179--189},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004928},
doi = {10.1017/S0963548301004928},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/Nikiforov02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Oporowski02,
author = {Bogdan Oporowski},
title = {Partitioning Matroids With Only Small Cocircuits},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {191--197},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004916},
doi = {10.1017/S0963548301004916},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Oporowski02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/OxleyW02,
author = {James G. Oxley and
Dominic J. A. Welsh},
title = {Chromatic, Flow And Reliability Polynomials: The Complexity Of Their
Coefficients},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {403--426},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005175},
doi = {10.1017/S0963548302005175},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/OxleyW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Pitman02,
author = {Jim Pitman},
title = {Poisson-Dirichlet And Gem Invariant Distributions For Split-And-Merge
Transformations Of An Interval Partition},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {501--514},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005163},
doi = {10.1017/S0963548302005163},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Pitman02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Reidys02,
author = {Christian M. Reidys},
title = {Distances In Random Induced Subgraphs Of Generalized N-Cubes},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {599--605},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005291},
doi = {10.1017/S0963548302005291},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Reidys02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Schwartz02,
author = {Gary K. Schwartz},
title = {On The Automorphism Groups Of Dowling Geometries},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {311--321},
year = {2002},
url = {https://doi.org/10.1017/S096354830200514X},
doi = {10.1017/S096354830200514X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Schwartz02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Slilaty02,
author = {Daniel C. Slilaty},
title = {Matroid Duality From Topological Duality In Surfaces Of Nonnegative
Euler Characteristic},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {515--528},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005278},
doi = {10.1017/S0963548302005278},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Slilaty02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Stadje02,
author = {Wolfgang Stadje},
title = {The Residues Modulo {M} Of Products Of Random Integers},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {5},
pages = {529--540},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005308},
doi = {10.1017/S0963548302005308},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Stadje02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Stark02,
author = {Dudley Stark},
title = {Information Loss In Top To Random Shuffling},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {607--627},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005382},
doi = {10.1017/S0963548302005382},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/Stark02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/StarkGO02,
author = {Dudley Stark and
Ayalvadi Ganesh and
Neil O'Connell},
title = {Information Loss In Riffle Shuffling},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {79--95},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004990},
doi = {10.1017/S0963548301004990},
timestamp = {Sat, 10 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/StarkGO02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Talbot02,
author = {John M. Talbot},
title = {Lagrangians Of Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {2},
pages = {199--216},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005053},
doi = {10.1017/S0963548301005053},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Talbot02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Telcs02,
author = {Andr{\'{a}}s Telcs},
title = {A Note On Rough Isometry Invariance Of Resistance},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {427--432},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005205},
doi = {10.1017/S0963548302005205},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Telcs02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Verstraete02,
author = {Jacques Verstra{\"{e}}te},
title = {A Note On Vertex-Disjoint Cycles},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {97--102},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004904},
doi = {10.1017/S0963548301004904},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Verstraete02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Vu02,
author = {Van H. Vu},
title = {A General Upper Bound On The List Chromatic Number Of Locally Sparse
Graphs},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {1},
pages = {103--111},
year = {2002},
url = {https://doi.org/10.1017/S0963548301004898},
doi = {10.1017/S0963548301004898},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Vu02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Wierman02,
author = {John C. Wierman},
title = {An Improved Upper Bound For The Hexagonal Lattice Site Percolation
Critical Probability},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {6},
pages = {629--643},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005345},
doi = {10.1017/S0963548302005345},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Wierman02.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-08-26 22:26 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:
