531. Scaling limits of random bipartite planar maps with a prescribed degree sequence. Issue 3 (28th February 2018) Authors: Marzouk, Cyril Journal: Random structures & algorithms Issue: Volume 53:Issue 3(2018) Page Start: 448 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
532. Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness1. Issue 1 (4th April 2012) Authors: De Marco, Gianluca; Kowalski, Dariusz R. Journal: Random structures & algorithms Issue: Volume 42:Issue 1(2013) Page Start: 97 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
533. Seeded graph matching via large neighborhood statistics. Issue 3 (30th June 2020) Authors: Mossel, Elchanan; Xu, Jiaming Journal: Random structures & algorithms Issue: Volume 57:Issue 3(2020) Page Start: 570 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
534. Selection by rank in K‐dimensional binary search trees. Issue 1 (6th December 2012) Authors: Duch, Amalia; Jiménez, Rosa M.; Martínez, Conrado Journal: Random structures & algorithms Issue: Volume 45:Issue 1(2014) Page Start: 14 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
535. Self‐avoiding walk on the hypercube. Issue 3 (2nd September 2022) Authors: Slade, Gordon Journal: Random structures & algorithms Issue: Volume 62:Issue 3(2023) Page Start: 689 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
536. Self‐destructive percolation as a limit of forest‐fire models on regular rooted trees1. Issue 1 (7th March 2016) Authors: Graf, Robert Journal: Random structures & algorithms Issue: Volume 50:Issue 1(2017) Page Start: 86 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
537. Semi‐random graph process. Issue 3 (21st October 2019) Authors: Ben‐Eliezer, Omri; Hefetz, Dan; Kronenberg, Gal; Parczyk, Olaf; Shikhelman, Clara; Stojaković, Miloš Journal: Random structures & algorithms Issue: Volume 56:Issue 3(2020) Page Start: 648 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
538. Separating subadditive euclidean functionals1. Issue 3 (22nd December 2016) Authors: Frieze, Alan; Pegden, Wesley Journal: Random structures & algorithms Issue: Volume 51:Issue 3(2017) Page Start: 375 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
539. Sets that are connected in two random graphs. Issue 3 (13th March 2013) Authors: Molloy, Michael Journal: Random structures & algorithms Issue: Volume 45:Issue 3(2014) Page Start: 498 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
540. Sets without k‐term progressions can have many shorter progressions. Issue 3 (15th December 2020) Authors: Fox, Jacob; Pohoata, Cosmin Journal: Random structures & algorithms Issue: Volume 58:Issue 3(2021) Page Start: 383 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗