Stephen Desalvo

According to our database, Stephen Desalvo authored at least 9 papers between 2016 and 2023.

Collaborative distances:

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

2023

On the largest part size of low-rank combinatorial assemblies.

Richard Arratia, Stephen Desalvo

Random Struct. Algorithms, August, 2023

2021

Attacks and alignments: rooks, set partitions, and permutations.

Richard Arratia, Stephen Desalvo

Australas. J Comb., 2021

2020

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

Stephen Desalvo, James Zhao

Comput. Stat., 2020

2019

Limit Shapes via Bijections.

Stephen Desalvo, Igor Pak

Comb. Probab. Comput., 2019

2018

The probability of avoiding consecutive patterns in the Mallows distribution.

Harry Crane, Stephen Desalvo, Sergi Elizalde

Random Struct. Algorithms, 2018

Probabilistic divide-and-conquer: Deterministic second half.

Stephen Desalvo

Adv. Appl. Math., 2018

2017

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

Stephen Desalvo

Electron. Notes Discret. Math., 2017

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

Stephen Desalvo

Algorithmica, 2017

2016

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

Richard Arratia, Stephen Desalvo

Comb. Probab. Comput., 2016