1. A Harris‐Kesten theorem for confetti percolation1. Issue 2 (4th August 2014) Authors: Hirsch, Christian Journal: Random structures & algorithms Issue: Volume 47:Issue 2(2015) Page Start: 361 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A note on near‐optimal coloring of shift hypergraphs1. Issue 1 (6th August 2014) Authors: Harris, David G.; Srinivasan, Aravind Journal: Random structures & algorithms Issue: Volume 48:Issue 1(2016) Page Start: 53 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. 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) ↗
4. 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) ↗
5. A sprouting tree model for random boolean functions1. Issue 4 (31st July 2014) Authors: Chauvin, Brigitte; Gardy, Danièle; Mailler, Cécile Journal: Random structures & algorithms Issue: Volume 47:Issue 4(2015) Page Start: 635 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. A tail bound for read‐k families of functions1. Issue 1 (6th March 2014) Authors: Gavinsky, Dmitry; Lovett, Shachar; Saks, Michael; Srinivasan, Srikanth Journal: Random structures & algorithms Issue: Volume 47:Issue 1(2015) Page Start: 99 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. 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) ↗
8. 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) ↗
9. Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton–Watson trees1. Issue 1 (13th August 2014) Authors: Janson, Svante Journal: Random structures & algorithms Issue: Volume 48:Issue 1(2016) Page Start: 57 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Asymptotically optimal neighbour sum distinguishing colourings of graphs1. Issue 4 (9th June 2014) Authors: Przybyło, Jakub Journal: Random structures & algorithms Issue: Volume 47:Issue 4(2015) Page Start: 776 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗