31. A randomized construction of high girth regular graphs. Issue 2 (18th November 2020) Authors: Linial, Nati; Simkin, Michael Journal: Random structures & algorithms Issue: Volume 58:Issue 2(2021) Page Start: 345 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
32. A recursive construction of t‐wise uniform permutations. Issue 3 (7th August 2013) Authors: Finucane, Hilary; Peled, Ron; Yaari, Yariv Journal: Random structures & algorithms Issue: Volume 46:Issue 3(2015) Page Start: 531 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
33. A scaling limit for the degree distribution in sublinear preferential attachment schemes1. Issue 4 (28th November 2015) Authors: Choi, Jihyeok; Sethuraman, Sunder; Venkataramani, Shankar C. Journal: Random structures & algorithms Issue: Volume 48:Issue 4(2016) Page Start: 703 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
34. A scaling limit for the length of the longest cycle in a sparse random digraph. Issue 1 (14th June 2021) Authors: Anastos, Michael; Frieze, Alan Journal: Random structures & algorithms Issue: Volume 60:Issue 1(2022) Page Start: 3 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
35. A simple network of nodes moving on the circle. Issue 2 (1st June 2020) Authors: Cheliotis, Dimitris; Kontoyiannis, Ioannis; Loulakis, Michail; Toumpis, Stavros Journal: Random structures & algorithms Issue: Volume 57:Issue 2(2020) Page Start: 317 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
36. 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) ↗
37. A stability result for balanced dictatorships in Sn1. Issue 3 (7th August 2013) Authors: Ellis, David; Filmus, Yuval; Friedgut, Ehud Journal: Random structures & algorithms Issue: Volume 46:Issue 3(2015) Page Start: 494 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
38. 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) ↗
39. A threshold for the Maker‐Breaker clique game1. Issue 2 (5th March 2013) Authors: Müller, Tobias; Stojaković, Miloš Journal: Random structures & algorithms Issue: Volume 45:Issue 2(2014) Page Start: 318 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
40. A unified framework for testing linear‐invariant properties12. Issue 2 (27th June 2013) Authors: Bhattacharyya, Arnab; Grigorescu, Elena; Shapira, Asaf Journal: Random structures & algorithms Issue: Volume 46:Issue 2(2015) Page Start: 232 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗