Monotone Subsequences in High-Dimensional Permutations. - Nathan Linial; Michael Simkin (Comb. Probab. Comput., 2018)

On the threshold problem for Latin boxes. - Zur Luria; Michael Simkin (Random Struct. Algorithms, 2019)

What Is Learned in Knowledge Graph Embeddings? - Michael R. Douglas; Michael Simkin; Omri Ben-Eliezer; Tianqi Wu; Peter Chin 001; Trung V. Dang; Andrew Wood (COMPLEX NETWORKS, 2021)

Perfect matchings in random subgraphs of regular bipartite graphs. - Roman Glebov; Zur Luria; Michael Simkin (J. Graph Theory, 2021)

A randomized construction of high girth regular graphs. - Nati Linial; Michael Simkin (Random Struct. Algorithms, 2021)

A Lower Bound for the n-queens Problem. - Michael Simkin; Zur Luria (SODA, 2022)

Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi; Michael Simkin (FOCS, 2024)

Sampling and counting triangle-free graphs near the critical density. - Matthew Jenssen; Will Perkins 001; Aditya Potukuchi; Michael Simkin (CoRR, 2024)