Skip to search formSkip to main contentSkip to account menu

Combinatorics, Probability and Computing

Combinatorics, Probability and Computing is a peer-reviewed scientific journal in mathematics published by Cambridge University Press. Its editor-in… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2012
2012
Mohar and Vodopivec [Combinatorics, Probability and Computing (2006) 15, 877-893] proved that for every integer $k$ ($k \geq 1… 
2011
2011
L’utilisation des modeles 3D, representes sous forme de maillage, est sans cesse croissante dans de nombreuses applications. Pour… 
2010
2010
We consider the following process for generating large random cubic graphs. Starting with a given graph, repeatedly add edges… 
2010
2010
The line graph G of a directed graph G has a vertex for every edge of G and an edge for every path of length 2 in G. In 1967… 
2009
2009
The well known Erdos-Turan law states that the logarithm of an order of a random permutation is asymptotically normally… 
2008
2008
In this paper we provide a simple formula for the expected time for a random recursive tree to grow to a given height. 
2007
2007
An instance of a size n stable marriage problem involves n men and n women, each individually ranking all members of opposite sex… 
2005
2005
We consider algorithms for group testing problems when nothing is known in advance about the number of defectives. Du and Hwang… 
2003
2003
This special issue is devoted to papers from the meeting on Combinatorics, Probability and Computing, held at the Mathematisches…