651. The threshold for d‐collapsibility in random complexes*. Issue 2 (27th March 2015) Authors: Aronshtam, L.; Linial, N. Journal: Random structures & algorithms Issue: Volume 48:Issue 2(2016) Page Start: 260 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
652. The thresholds for diameter 2 in random Cayley graphs1. Issue 2 (5th March 2013) Authors: Christofides, Demetres; Markström, Klas Journal: Random structures & algorithms Issue: Volume 45:Issue 2(2014) Page Start: 218 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
653. The time of bootstrap percolation with dense initial sets for all thresholds1. Issue 1 (7th April 2014) Authors: Bollobas, Béla; Smith, Paul; Uzzell, Andrew J. Journal: Random structures & algorithms Issue: Volume 47:Issue 1(2015) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
654. The time of graph bootstrap percolation. Issue 1 (26th August 2016) Authors: Gunderson, Karen; Koch, Sebastian; Przykucki, Michał Journal: Random structures & algorithms Issue: Volume 51:Issue 1(2017) Page Start: 143 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
655. The writhe of permutations and random framed knots1. Issue 1 (17th November 2016) Authors: Even‐Zohar, Chaim Journal: Random structures & algorithms Issue: Volume 51:Issue 1(2017) Page Start: 121 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
656. Three‐wise independent random walks can be slightly unbounded. Issue 3 (3rd January 2022) Authors: Narayanan, Shyam Journal: Random structures & algorithms Issue: Volume 61:Issue 3(2022) Page Start: 573 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
657. Tight bounds for popping algorithms. Issue 2 (6th May 2020) Authors: Guo, Heng; He, Kun Journal: Random structures & algorithms Issue: Volume 57:Issue 2(2020) Page Start: 371 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
658. Tight bounds on the expected number of holes in random point sets. Issue 1 (21st April 2022) Authors: Balko, Martin; Scheucher, Manfred; Valtr, Pavel Journal: Random structures & algorithms Issue: Volume 62:Issue 1(2023) Page Start: 29 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
659. Tight Hamilton cycles in random hypergraphs. Issue 3 (16th October 2013) Authors: Allen, Peter; Böttcher, Julia; Kohayakawa, Yoshiharu; Person, Yury Journal: Random structures & algorithms Issue: Volume 46:Issue 3(2015) Page Start: 446 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
660. Tight Hamilton cycles in random uniform hypergraphs. Issue 3 (5th February 2012) Authors: Dudek, Andrzej; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 42:Issue 3(2013) Page Start: 374 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗