Search results
The page ""Combinatorics, Probability and Computing" journal" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
- Combinatorics, Probability and Computing is a peer-reviewed scientific journal in mathematics published by Cambridge University Press. Its editor-in-chief...6 KB (379 words) - 19:25, 1 May 2024
- of Probability Bernoulli Brazilian Journal of Probability and Statistics Combinatorics, Probability and Computing Communications on Stochastic Analysis...2 KB (183 words) - 16:57, 14 March 2022
- Bowditch, Brian H. (2007), "The angel game in the plane", Combinatorics, Probability and Computing, 16 (3): 345–362, doi:10.1017/S0963548306008297, MR 2312431...17 KB (2,069 words) - 11:20, 18 July 2024
Edwards, Keith (2005), "Detachments of complete graphs", Combinatorics, Probability and Computing, 14 (3): 275–310, doi:10.1017/S0963548304006558 (inactive...4 KB (534 words) - 06:59, 2 November 2024
Brightwell concerning random walks on product graphs". Combinatorics, Probability and Computing. 7 (4): 397–401. Häggström, Olle (2003). "Probability on...6 KB (649 words) - 20:00, 5 November 2024- Outline of combinatorics (section Journals)Australasian Journal of Combinatorics Bulletin of the Institute of Combinatorics and Its Applications Combinatorica Combinatorics, Probability and Computing Computational...9 KB (683 words) - 08:34, 14 July 2024
- M. R. (2011). Many random walks are faster than one. Combinatorics, Probability and Computing, 20(4), 481–502. Avin, C., Koucký, M., & Lotker, Z. (2008...8 KB (741 words) - 07:25, 4 November 2024
- (1999), "Total path length for random recursive trees", Combinatorics, Probability and Computing, 8 (4): 317–333, doi:10.1017/S0963548399003855, MR 1723646...3 KB (483 words) - 14:15, 9 January 2024
- (2002). "Distinct sums modulo n and tree embeddings". Combinatorics, Probability and Computing. 11 (1): 35–42. doi:10.1017/S0963548301004874. S2CID 26848303...17 KB (1,693 words) - 05:46, 13 September 2023
- Logarithmic Combinatorial Structures: A Probabilistic Approach", Combinatorics, Probability and Computing, 13 (6): 916–917, doi:10.1017/S0963548304226566, S2CID 122978587...6 KB (468 words) - 18:29, 29 October 2024
- "Sampling regular graphs and a peer-to-peer network", Combinatorics, Probability and Computing, 16 (4): 557–593, CiteSeerX 10.1.1.181.597, doi:10.1017/S0963548306007978...3 KB (377 words) - 20:51, 14 April 2022
- Jacob; Li, Ray (2020), "On Ramsey numbers of hedgehogs", Combinatorics, Probability and Computing, 29 (1): 101–112, arXiv:1902.10221, doi:10.1017/s0963548319000312...2 KB (204 words) - 23:39, 5 November 2020
- Different Realizations of a Graphical Degree Sequence" (PDF). Combinatorics, Probability and Computing. 22 (3): 366–383. doi:10.1017/S0963548313000096. S2CID 5643528...5 KB (611 words) - 16:24, 14 August 2024
Zero-Free Interval for Chromatic Polynomials of Graphs", Combinatorics, Probability and Computing, 2 (3): 325–336, doi:10.1017/S0963548300000705, S2CID 39978844...28 KB (4,252 words) - 18:38, 19 October 2024- theorem for string graphs and its applications" (PDF), Combinatorics, Probability and Computing, 19 (3): 371, doi:10.1017/s0963548309990459, S2CID 5705145...9 KB (982 words) - 04:02, 6 December 2023
- separator theorem for string graphs and its applications", Combinatorics, Probability and Computing, 19 (3): 371, doi:10.1017/s0963548309990459, S2CID 5705145...10 KB (1,082 words) - 20:07, 25 September 2024
- Systems Journal of the Brazilian Computer Society Cluster Computing Code Words Cognitive Systems Research Combinatorica Combinatorics, Probability and Computing...11 KB (1,012 words) - 21:53, 30 June 2024
P. E. (2004-11-01). "On the Strong Chromatic Number". Combinatorics, Probability and Computing. 13 (6): 857–865. doi:10.1017/S0963548304006157. ISSN 0963-5483...5 KB (581 words) - 05:36, 29 June 2023- Wormald (1999). "Generating random regular graphs quickly". Combinatorics, Probability and Computing. 8 (4). Cambridge Univ Press: 377–396. doi:10.1017/S0963548399003867...5 KB (412 words) - 16:14, 25 August 2023
(1999), "On the structure of dense triangle-free graphs", Combinatorics, Probability and Computing, 8 (3): 237–245, doi:10.1017/S0963548399003831, MR 1702550...8 KB (980 words) - 07:15, 6 December 2023
