431. On the max‐cut of sparse random graphs. Issue 2 (13th November 2017) Authors: Gamarnik, David; Li, Quan Journal: Random structures & algorithms Issue: Volume 52:Issue 2(2018) Page Start: 219 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
432. On the minimax spherical designs. Issue 1 (19th April 2022) Authors: Fu, Weibo; Wang, Guanyang; Yan, Jun Journal: Random structures & algorithms Issue: Volume 62:Issue 1(2023) Page Start: 131 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
433. On the modularity of 3‐regular random graphs and random graphs with given degree sequences. Issue 4 (23rd February 2022) Authors: Lichev, Lyuben; Mitsche, Dieter Journal: Random structures & algorithms Issue: Volume 61:Issue 4(2022) Page Start: 754 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
434. On the normality of giant components. Issue 4 (25th October 2012) Authors: Seierstad, Taral Guldahl Journal: Random structures & algorithms Issue: Volume 43:Issue 4(2013) Page Start: 452 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
435. On the optimality of the uniform random strategy. Issue 2 (10th December 2018) Authors: Kusch, Christopher; Rué, Juanjo; Spiegel, Christoph; Szabó, Tibor Journal: Random structures & algorithms Issue: Volume 55:Issue 2(2019) Page Start: 371 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
436. On the probabilistic degree of OR over the reals. Issue 1 (19th January 2021) Authors: Bhandari, Siddharth; Harsha, Prahladh; Molli, Tulasimohan; Srinivasan, Srikanth Journal: Random structures & algorithms Issue: Volume 59:Issue 1(2021) Page Start: 53 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
437. On the threshold for the Maker‐Breaker H‐game1. Issue 3 (24th December 2015) Authors: Nenadov, Rajko; Steger, Angelika; Stojaković, Miloš Journal: Random structures & algorithms Issue: Volume 49:Issue 3(2016) Page Start: 558 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
438. On the threshold problem for Latin boxes. Issue 4 (30th April 2019) Authors: Luria, Zur; Simkin, Michael Journal: Random structures & algorithms Issue: Volume 55:Issue 4(2019) Page Start: 926 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
439. On the total variation distance between the binomial random graph and the random intersection graph. Issue 4 (4th January 2018) Authors: Kim, Jeong Han; Lee, Sang June; Na, Joohan Journal: Random structures & algorithms Issue: Volume 52:Issue 4(2018) Page Start: 662 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
440. On the upper tail problem for random hypergraphs. Issue 2 (8th November 2020) Authors: Liu, Yang P.; Zhao, Yufei Journal: Random structures & algorithms Issue: Volume 58:Issue 2(2021) Page Start: 179 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗