| Publication | Date of Publication | Type |
|---|
Limit theorems for longest monotone subsequences in random Mallows permutations
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2018-03-05 | Paper |
Limit theorems for longest monotone subsequences in random Mallows permutations
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2018-03-05 | Paper |
| Cutoff for biased transpositions | 2017-09-11 | Paper |
Simulated tempering and swapping on mean-field models
Journal of Statistical Physics | 2016-10-26 | Paper |
Decay of correlations for the hardcore model on the \(d\)-regular random graph
Electronic Journal of Probability | 2016-05-23 | Paper |
Decay of correlations for the hardcore model on the \(d\)-regular random graph
Electronic Journal of Probability | 2016-05-23 | Paper |
| Torpid mixing of simulated tempering on the Potts model | 2015-08-03 | Paper |
Lengths of monotone subsequences in a Mallows permutation
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2015-05-04 | Paper |
Scaling limits for width two partially ordered sets: the incomparability window
Order | 2013-03-20 | Paper |
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
On the Lipschitz constant of the RSK correspondence
Journal of Combinatorial Theory. Series A | 2011-11-11 | Paper |
Reconstruction for Colorings on Trees
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
A computational method for bounding the probability of reconstruction on trees
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
The computational complexity of estimating MCMC convergence time
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Reconstruction threshold for the hardcore model
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Sampling binary contingency tables with a greedy start
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764911 (Why is no real title available?) | 2010-08-06 | Paper |
On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Polynomials that sign represent parity and Descartes' rule of signs
Computational Complexity | 2009-06-17 | Paper |
Random Bichromatic Matchings
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Random bichromatic matchings
Algorithmica | 2008-04-23 | Paper |
Analysis of top-swap shuffling for genome rearrangements
The Annals of Applied Probability | 2008-01-28 | Paper |
The Effect of Boundary Conditions on Mixing Rates of Markov Chains
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Sampling binary contingency tables with a greedy start
Random Structures & Algorithms | 2007-02-07 | Paper |
Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols
Journal of Computer and System Sciences | 2006-04-28 | Paper |
