default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 23
Volume 23, Number 1, January 2014
- Eric Blais, Amit Weinstein, Yuichi Yoshida:
Semi-Strong Colouring of Intersecting Hypergraphs. 1-7 - David Conlon
, Jacob Fox, Benny Sudakov:
Short Proofs of Some Extremal Results. 8-28 - Yael Dekel, Ori Gurel-Gurevich, Yuval Peres:
Finding Hidden Cliques in Linear Time with High Probability. 29-49 - Michael Drmota, Anna S. Lladó:
Almost Every Tree With m Edges Decomposes K 2m, 2m . 50-65 - Jacob Fox, János Pach:
Applications of a New Separator Theorem for String Graphs. 66-74 - Rani Hod, Alon Naor:
Component Games on Regular Graphs. 75-89 - Tomás Kaiser, Ross J. Kang:
The Distance-t Chromatic Index of Graphs. 90-101 - Teeradej Kittipassorn, Bhargav P. Narayanan:
A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs. 102-115 - Yuri Lima, Carlos Gustavo Moreira:
A Marstrand Theorem for Subsets of Integers. 116-134 - Jirí Matousek:
Near-Optimal Separators in String Graphs. 135-139 - Robin Pemantle, Yuval Peres:
Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures. 140-160
Volume 23, Number 2, March 2014
- Mahshid Atapour, Neal Madras:
Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations. 161-200 - Olivier Bernardi, Rosena R. X. Du, Alejandro H. Morales, Richard P. Stanley:
Separation Probabilities for Products of Permutations. 201-222 - Eden Chlamtac, Ishay Haviv:
Linear Index Coding via Semidefinite Programming. 223-247 - Daniele Mundici:
Invariant Measure Under the Affine Group Over. 248-268 - Tal Orenshtein, Igor Shinkar:
Greedy Random Walk. 269-289 - David Sivakoff:
Site Percolation on the d-Dimensional Hamming Torus. 290-315
Volume 23, Number 3, May 2014
- Daniel Ahlberg:
Partially Observed Boolean Sequences and Noise Sensitivity. 317-330 - Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
Local Limit Theorems for the Giant Component of Random Hypergraphs. 331-366 - Michael Behrisch, Amin Coja-Oghlan, Mihyun Kang:
The Asymptotic Number of Connected d-Uniform Hypergraphs. 367-385 - Steffen Dereich, Marcel Ortgiese:
Robust Analysis of Preferential Attachment Models with Fitness. 386-411 - Pu Gao:
The First k-Regular Subgraph is Large. 412-433 - Roman Glebov, Tibor Szabó, Gábor Tardos:
Conflict-Free Colouring of Graphs. 434-448 - Peter Hegarty, Dmitry Zhelezov:
On the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices. 449-459 - Perla Sousi, Peter Winkler:
Mixing Times and Moving Targets. 460-476
Volume 23, Number 4, July 2014
- Louigi Addario-Berry, Svante Janson, Colin McDiarmid:
On the Spread of Random Graphs. 477-504 - Shankar Bhamidi, Amarjit Budhiraja, Xuan Wang:
Bounded-Size Rules: The Barely Subcritical Regime. 505-538 - Jeff Cooper, Kunal Dutta, Dhruv Mubayi:
Counting Independent Sets in Hypergraphs. 539-550 - Louis Esperet, Gwenaël Joret:
Colouring Planar Graphs With Three Colours and No Large Monochromatic Components. 551-570 - Agelos Georgakopoulos, Peter Winkler:
New Bounds for Edge-Cover by Random Walk. 571-584 - Ravi Montenegro:
Intersection Conductance and Canonical Alternating Paths: Methods for General Finite Markov Chains. 585-606 - Jozef Skokan, Maya Jakobine Stein:
Cycles Are Strongly Ramsey-Unsaturated. 607-630
Volume 23, Number 5, September 2014
- Robert Sedgewick:
In Memory of Philippe Flajolet. 631-634
- Louigi Addario-Berry, Laura Eslava:
Hitting Time Theorems for Random Matrices. 635-669 - Margaret Archibald, Arnold Knopfmacher:
The Largest Missing Value in a Sample of Geometric Random Variables. 670-685 - Edward A. Bender, Zhicheng Gao:
Part Sizes of Smooth Supercritical Compositional Structures. 686-716 - Miklós Bóna:
A New Upper Bound for 1324-Avoiding Permutations. 717-724 - Mireille Bousquet-Mélou:
On the Importance Sampling of Self-Avoiding Walks. 725-748 - Mireille Bousquet-Mélou, Kerstin Weller:
Asymptotic Properties of Some Minor-Closed Classes of Graphs. 749-795 - Luc Devroye, Nicolas Fraiman:
The Random Connection Model on the Torus. 796-804 - James Allen Fill, Jason Matterer:
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find. 805-828 - Philippe Jacquet, Charles Knessl, Wojciech Szpankowski:
A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence. 829-841 - Cedric Loi, Paul-Henry Cournède, Jean Françon:
A Symbolic Method to Analyse Patterns in Plant Structure. 842-860 - Stephen Melczer, Marni Mishna:
Singularity Analysis Via the Iterated Kernel Method. 861-888
Volume 23, Number 6, November 2014
- Tatjana Bakshajeva, Eugenijus Manstavicius:
On Statistics of Permutations Chosen From the Ewens Distribution. 889-913 - J. Bouttier, Emmanuel Guitter:
On Irreducible Maps and Slices. 914-972 - Francis Comets, François Delarue, René Schott:
Information Transmission under Random Emission Constraints. 973-1009 - Iulia Dahmer, Götz Kersting, Anton Wakolbinger:
The Total External Branch Length of Beta-Coalescents. 1010-1027 - Martin Fürer, Shiva Prasad Kasiviswanathan:
Approximately Counting Embeddings into Random Graphs. 1028-1056 - Peter J. Grabner, Arnold Knopfmacher, Stephan G. Wagner:
A General Asymptotic Scheme for the Analysis of Partition Statistics. 1057-1086 - Clemens Heuberger, Sara Kropf:
Analysis of the Binary Asymmetric Joint Sparse Form. 1087-1113 - Pawel Hitczenko, Svante Janson:
Weighted Random Staircase Tableaux. 1114-1147 - Margarete Knape, Ralph Neininger:
Pólya Urns Via the Contraction Method. 1148-1186
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.
last updated on 2024-10-31 20:19 CET 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:
