Skip to Navigation
Skip to Content
 
Home> Combinatorics, Probability and Computing> Vol. 18 Special Issue 1-2

 

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:

567,269 articles from 321 leading journals.

Customize Your Search Toolbar

Combinatorics, Probability and Computing

Search

Social Bookmarking

  • Note: Abstract, PDF and HTML open in a new window

  • Editor(s):
  • Béla Bollobás, DPMMS, Cambridge, UK; University of Memphis, USA

Sort by

Previous Issue Next Issue

Table of Contents - Volume 18 - Special Issue 1-2 (Papers from The 2006 Oberwolfach Meeting on Combinatorics, Probability and Computing)  

Editors: Noga Alon, Béla Bollobás and Ingo Wegener

  Please select Articles below or use Select All, then click the appropriate button above. Select/Deselect All:
 

Front Cover (OFC, IFC) and matter

 
Free access

CPC volume 18 issue 1 Cover and Front matter

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

Back Cover (IBC, OBC) and matter

 
Free access

CPC volume 18 issue 1 Cover and Back matter

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp b1-b6
doi:10.1017/S0963548309009754 (About doi), Published Online by Cambridge University Press 10 Mar 2009
 

Introduction

 
Free access

Introduction

Noga Alon and Bela Bollobas

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

Obituaries

 
Free access

Dedication

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

Paper

 
Free access

Perturbed Identity Matrices Have High Rank: Proof and Applications

NOGA ALON

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

Majority Bootstrap Percolation on the Hypercube

JÓZSEF BALOGH, BÉLA BOLLOBÁS and ROBERT MORRIS

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 17-51
doi:10.1017/S0963548308009322 (About doi), Published Online by Cambridge University Press 15 Aug 2008
Free access

Deciding Relaxed Two-Colourability: A Hardness Jump

R. BERKE and T. SZABÓ

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 53-81
doi:10.1017/S0963548309009663 (About doi), Published Online by Cambridge University Press 10 Mar 2009
Free access

Line-of-Sight Percolation

BÉLA BOLLOBÁS, SVANTE JANSON and OLIVER RIORDAN

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 83-106
doi:10.1017/S0963548308009310 (About doi), Published Online by Cambridge University Press 12 Aug 2008
Free access

Intersecting Families are Essentially Contained in Juntas

IRIT DINUR and EHUD FRIEDGUT

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 107-122
doi:10.1017/S0963548308009309 (About doi), Published Online by Cambridge University Press 29 Aug 2008
Free access

Deterministic Random Walks on the Two-Dimensional Grid

BENJAMIN DOERR and TOBIAS FRIEDRICH

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 123-144
doi:10.1017/S0963548308009589 (About doi), Published Online by Cambridge University Press 24 Oct 2008
Free access

Line-of-Sight Networks

ALAN FRIEZE, JON KLEINBERG, R. RAVI and WARREN DEBANY

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 145-163
doi:10.1017/S0963548308009334 (About doi), Published Online by Cambridge University Press 12 Aug 2008
Free access

The Ramsey Number for 3-Uniform Tight Hypergraph Cycles

P. E. HAXELL, T. ŁUCZAK, Y. PENG, V. RÖDL, A. RUCIŃSKI and J. SKOKAN

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 165-203
doi:10.1017/S096354830800967X (About doi), Published Online by Cambridge University Press 04 Feb 2009
Free access

The Probability That a Random Multigraph is Simple

SVANTE JANSON

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 205-225
doi:10.1017/S0963548308009644 (About doi), Published Online by Cambridge University Press 15 Jan 2009
Free access

Learning Complexity vs Communication Complexity

NATI LINIAL and ADI SHRAIBMAN

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 227-245
doi:10.1017/S0963548308009656 (About doi), Published Online by Cambridge University Press 15 Jan 2009
Free access

Constrained Ramsey Numbers

PO-SHEN LOH and BENNY SUDAKOV

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

Upper Bounds for Online Ramsey Games in Random Graphs

MARTIN MARCINISZYN, RETO SPÖHEL and ANGELIKA STEGER

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 259-270
doi:10.1017/S0963548308009620 (About doi), Published Online by Cambridge University Press 21 Jan 2009
Free access

Online Ramsey Games in Random Graphs

MARTIN MARCINISZYN, RETO SPÖHEL and ANGELIKA STEGER

Combinatorics, Probability and Computing, Volume 18, Special Issue 1-2, March 2009, pp 271-300
doi:10.1017/S0963548308009632 (About doi), Published Online by Cambridge University Press 21 Jan 2009
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press