Skip to Navigation
Skip to Content
 
Home> Combinatorics, Probability and Computing> Top 10 Most Read Articles

 

Log In

Browse Journals

Special Sales

Cambridge Journals Digital Archive

Click here for details about our archive digitisation project. more details

2009 Journals Catalogue

Click here to download a PDF of our latest catalogue; a comprehensive guide to all of our journals. more details

CJO Now Includes:

568,935 articles from 321 leading journals.

Customize Your Search Toolbar

Top 10 Most-Read Articles


These are the top 10 most-read articles for this title for the previous 12 months. Most-read rankings are updated on a monthly basis.

  • Subscription Access
  • Free Access
  • Trial Access
  • Full Text HTML as well as PDF Articles Available
  • Note: Abstract, PDF and HTML open in a new window
  Article Description Save / Export / View citation Add to Basket
  Select all
 

Maximum Statistics of N Random Variables Distributed by the Negative Binomial Distribution

PETER J. GRABNER and HELMUT PRODINGER

Combinatorics, Probability and Computing, Volume 6, Issue 02, Jun 1997, pp 179-183
doi: 10.1017/S0963548397002939 (About doi),
Full Text HTML as well as PDF Articles Available

Finding Large Independent Sets in Polynomial Expected Time

AMIN COJA-OGHLAN

Combinatorics, Probability and Computing, Volume 15, Issue 05, Sep 2006, pp 731-751
doi: 10.1017/S0963548306007553 (About doi), Published online by Cambridge University Press 31 Jul 2006
 

The Largest Eigenvalue of Sparse Random Graphs

MICHAEL KRIVELEVICH and BENNY SUDAKOV

Combinatorics, Probability and Computing, Volume 12, Issue 01, Jan 2003, pp 61-72
doi: 10.1017/S0963548302005424 (About doi), Published online by Cambridge University Press 28 Jan 2003
Full Text HTML as well as PDF Articles Available

Strong Refutation Heuristics for Random k-SAT

AMIN COJA-OGHLAN, ANDREAS GOERDT and ANDRÉ LANKA

Combinatorics, Probability and Computing, Volume 16, Issue 01, Jan 2007, pp 5-28
doi: 10.1017/S096354830600784X (About doi), Published online by Cambridge University Press 14 Aug 2006
Subscription Access   

CPC volume 18 issue 1 Cover and Front matter

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, Mar 2009, pp f1-f2
doi: 10.1017/S0963548309009729 (About doi), Published online by Cambridge University Press 10 Mar 2009
 
 

Enumerating Contingency Tables via Random Permanents

ALEXANDER BARVINOK

Combinatorics, Probability and Computing, Volume 17, Issue 01, Jan 2008, pp 1-19
doi: 10.1017/S0963548307008668 (About doi), Published online by Cambridge University Press 27 Jul 2007
Subscription Access   

Constrained Ramsey Numbers

PO-SHEN LOH and BENNY SUDAKOV

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, Mar 2009, pp 247-258
doi: 10.1017/S0963548307008875 (About doi), Published online by Cambridge University Press 10 Dec 2007
 
 

The Distribution of Patterns in Random Trees

FRÉDÉRIC CHYZAK, MICHAEL DRMOTA, THOMAS KLAUSNER and GERARD KOK

Combinatorics, Probability and Computing, Volume 17, Issue 01, Jan 2008, pp 21-59
doi: 10.1017/S0963548307008425 (About doi), Published online by Cambridge University Press 28 Sep 2007
Subscription Access   

Perturbed Identity Matrices Have High Rank: Proof and Applications

NOGA ALON

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, Mar 2009, pp 3-15
doi: 10.1017/S0963548307008917 (About doi), Published online by Cambridge University Press 16 Jan 2008
 
Subscription Access   

Learning Complexity vs Communication Complexity

NATI LINIAL and ADI SHRAIBMAN

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, Mar 2009, pp 227-245
doi: 10.1017/S0963548308009656 (About doi), Published online by Cambridge University Press 15 Jan 2009
 
  Select all
  Article Description Save / Export / View citation Add to Basket

Back to Journal Homepage
Cambridge University Press