default search action
Search dblp for Publications
export results for "toc:db/journals/cpc/cpc14.bht:"
@article{DBLP:journals/cpc/Aigner05, author = {Martin Aigner}, title = {The {\textdollar}k{\textdollar}-Equal Problem}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {17--24}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006704}, doi = {10.1017/S0963548304006704}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Aigner05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Bloznelis05, author = {Mindaugas Bloznelis}, title = {Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {249--268}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006364}, doi = {10.1017/S0963548304006364}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Bloznelis05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/BodeGH05, author = {Jens{-}P. Bode and Hans{-}Dietrich O. F. Gronau and Heiko Harborth}, title = {Some Ramsey Schur Numbers}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {25--30}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006595}, doi = {10.1017/S0963548304006595}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/BodeGH05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/ChanL05, author = {Onn Chan and Tao{-}Kai Lam}, title = {Lifting Markov Chains to Random Walks on Groups}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {269--273}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006352}, doi = {10.1017/S0963548304006352}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/ChanL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Coja-Oghlan05, author = {Amin Coja{-}Oghlan}, title = {The Lov{\'{a}}sz Number of Random Graphs}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {439--465}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006826}, doi = {10.1017/S0963548305006826}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Coja-Oghlan05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/DezaD05, author = {Michel Deza and Mathieu Dutour}, title = {Zigzag Structures of Simple Two-Faced Polyhedra}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {31--57}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006583}, doi = {10.1017/S0963548304006583}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/DezaD05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Diestel05, author = {Reinhard Diestel}, title = {The Cycle Space of an Infinite Graph}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {59--79}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006686}, doi = {10.1017/S0963548304006686}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Diestel05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Edwards05, author = {Keith Edwards}, title = {Detachments of Complete Graphs}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {275--310}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006558}, doi = {10.1017/S0963548304006558}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Edwards05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/ElekS05, author = {G{\'{a}}bor Elek and Vera T. S{\'{o}}s}, title = {Paradoxical Decompositions and Growth Conditions}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {81--105}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006728}, doi = {10.1017/S0963548304006728}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/ElekS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FerraraKR05, author = {Mike Ferrara and Yoshiharu Kohayakawa and Vojtech R{\"{o}}dl}, title = {Distance Graphs on the Integers}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {107--131}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006637}, doi = {10.1017/S0963548304006637}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FerraraKR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FurediGS05, author = {Zolt{\'{a}}n F{\"{u}}redi and Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and G{\'{a}}bor Simonyi}, title = {Connected matchings and Hadwiger's conjecture}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {435--438}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006759}, doi = {10.1017/S0963548305006759}, timestamp = {Sun, 19 Jan 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FurediGS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FurediS05, author = {Zolt{\'{a}}n F{\"{u}}redi and Mikl{\'{o}}s Simonovits}, title = {Triple Systems Not Containing a Fano Configuration}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {467--484}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006784}, doi = {10.1017/S0963548305006784}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/FurediS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/HamidouneQ05, author = {Yahya Ould Hamidoune and Domingo Quiroz}, title = {On Subsequence Weighted Products}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {485--489}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006814}, doi = {10.1017/S0963548305006814}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/HamidouneQ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/HammerZ05, author = {Peter L. Hammer and Igor E. Zverovich}, title = {Construction of a Maximum Stable Set with {\textdollar}k{\textdollar}-Extensions}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {311--318}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006376}, doi = {10.1017/S0963548304006376}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/HammerZ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Hegyvari05, author = {Norbert Hegyv{\'{a}}ri}, title = {On Intersecting Properties of Partitions of Integers}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {319--323}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006431}, doi = {10.1017/S0963548304006431}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Hegyvari05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Kriesell05, author = {Matthias Kriesell}, title = {Triangle Density and Contractibility}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {133--146}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006601}, doi = {10.1017/S0963548304006601}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Kriesell05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KuhnO05, author = {Daniela K{\"{u}}hn and Deryk Osthus}, title = {Packings in Dense Regular Graphs}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {325--337}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006406}, doi = {10.1017/S0963548304006406}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/KuhnO05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Lefmann05, author = {Hanno Lefmann}, title = {Sparse Parity-Check Matrices over {\textdollar}\{GF(q)\}{\textdollar}}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {147--169}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006625}, doi = {10.1017/S0963548304006625}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Lefmann05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Lyons05, author = {Russell Lyons}, title = {Asymptotic Enumeration of Spanning Trees}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {491--522}, year = {2005}, url = {https://doi.org/10.1017/S096354830500684X}, doi = {10.1017/S096354830500684X}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/Lyons05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/MadrasW05, author = {Neal Madras and C. Chris Wu}, title = {Self-Avoiding Walks on Hyperbolic Graphs}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {523--548}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006772}, doi = {10.1017/S0963548305006772}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/MadrasW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/MayW05, author = {William D. May and John C. Wierman}, title = {Using Symmetry to Improve Percolation Threshold Bounds}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {549--566}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006802}, doi = {10.1017/S0963548305006802}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/MayW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Mayhew05, author = {Dillon Mayhew}, title = {Inequivalent Representations of Bias Matroids}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {567--583}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006838}, doi = {10.1017/S0963548305006838}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Mayhew05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/McMullen05, author = {Peter McMullen}, title = {Convex Polytopes, by Branko Grunbaum, second edition (first edition {(1967)} written with the cooperation of V. L. Klee, M. Perles and G. C. Shephard}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {623--626}, year = {2005}, url = {https://doi.org/10.1017/S0963548305226998}, doi = {10.1017/S0963548305226998}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/McMullen05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Mori05, author = {Tam{\'{a}}s F. M{\'{o}}ri}, title = {The Maximum Degree of the Barabasi-Albert Random Tree}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {339--348}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006133}, doi = {10.1017/S0963548304006133}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Mori05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Nesetril05, author = {Jaroslav Nesetril}, title = {Ramsey Classes and Homogeneous Structures}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {171--189}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006716}, doi = {10.1017/S0963548304006716}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/Nesetril05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Nikiforov05, author = {Vladimir Nikiforov}, title = {The Cycle-Complete Graph Ramsey Numbers}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {349--370}, year = {2005}, url = {https://doi.org/10.1017/S096354830400642X}, doi = {10.1017/S096354830400642X}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/Nikiforov05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/PengRS05, author = {Yuejian Peng and Vojtech R{\"{o}}dl and Jozef Skokan}, title = {Counting Small Cliques in 3-uniform Hypergraphs}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {371--413}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006546}, doi = {10.1017/S0963548304006546}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/PengRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Promel05, author = {Hans J{\"{u}}rgen Pr{\"{o}}mel}, title = {Special Issue in Memory of Walter Deuber}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {1}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006662}, doi = {10.1017/S0963548304006662}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Promel05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Promel05a, author = {Hans J{\"{u}}rgen Pr{\"{o}}mel}, title = {Complete Disorder is Impossible: The Mathematical Work of Walter Deuber}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {3--16}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006674}, doi = {10.1017/S0963548304006674}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Promel05a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/RodlT05, author = {Vojtech R{\"{o}}dl and Lubos Thoma}, title = {On Cover Graphs and Dependent Arcs in Acyclic Orientations}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {585--617}, year = {2005}, url = {https://doi.org/10.1017/S0963548305006760}, doi = {10.1017/S0963548305006760}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/RodlT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/SchlaghoffT05, author = {Jens Schlaghoff and Eberhard Triesch}, title = {Improved Results for Competitive Group Testing}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {191--202}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006649}, doi = {10.1017/S0963548304006649}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/SchlaghoffT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Specker05, author = {Ernst Specker}, title = {Modular Counting and Substitution of Structures}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {203--210}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006698}, doi = {10.1017/S0963548304006698}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Specker05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Steger05, author = {Angelika Steger}, title = {On the Evolution of Triangle-Free Graphs}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {211--224}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006613}, doi = {10.1017/S0963548304006613}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Steger05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Steif05, author = {Jeffrey E. Steif}, title = {Probability on Discrete Structures, edited by H. Kesten}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {4}, pages = {619--623}, year = {2005}, url = {https://doi.org/10.1017/S0963548305216991}, doi = {10.1017/S0963548305216991}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Steif05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/WegenerW05, author = {Ingo Wegener and Carsten Witt}, title = {On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {1-2}, pages = {225--247}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006650}, doi = {10.1017/S0963548304006650}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/WegenerW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/Woess05, author = {Wolfgang Woess}, title = {Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions}, journal = {Comb. Probab. Comput.}, volume = {14}, number = {3}, pages = {415--433}, year = {2005}, url = {https://doi.org/10.1017/S0963548304006443}, doi = {10.1017/S0963548304006443}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/Woess05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.