S. Desalvo

发表

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, 2016, 1606.04642.

The Shannon entropy of Sudoku matrices

P. Newton, S. Desalvo, 2010, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

The probability of avoiding consecutive patterns in the Mallows distribution

Harry Crane, S. Desalvo, S. Elizalde, 2016, Random Struct. Algorithms.

Improvements to exact Boltzmann sampling using probabilistic divide-and-conquer and the recursive method

S. Desalvo, 2016, Electron. Notes Discret. Math..

Fe b 20 16 Random Sampling of Contingency Tables via Probabilistic Divide-and-Conquer

S. Desalvo, James J. Y. Zhao, 2018 .

Exact, Uniform Sampling of Contingency Tables via Probabilistic Divide-and-Conquer

S. Desalvo, James J. Y. Zhao, 2015 .

On the Singularity of Random Bernoulli Matrices— Novel Integer Partitions and Lower Bound Expansions

R. Arratia, S. Desalvo, 2011, 1105.2834.

A robust quantitative local central limit theorem with applications to enumerative combinatorics and random combinatorial structures

G. Menz, S. Desalvo, 2016, 1610.07664.

PROBABILISTIC DIVIDE-AND-CONQUER { A NEW METHOD FOR EXACT SIMULATION { AND LOWER BOUND EXPANSIONS FOR RANDOM BERNOULLI MATRICES VIA NOVEL INTEGER PARTITIONS

S. Desalvo, 2012 .

Pattern Avoidance for Random Permutations

Harry Crane, S. Desalvo, 2015, 1509.07941.

Completely Effective Error Bounds for Stirling Numbers of the First and Second Kinds via Poisson Approximation

R. Arratia, S. Desalvo, 2014, 1404.3007.

Exact, Uniform Sampling of Latin Squares and Sudoku Matrices

S. Desalvo, 2015, 1502.00235.

Completely Effective Error Bounds for Stirling Numbers of the First and Second Kinds via Poisson Approximation

R. Arratia, S. Desalvo, 2017, Annals of Combinatorics.

On the largest part size of low‐rank combinatorial assemblies

R. Arratia, S. Desalvo, 2022, Random Structures & Algorithms.

Log-concavity of the partition function

S. Desalvo, Igor Pak, 2014, The Ramanujan Journal.

Random sampling of contingency tables via probabilistic divide-and-conquer

S. Desalvo, James J. Y. Zhao, 2019, Computational Statistics.

On the Random Sampling of Pairs, with Pedestrian Examples

R. Arratia, S. Desalvo, 2012, Advances in Applied Probability.

Probabilistic divide-and-conquer: Deterministic second half

Stephen Desalvo, S. Desalvo, 2014, Adv. Appl. Math..

1958

S. Desalvo, P. Newton, 1958, The George Bell-Gerhard Leibholz Correspondence.

Random sampling of contingency tables via probabilistic divide-and-conquer

Stephen DeSalvo, James Zhao, S. Desalvo, 2015, Comput. Stat..

Random sampling of Latin squares via binary contingency tables and probabilistic divide-and-conquer

Stephen DeSalvo, S. Desalvo, 2017, 1703.08627.

Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer

Stephen DeSalvo, S. Desalvo, 2015, Algorithmica.

Limit Shapes via Bijections

Igor Pak, Stephen Desalvo, I. Pak, 2016, Combinatorics, Probability and Computing.

Probabilistic Divide-and-Conquer: A New Exact Simulation Method, With Integer Partitions as an Example

Richard Arratia, Stephen Desalvo, R. Arratia, 2011, Combinatorics, Probability and Computing.

An Independent Process Approximation to Sparse Random Graphs with a Prescribed Number of Edges and Triangles

M. P. Rombach, S. Desalvo, 2015, 1509.08585.

On the Singularity of Random Bernoulli Matrices— Novel Integer Partitions and Lower Bound Expansions

R. Arratia, S. Desalvo, 2013, Annals of Combinatorics.

Will the real Hardy-Ramanujan formula please stand up?

S. Desalvo, 2020, 2003.06908.

Log-concavity of the partition function

Igor Pak, Stephen DeSalvo, I. Pak, 2013, 1310.7982.