251. Hyperuniform and rigid stable matchings. Issue 2 (27th April 2020) Authors: Andreas Klatt, Michael; Last, Günter; Yogeshwaran, D. Journal: Random structures & algorithms Issue: Volume 57:Issue 2(2020) Page Start: 439 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
252. Improved bounds and algorithms for graph cuts and network reliability. Issue 1 (17th August 2017) Authors: Harris, David G.; Srinivasan, Aravind Journal: Random structures & algorithms Issue: Volume 52:Issue 1(2018) Page Start: 74 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
253. Improved bounds for the randomized decision tree Complexity of recursive majority 12. Issue 3 (8th July 2015) Authors: Magniez, Frédéric; Nayak, Ashwin; Santha, Miklos; Sherman, Jonah; Tardos, Gábor; Xiao, David Journal: Random structures & algorithms Issue: Volume 48:Issue 3(2016) Page Start: 612 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
254. Improved inapproximability results for counting independent sets in the hard‐core model1. Issue 1 (27th December 2012) Authors: Galanis, Andreas; Ge, Qi; Štefankovič, Daniel; Vigoda, Eric; Yang, Linji Journal: Random structures & algorithms Issue: Volume 45:Issue 1(2014) Page Start: 78 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
255. Increasing Hamiltonian paths in random edge orderings1. Issue 3 (7th July 2015) Authors: Lavrov, Mikhail; Loh, Po‐Shen Journal: Random structures & algorithms Issue: Volume 48:Issue 3(2016) Page Start: 588 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
256. Independent sets in hypergraphs omitting an intersection. Issue 3 (14th December 2021) Authors: Bohman, Tom; Liu, Xizhi; Mubayi, Dhruv Journal: Random structures & algorithms Issue: Volume 61:Issue 3(2022) Page Start: 493 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
257. Information percolation and cutoff for the random‐cluster model. Issue 3 (5th June 2020) Authors: Ganguly, Shirshendu; Seo, Insuk Journal: Random structures & algorithms Issue: Volume 57:Issue 3(2020) Page Start: 770 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
258. Inside the clustering window for random linear equations. Issue 2 (20th November 2017) Authors: Gao, Pu; Molloy, Michael Journal: Random structures & algorithms Issue: Volume 52:Issue 2(2018) Page Start: 197 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
259. Inside the critical window for cohomology of random k‐complexes1. Issue 1 (29th January 2015) Authors: Kahle, Matthew; Pittel, Boris Journal: Random structures & algorithms Issue: Volume 48:Issue 1(2016) Page Start: 102 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
260. Intercalates and discrepancy in random Latin squares. Issue 2 (8th November 2017) Authors: Kwan, Matthew; Sudakov, Benny Journal: Random structures & algorithms Issue: Volume 52:Issue 2(2018) Page Start: 181 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗