231. Graph limits of random graphs from a subset of connected k‐trees. Issue 1 (11th September 2018) Authors: Drmota, Michael; Jin, Emma Yu; Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 55:Issue 1(2019) Page Start: 125 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
232. Graphical balanced allocations and the (1 + β)‐choice process. Issue 4 (22nd July 2014) Authors: Peres, Yuval; Talwar, Kunal; Wieder, Udi Journal: Random structures & algorithms Issue: Volume 47:Issue 4(2015) Page Start: 760 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
233. Graphon convergence of random cographs. Issue 3 (28th February 2021) Authors: Stufler, Benedikt Journal: Random structures & algorithms Issue: Volume 59:Issue 3(2021) Page Start: 464 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
234. Greek letters in random staircase tableaux. Issue 1 (18th February 2012) Authors: Dasse–Hartaut, Sandrine; Hitczenko, Paweł Journal: Random structures & algorithms Issue: Volume 42:Issue 1(2013) Page Start: 73 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
235. Group representations that resist random sampling. Issue 3 (9th June 2014) Authors: Lovett, Shachar; Moore, Cristopher; Russell, Alexander Journal: Random structures & algorithms Issue: Volume 47:Issue 3(2015) Page Start: 605 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
236. Hamilton cycles in quasirandom hypergraphs1. Issue 2 (26th February 2016) Authors: Lenz, John; Mubayi, Dhruv; Mycroft, Richard Journal: Random structures & algorithms Issue: Volume 49:Issue 2(2016) Page Start: 363 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
237. Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis. Issue 4 (16th October 2020) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 865 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
238. Hamilton transversals in random Latin squares. Issue 2 (14th June 2022) Authors: Gould, Stephen; Kelly, Tom Journal: Random structures & algorithms Issue: Volume 62:Issue 2(2023) Page Start: 450 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
239. Harnessing the Bethe free energy1. Issue 4 (21st October 2016) Authors: Bapst, Victor; Coja‐Oghlan, Amin Journal: Random structures & algorithms Issue: Volume 49:Issue 4(2016) Page Start: 694 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
240. Hats, auctions and derandomization. Issue 3 (27th June 2013) Authors: Ben‐Zwi, Oren; Newman, Ilan; Wolfovitz, Guy Journal: Random structures & algorithms Issue: Volume 46:Issue 3(2015) Page Start: 478 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗