Follow
Stephen DeSalvo
Stephen DeSalvo
Unknown affiliation
Verified email at google.com - Homepage
Title
Cited by
Cited by
Year
Log-concavity of the partition function
S DeSalvo, I Pak
The Ramanujan Journal 38, 61-73, 2015
1132015
Probabilistic divide-and-conquer: a new exact simulation method, with integer partitions as an example
R Arratia, S DeSalvo
Combinatorics, Probability and Computing 25 (3), 324-351, 2016
33*2016
The probability of avoiding consecutive patterns in the Mallows distribution
H Crane, S DeSalvo, S Elizalde
Random Structures & Algorithms 53 (3), 417-447, 2018
312018
The Shannon entropy of Sudoku matrices
PK Newton, SA DeSalvo
Proceedings of the Royal Society A: Mathematical, Physical and Engineering …, 2010
312010
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-24, 2017
172017
Probabilistic divide-and-conquer: deterministic second half
S DeSalvo
arXiv preprint arXiv:1411.6698, 2014
14*2014
Random sampling of contingency tables via probabilistic divide-and-conquer
S DeSalvo, JY Zhao
arXiv preprint arXiv:1507.00070, 2015
132015
Pattern avoidance for random permutations
H Crane, S DeSalvo
Discrete Mathematics & Theoretical Computer Science 19 (Permutation Patterns), 2018
122018
Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
S DeSalvo
arXiv preprint arXiv:1502.00235, 2016
10*2016
Limit shapes via bijections
S DeSalvo, I Pak
Combinatorics, Probability and Computing 28 (2), 187-240, 2019
92019
Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method
S DeSalvo
Electronic Notes in Discrete Mathematics 59, 65-77, 2017
72017
On the singularity of random Bernoulli matrices—novel integer partitions and lower bound expansions
R Arratia, S DeSalvo
Annals of Combinatorics 17, 251-274, 2013
72013
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
52016
Random sampling of contingency tables via probabilistic divide-and-conquer
S DeSalvo, J Zhao
Computational Statistics 35 (2), 837-869, 2020
32020
Will the real Hardy-Ramanujan formula please stand up?
S DeSalvo
arXiv preprint arXiv:2003.06908, 2020
32020
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
32016
On the largest part size of low‐rank combinatorial assemblies
R Arratia, S DeSalvo
Random Structures & Algorithms 63 (1), 3-26, 2023
12023
Attacks and alignments: rooks, set partitions, and permutations
R Arratia, S DeSalvo
arXiv preprint arXiv:1807.03926, 2018
12018
Random Sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer
S DeSalvo
arXiv preprint arXiv:1703.08627, 2017
12017
On the random sampling of pairs, with pedestrian examples
R Arratia, S DeSalvo
Advances in Applied Probability 47 (1), 292-305, 2015
12015
The system can't perform the operation now. Try again later.
Articles 1–20