Log-concavity of the partition function S DeSalvo, I Pak The Ramanujan Journal 38 (1), 61-73, 2015 | 55 | 2015 |

Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example R Arratia, S DeSalvo Combinatorics, Probability & Computing 25 (3), 324, 2016 | 24* | 2016 |

The Shannon entropy of Sudoku matrices PK Newton, SA DeSalvo Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2010 | 19 | 2010 |

The probability of avoiding consecutive patterns in the Mallows distribution H Crane, S DeSalvo, S Elizalde Random Structures & Algorithms 53 (3), 417-447, 2018 | 14 | 2018 |

Probabilistic divide-and-conquer: deterministic second half S DeSalvo arXiv preprint arXiv:1411.6698, 2014 | 13* | 2014 |

Random sampling of contingency tables via probabilistic divide-and-conquer S DeSalvo, JY Zhao arXiv preprint arXiv:1507.00070, 2015 | 12 | 2015 |

Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer S DeSalvo arXiv preprint arXiv:1502.00235, 2016 | 8* | 2016 |

Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method S DeSalvo Pure Mathematics and Applications 26 (1), 22-45, 2017 | 6 | 2017 |

On the singularity of random Bernoulli matrices—novel integer partitions and lower bound expansions R Arratia, S DeSalvo Annals of Combinatorics 17 (2), 251-274, 2013 | 6 | 2013 |

Completely effective error bounds for Stirling numbers of the first and second kinds via Poisson approximation R Arratia, S DeSalvo Annals of Combinatorics 21 (1), 1-24, 2017 | 5 | 2017 |

Limit shapes via bijections S DeSalvo, I Pak arXiv preprint arXiv:1611.06073, 2016 | 5 | 2016 |

Pattern avoidance for random permutations H Crane, S DeSalvo arXiv preprint arXiv:1509.07941, 2015 | 5 | 2015 |

A robust quantitative local central limit theorem with applications to enumerative combinatorics and random combinatorial structures S DeSalvo, G Menz arXiv preprint arXiv:1610.07664, 2016 | 2 | 2016 |

Poisson and independent process approximation for random combinatorial structures with a given number of components, and near-universal behavior for low rank assemblies R Arratia, S DeSalvo arXiv preprint arXiv:1606.04642, 2016 | 2 | 2016 |

Random sampling of contingency tables via probabilistic divide-and-conquer S DeSalvo, J Zhao Computational Statistics, 1-33, 2019 | 1 | 2019 |

On the Random Sampling of Pairs, with Pedestrian examples R Arratia, S DeSalvo Advances in Applied Probability 47 (1), 292-305, 2015 | 1 | 2015 |

Reducing the team uncertainty penalty: Empirical and theoretical approaches S Alfeld, K Berkele, S DeSalvo, T Pham, D Russo, LJ Yan, ME Taylor Sixth Annual Workshop on Multiagent Sequential Decision Making in Uncertain …, 2011 | 1 | 2011 |

Will the real Hardy-Ramanujan formula please stand up? S DeSalvo arXiv preprint arXiv:2003.06908, 2020 | | 2020 |

Attacks and alignments: rooks, set partitions, and permutations R Arratia, S DeSalvo arXiv preprint arXiv:1807.03926, 2018 | | 2018 |

Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer S DeSalvo arXiv preprint arXiv:1703.08627, 2017 | | 2017 |