391. Node profiles of symmetric digital search trees: Concentration properties. Issue 3 (24th November 2020) Authors: Drmota, Michael; Fuchs, Michael; Hwang, Hsien‐Kuei; Neininger, Ralph Journal: Random structures & algorithms Issue: Volume 58:Issue 3(2021) Page Start: 430 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
392. Normal approximation and fourth moment theorems for monochromatic triangles. Issue 1 (17th May 2021) Authors: Bhattacharya, Bhaswar B.; Fang, Xiao; Yan, Han Journal: Random structures & algorithms Issue: Volume 60:Issue 1(2022) Page Start: 25 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
393. Note on a problem of M. Talagrand1. Issue 4 (1st July 2014) Authors: DeMarco, B.; Kahn, J. Journal: Random structures & algorithms Issue: Volume 47:Issue 4(2015) Page Start: 663 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
394. Notes on growing a tree in a graph. Issue 2 (18th December 2018) Authors: Devroye, Luc; Dujmović, Vida; Frieze, Alan; Mehrabian, Abbas; Morin, Pat; Reed, Bruce Journal: Random structures & algorithms Issue: Volume 55:Issue 2(2019) Page Start: 290 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
395. On a greedy 2‐matching algorithm and Hamilton cycles in random graphs with minimum degree at least three1. Issue 3 (27th December 2012) Authors: Frieze, Alan Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 443 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
396. On a problem of M. Talagrand. Issue 4 (26th February 2022) Authors: Frankston, Keith; Kahn, Jeff; Park, Jinyoung Journal: Random structures & algorithms Issue: Volume 61:Issue 4(2022) Page Start: 710 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
397. On Bollobás‐Riordan random pairing model of preferential attachment graph. Issue 4 (28th December 2020) Authors: Pittel, Boris Journal: Random structures & algorithms Issue: Volume 58:Issue 4(2021) Page Start: 691 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
398. On breadth‐first constructions of scaling limits of random graphs and random unicellular maps. Issue 4 (7th January 2022) Authors: Miermont, Grégory; Sen, Sanchayan Journal: Random structures & algorithms Issue: Volume 61:Issue 4(2022) Page Start: 803 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
399. On covering expander graphs by hamilton cycles. Issue 2 (10th August 2012) Authors: Glebov, Roman; Krivelevich, Michael; Szabó, Tibor Journal: Random structures & algorithms Issue: Volume 44:Issue 2(2014) Page Start: 183 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
400. On densities for solutions to stochastic fixed point equations. Issue 3 (21st September 2018) Authors: Leckey, Kevin Journal: Random structures & algorithms Issue: Volume 54:Issue 3(2019) Page Start: 528 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗