-
- Get access
- Contains open access
-
- ISSN: 0963-5483 (Print), 1469-2163 (Online)
- Editor: Professor Béla Bollobás DPMMS|Centre for Mathematical Sciences|University of Cambridge|Wilberforce Road|Cambridge CB3 0WB|UK
- Editorial board
Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.
Recently published articles
Mathematics – Cambridge Core Blog
-
A Q&A with the course leader of Control Engineering
- 10 November 2021,
- What are your current research interests? I have a long-term interest in ‘fault-tolerant control’, namely if the system you are controlling develops a fault,...
-
Global minimisers for anisotropic attractive-repulsive interactions
- 14 May 2021,
- Starting from the variational formulation of the Fokker-Planck equation provided by Jordan, Kinderlehrer and Otto in 1998, many evolution partial differential...
-
Approximate solutions to one-phase Stefan-like problems with space-dependent latent heat
- 10 February 2021,
- Stefan problems are a special type of partial differential boundary value problems, introduced around 1890 by the Slovenian physicist Josef Stefan [1].…...
Tweets by @cambUP_maths