1. Asymptotic enumeration of sparse 2‐connected graphs. Issue 3 (4th April 2012) Authors: Kemkes, Graeme; Sato, Cristiane M.; Wormald, Nicholas Journal: Random structures & algorithms Issue: Volume 43:Issue 3(2013) Page Start: 354 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Critical window for the vacant set left by random walk on random regular graphs1. Issue 3 (12th May 2012) Authors: Černý, Jiří; Teixeira, Augusto Journal: Random structures & algorithms Issue: Volume 43:Issue 3(2013) Page Start: 313 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Distribution of the number of spanning regular subgraphs in random graphs1. Issue 3 (4th April 2012) Authors: Gao, Pu Journal: Random structures & algorithms Issue: Volume 43:Issue 3(2013) Page Start: 338 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Robust characterizations of k‐wise independence over product spaces and related testing results123. Issue 3 (7th May 2012) Authors: Rubinfeld, Ronitt; Xie, Ning Journal: Random structures & algorithms Issue: Volume 43:Issue 3(2013) Page Start: 265 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. Weighted enumeration of spanning subgraphs in locally tree‐like graphs. Issue 3 (28th May 2012) Authors: Salez, Justin Journal: Random structures & algorithms Issue: Volume 43:Issue 3(2013) Page Start: 377 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗