51. An algorithmic hypergraph regularity lemma. Issue 2 (7th December 2017) Authors: Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias Journal: Random structures & algorithms Issue: Volume 52:Issue 2(2018) Page Start: 301 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
52. An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three1. Issue 1 (10th April 2014) Authors: Frieze, Alan; Haber, Simi Journal: Random structures & algorithms Issue: Volume 47:Issue 1(2015) Page Start: 73 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
53. An asymmetric random Rado theorem for single equations: The 0‐statement. Issue 4 (21st August 2021) Authors: Hancock, Robert; Treglown, Andrew Journal: Random structures & algorithms Issue: Volume 60:Issue 4(2022) Page Start: 529 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
54. An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Issue 1 (6th December 2018) Authors: Graaf, Maurits; Boucherie, Richard J.; Hurink, Johann L.; van Ommeren, Jan‐Kees Journal: Random structures & algorithms Issue: Volume 55:Issue 1(2019) Page Start: 89 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
55. An extension of the Erdős‐Tetali theorem. Issue 1 (19th November 2018) Authors: Táfula, Christian Journal: Random structures & algorithms Issue: Volume 55:Issue 1(2019) Page Start: 173 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
56. An improved upper bound on the density of universal random graphs2. Issue 2 (22nd May 2014) Authors: Dellamonica, Domingos; Kohayakawa, Yoshiharu; Rödl, Vojtěch; Ruciński, Andrzej Journal: Random structures & algorithms Issue: Volume 46:Issue 2(2015) Page Start: 274 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
57. An optimal (ϵ, δ)‐randomized approximation scheme for the mean of random variables with bounded relative variance. Issue 2 (15th January 2019) Authors: Huber, Mark Journal: Random structures & algorithms Issue: Volume 55:Issue 2(2019) Page Start: 356 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
58. An upper bound on the number of Steiner triple systems. Issue 4 (5th March 2013) Authors: Linial, Nathan; Luria, Zur Journal: Random structures & algorithms Issue: Volume 43:Issue 4(2013) Page Start: 399 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
59. Analytic combinatorics of connected graphs. Issue 2 (25th January 2019) Authors: Panafieu, Élie Journal: Random structures & algorithms Issue: Volume 55:Issue 2(2019) Page Start: 427 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
60. Ancestors and descendants in evolving k‐tree models1. Issue 4 (28th November 2012) Authors: Panholzer, Alois; Seitz, Georg Journal: Random structures & algorithms Issue: Volume 44:Issue 4(2014) Page Start: 465 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗