Michael Simkin

According to our database, Michael Simkin authored at least 8 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Sampling and counting triangle-free graphs near the critical density.

Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin

CoRR, 2024

Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density.

Matthew Jenssen, Will Perkins, Aditya Potukuchi, Michael Simkin

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2022

A Lower Bound for the n-queens Problem.

Michael Simkin, Zur Luria

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

A randomized construction of high girth regular graphs.

Nati Linial, Michael Simkin

Random Struct. Algorithms, 2021

Perfect matchings in random subgraphs of regular bipartite graphs.

Roman Glebov, Zur Luria, Michael Simkin

J. Graph Theory, 2021

What Is Learned in Knowledge Graph Embeddings?

Michael R. Douglas, Michael Simkin, Omri Ben-Eliezer, Tianqi Wu, Peter Chin, Trung V. Dang, Andrew Wood

Proceedings of the Complex Networks & Their Applications X - Volume 2, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30, 2021

2019

On the threshold problem for Latin boxes.

Zur Luria, Michael Simkin

Random Struct. Algorithms, 2019

2018

Monotone Subsequences in High-Dimensional Permutations.

Nathan Linial, Michael Simkin

Comb. Probab. Comput., 2018