21. A note on random greedy coloring of uniform hypergraphs. Issue 3 (30th May 2014) Authors: Cherkashin, Danila D.; Kozik, Jakub Journal: Random structures & algorithms Issue: Volume 47:Issue 3(2015) Page Start: 407 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
22. A note on the quicksort asymptotics1. Issue 4 (19th November 2013) Authors: Fuchs, Michael Journal: Random structures & algorithms Issue: Volume 46:Issue 4(2015) Page Start: 677 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
23. A note on the random greedy independent set algorithm1. Issue 3 (3rd August 2016) Authors: Bennett, Patrick; Bohman, Tom Journal: Random structures & algorithms Issue: Volume 49:Issue 3(2016) Page Start: 479 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
24. A phase transition in the evolution of bootstrap percolation processes on preferential attachment graphs. Issue 3 (15th December 2017) Authors: Amin Abdullah, Mohammed; Fountoulakis, Nikolaos Journal: Random structures & algorithms Issue: Volume 52:Issue 3(2018) Page Start: 379 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
25. A probabilistic approach to the leader problem in random graphs. Issue 1 (15th October 2020) Authors: Addario‐Berry, Louigi; Bhamidi, Shankar; Sen, Sanchayan Journal: Random structures & algorithms Issue: Volume 58:Issue 1(2021) Page Start: 34 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
26. A product formula for the TASEP on a ring. Issue 2 (6th July 2015) Authors: Aas, Erik; Sjöstrand, Jonas Journal: Random structures & algorithms Issue: Volume 48:Issue 2(2016) Page Start: 247 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
27. A query efficient non‐adaptive long code test with perfect completeness. Issue 2 (8th January 2015) Authors: Tamaki, Suguru; Yoshida, Yuichi Journal: Random structures & algorithms Issue: Volume 47:Issue 2(2015) Page Start: 386 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
28. A query efficient non‐adaptive long code test with perfect completeness1. Issue 2 (8th January 2015) Authors: Tamaki, Suguru; Yoshida, Yuichi Journal: Random structures & algorithms Issue: Volume 47:Issue 2(2015) Page Start: 386 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
29. A query efficient non‐adaptive long code test with perfect completeness1. Issue 4 (3rd May 2014) Authors: Tamaki, Suguru; Yoshida, Yuichi Journal: Random structures & algorithms Issue: Volume 45:Issue 4(2014) Page Start: 703 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
30. A rainbow blow‐up lemma. Issue 4 (20th February 2020) Authors: Glock, Stefan; Joos, Felix Journal: Random structures & algorithms Issue: Volume 56:Issue 4(2020) Page Start: 1031 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗