High-girth Steiner triple systems M Kwan, A Sah, M Sawhney, M Simkin
Annals of Mathematics 200 (3), 1059-1156, 2024
24 2024 The number of n-queens configurations M Simkin
Advances in Mathematics 427, 109127, 2023
23 2023 Threshold for Steiner triple systems A Sah, M Sawhney, M Simkin
Geometric and Functional Analysis 33 (4), 1141-1172, 2023
18 2023 A toolkit for robust thresholds HT Pham, A Sah, M Sawhney, M Simkin
arXiv preprint arXiv:2210.03064, 2022
18 2022 Monotone subsequences in high-dimensional permutations N Linial, M Simkin
Combinatorics, Probability and Computing 27 (1), 69-83, 2018
18 2018 Substructures in Latin squares M Kwan, A Sah, M Sawhney, M Simkin
Israel Journal of Mathematics 256 (2), 363-416, 2023
16 2023 On the threshold problem for Latin boxes Z Luria, M Simkin
Random Structures & Algorithms 55 (4), 926-949, 2019
13 2019 A randomized construction of high girth regular graphs N Linial, M Simkin
Random Structures & Algorithms 58 (2), 345-369, 2021
12 2021 -Steiner Systems in Random HypergraphsM Simkin
arXiv preprint arXiv:1711.01975, 2017
9 2017 Perfect matchings in random subgraphs of regular bipartite graphs R Glebov, Z Luria, M Simkin
Journal of Graph Theory 97 (2), 208-231, 2021
5 2021 A lower bound for the -queens problem Z Luria, M Simkin
arXiv preprint arXiv:2105.11431, 2021
5 2021 A Lower Bound for the n -queens Problem M Simkin, Z Luria
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
4 2022 Sampling, counting, and large deviations for triangle-free graphs near the critical density M Jenssen, W Perkins, A Potukuchi, M Simkin
2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024
3 2024 Lower tails for triangles inside the critical window M Jenssen, W Perkins, A Potukuchi, M Simkin
arXiv preprint arXiv:2411.18563, 2024
2 2024 What is learned in knowledge graph embeddings? MR Douglas, M Simkin, O Ben-Eliezer, T Wu, P Chin, TV Dang, A Wood
Complex Networks & Their Applications X: Volume 2, Proceedings of the Tenth …, 2022
2 2022 Sampling and counting triangle-free graphs near the critical density M Jenssen, W Perkins, A Potukuchi, M Simkin
arXiv preprint arXiv:2410.22951, 2024
1 2024 METHODS FOR ANALYZING RANDOM DESIGNS-IIAS SPECIAL DAY ON COMBINATORIAL DESIGN THEORY M SIMKIN
1 2018 Random-turn and Richman Games M Simkin
Hebrew University of Jerusalem, 2014
1 2014 What is learned in knowledge graph embeddings S Chin, TV Dang, MR Douglas, M Simkin, O Ben-Eliezer, A Wood, T Wu
2021 Finding Structure with Randomness M Simkin
2020