1. On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs. Issue 1 (27th February 2020) Authors: Johansson, Tony Journal: Random structures & algorithms Issue: Volume 57:Issue 1(2020) Page Start: 132 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. On Hamilton cycles in Erdős‐Rényi subgraphsof large graphs. Issue 1 (27th February 2020) Authors: Johansson, Tony Journal: Random structures & algorithms Issue: Volume 57:Issue 1(2020) Page Start: 132 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. On random k‐out subgraphs of large graphs1. Issue 2 (30th March 2016) Authors: Frieze, Alan; Johansson, Tony Journal: Random structures & algorithms Issue: Volume 50:Issue 2(2017) Page Start: 143 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. On the insertion time of random walk cuckoo hashing. Issue 4 (21st September 2018) Authors: Frieze, Alan; Johansson, Tony Journal: Random structures & algorithms Issue: Volume 54:Issue 4(2019) Page Start: 721 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗