Combinatorics, Probability and Computing
Scientific journal
Combinatorics, Probability and Computing is a peer-reviewed scientific journal in mathematics published by Cambridge University Press. Its editor-in-chief is Béla Bollobás (DPMMS and University of Memphis).
History
The journal was established by Bollobás in 1992. Fields Medalist Timothy Gowers calls it "a personal favourite" among combinatorics journals and writes that it "maintains a high standard".
Content
The journal covers combinatorics, probability theory, and theoretical computer science. Currently, it publishes six issues annually. As with other journals from the same publisher, it follows a hybrid green/gold open access policy, in which authors may either place copies of their papers in an institutional repository after a six-month embargo period, or pay an open access charge to make their papers free to read on the journal's website.
Abstracting and indexing
The journal is abstracted and indexed in:
According to the Journal Citation Reports, the journal has a 2014 impact factor of 0.623. Since 2007, it has been ranked by SCImago Journal Rank as a first-quartile journal in four areas: applied mathematics, computational theory, statistics and probability, and theoretical computer science.
This brief starts where responsible research should: with the source description of “Combinatorics, Probability and Computing” as scientific journal. Everything that follows is an evidence route, not borrowed authority.
Why this record matters
The subject matters to the science & nature register because the source frames it as scientific journal. Its deeper value depends on whether names, dates, institutions and citations support that framing.
The date and method of observation matter as much as the stated conclusion, especially where classification or consensus has changed. The source revision retrieved here is dated May 1, 2024. The linked authority identifier is Q15759553. 2 of 2 selected statements include explicit references; 0 carry qualifiers and 0 use preferred rank. The first chronological checks are 1992, 2014 and 2007.
A general summary may omit uncertainty, sample limits or methodological disagreement that is explicit in the technical record. The source lead contains qualifying language; that uncertainty should survive quotation, summary and reuse. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Check terminology, classification and the date of the cited evidence. Scientific names and technical consensus can change while older records retain historical value.
- Current terminology
- Classification context
- Finding cited technical literature
Primary datasets, specimen catalogues, standards bodies and the most recent peer-reviewed literature.
Three-step research path
- Establish the record: confirm the title “Combinatorics, Probability and Computing”, its source revision and the description used here.
- Expand the search: follow Combinatorics, Probability and Computing primary sources, Combinatorics, Probability and Computing archive and Combinatorics research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Combinatorics, Probability and Computing”?
- Which observation, specimen, dataset or publication supports the account?
- Is the terminology current, historical or disputed?
Search terms from this dossier
This entry incorporates text from “Combinatorics, Probability and Computing” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.