| Publication | Date of Publication | Type |
|---|
On min sum vertex cover and generalized min sum set cover
SIAM Journal on Computing | 2025-01-14 | Paper |
Hardness and approximation of submodular minimum linear ordering problems
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
On the zeroes of hypergraph independence polynomials
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Efficient sampling and counting algorithms for the Potts model on ℤd at all temperatures
Random Structures & Algorithms | 2023-10-12 | Paper |
Note on the number of antichains in generalizations of the Boolean lattice
| 2023-05-25 | Paper |
On the zeroes of hypergraph independence polynomials
| 2022-11-01 | Paper |
On the bipartiteness constant and expansion of Cayley graphs
European Journal of Combinatorics | 2022-04-07 | Paper |
Volume growth, curvature, and Buser-type inequalities in graphs
IMRN. International Mathematics Research Notices | 2022-01-18 | Paper |
Transport proofs of some discrete variants of the Prékopa-Leindler inequality
ANNALI SCUOLA NORMALE SUPERIORE - CLASSE DI SCIENZE | 2021-11-01 | Paper |
On the number of independent sets in uniform, regular, linear hypergraphs
European Journal of Combinatorics | 2021-10-28 | Paper |
Efficient sampling and counting algorithms for the Potts model on ℤᵈ at all temperatures
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Finding cliques using few probes
Random Structures & Algorithms | 2020-06-19 | Paper |
Phase coexistence for the hard-core model on \(\mathbb{Z}^2\)
Combinatorics, Probability and Computing | 2020-03-11 | Paper |
Efficient sampling and counting algorithms for the Potts model on $\mathbb Z^d$ at all temperatures
| 2019-09-19 | Paper |
Characterization of a class of weak transport-entropy inequalities on the line
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2018-11-09 | Paper |
Mutation, Sexual Reproduction and Survival in Dynamic Environments
| 2018-05-03 | Paper |
On the Widom-Rowlinson occupancy fraction in regular graphs
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Randomized greedy: new variants of some classic approximation algorithms
| 2017-09-29 | Paper |
Kantorovich duality for general transport costs and applications
Journal of Functional Analysis | 2017-09-29 | Paper |
Approximation and online algorithms for multidimensional bin packing: a survey
Computer Science Review | 2017-08-31 | Paper |
Information Inequalities for Joint Distributions, With Interpretations and Applications
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Concentration properties of restricted measures with applications to non-Lipschitz functions
Lecture Notes in Mathematics | 2017-07-13 | Paper |
On sampling graphical Markov models
| 2017-05-26 | Paper |
Ricci curvature bounds for weakly interacting Markov chains
Electronic Journal of Probability | 2017-05-02 | Paper |
The Widom-Rowlinson model, the hard-core model and the extremality of the complete graph
European Journal of Combinatorics | 2017-03-28 | Paper |
Meander graphs
| 2017-02-10 | Paper |
Algebraic Connectivity Under Site Percolation in Finite Weighted Graphs
| 2016-12-18 | Paper |
Discrete curvature and abelian groups
Canadian Journal of Mathematics | 2016-06-03 | Paper |
Convergence to global equilibrium for Fokker-Planck equations on a graph and Talagrand-type inequalities
Journal of Differential Equations | 2016-05-27 | Paper |
The distribution of second degrees in the Buckley-Osthus random graph model
Internet Mathematics | 2016-05-25 | Paper |
Decay of correlations for the hardcore model on the \(d\)-regular random graph
Electronic Journal of Probability | 2016-05-23 | Paper |
Inverse expander mixing for hypergraphs
The Electronic Journal of Combinatorics | 2016-05-11 | Paper |
Sampling and counting 3-orientations of planar triangulations
SIAM Journal on Discrete Mathematics | 2016-05-09 | Paper |
Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models
Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI | 2016-02-19 | Paper |
Approximate tensorization of entropy at high temperature
Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI | 2016-02-19 | Paper |
scientific article; zbMATH DE number 6472593 (Why is no real title available?)
| 2015-08-14 | Paper |
Slow mixing of Glauber dynamics for the hard-core model on the hypercube
| 2015-08-03 | Paper |
On a random walk problem arising in self-stabilizing token management
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Lattice Path Matroids: Negative Correlation and Fast Mixing
| 2015-05-25 | Paper |
Efficient distributed random walks with applications
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
How long does it take to catch a wild kangaroo?
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Displacement convexity of entropy and related inequalities on graphs
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2014-10-31 | Paper |
Mixing times of Markov chains on 3-orientations of planar triangulations
| 2014-09-29 | Paper |
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Approximations for the isoperimetric and spectral profile of graphs and related parameters
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Improved mixing condition on the grid for counting and sampling independent sets
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Medium Access Using Queues
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
scientific article; zbMATH DE number 6297817 (Why is no real title available?)
| 2014-05-22 | Paper |
Many sparse cuts via higher eigenvalues
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Distributed random walks
Journal of the ACM | 2014-02-17 | Paper |
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
The Annals of Probability | 2014-01-31 | Paper |
Phase coexistence and slow mixing for the hard-core model on \(\mathbb Z^{2}\)
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Stochastic matching with commitment
Automata, Languages, and Programming | 2013-08-12 | Paper |
Improved mixing condition on the grid for counting and sampling independent sets
Probability Theory and Related Fields | 2013-06-19 | Paper |
Phase transition for the mixing time of the Glauber dynamics for coloring regular trees
The Annals of Applied Probability | 2013-01-25 | Paper |
Approximating Minimum Linear Ordering Problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Entropy and set cardinality inequalities for partition-determined functions
Random Structures & Algorithms | 2012-08-14 | Paper |
On sharp transitions in making squares
Annals of Mathematics. Second Series | 2012-06-29 | Paper |
Tight bounds for mixing of the Swendsen-Wang algorithm at the Potts transition point
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2012-04-26 | Paper |
The multistate hard core model on a regular tree
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Reconstruction and clustering in random constraint satisfaction problems
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Algorithmic extensions of Cheeger's inequality to higher eigenvalues and partitions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
On randomizing two derandomized greedy algorithms
Journal of Combinatorics | 2011-06-27 | Paper |
Reconstruction threshold for the hardcore model
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Mathematical aspects of mixing times in Markov chains.
Foundations and Trends® in Theoretical Computer Science | 2010-09-08 | Paper |
Modified log-sobolev inequalities, mixing and hypercontractivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
The Annals of Applied Probability | 2010-05-06 | Paper |
\(G\)-parking functions, acyclic orientations and spanning trees
Discrete Mathematics | 2010-04-27 | Paper |
Concentration on the discrete torus using transportation
Combinatorics, Probability and Computing | 2010-04-22 | Paper |
Matchings and independent sets of a fixed size in regular graphs
Journal of Combinatorial Theory. Series A | 2009-11-26 | Paper |
scientific article; zbMATH DE number 5485444 (Why is no real title available?)
| 2009-01-05 | Paper |
A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Running Time Predictions for Factoring Algorithms
Lecture Notes in Computer Science | 2008-05-27 | Paper |
The sub-Gaussian constant and concentration inequalities
Israel Journal of Mathematics | 2008-02-22 | Paper |
Analysis of top-swap shuffling for genome rearrangements
The Annals of Applied Probability | 2008-01-28 | Paper |
Random Walks with Lookahead on Power Law Random Graphs
Internet Mathematics | 2007-08-20 | Paper |
Modified logarithmic Sobolev inequalities in discrete settings
Journal of Theoretical Probability | 2007-02-14 | Paper |
On smoothed analysis in dense graphs and formulas
Random Structures & Algorithms | 2007-02-07 | Paper |
The correlation decay (CD) tree and strong spatial mixing in multi-spin systems
| 2007-01-17 | Paper |
Near Optimal Bounds for Collision in Pollard Rho for Discrete Log
| 2006-11-19 | Paper |
Mixing time bounds via the spectral profile
Electronic Journal of Probability | 2006-11-03 | Paper |
A Tight Bound for the Lamplighter Problem
| 2006-10-10 | Paper |
Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
Random Structures & Algorithms | 2006-09-06 | Paper |
A sharp threshold for random graphs with a monochromatic triangle in every edge coloring
Memoirs of the American Mathematical Society | 2006-03-21 | Paper |
Isoperimetric invariants for product Markov chains and graph products
Combinatorica | 2005-07-05 | Paper |
The number of linear extensions of the Boolean lattice
Order | 2005-04-07 | Paper |
On weighted graph homomorphisms
| 2005-04-04 | Paper |
scientific article; zbMATH DE number 2151247 (Why is no real title available?)
| 2005-04-04 | Paper |
Elementary bounds on Poincaré and log-Sobolev constants for decomposable Markov chains
The Annals of Applied Probability | 2005-03-21 | Paper |
Ramsey Games Against a One-Armed Bandit
Combinatorics, Probability and Computing | 2005-03-08 | Paper |
A family of switch equivalent graphs
Discrete Mathematics | 2005-01-13 | Paper |
Approximating min sum set cover
Algorithmica | 2004-11-05 | Paper |
On Playing Golf with Two Balls
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
scientific article; zbMATH DE number 1947050 (Why is no real title available?)
| 2003-07-07 | Paper |
Two‐coloring random hypergraphs
Random Structures & Algorithms | 2002-08-08 | Paper |
Concentration of measure for products of Markov kernels and graph products via functional inequalities
Combinatorics, Probability and Computing | 2002-06-03 | Paper |
Minimal completely separating systems of \(k\)-sets
Journal of Combinatorial Theory. Series A | 2002-02-17 | Paper |
On the chromatic number of set systems
Random Structures & Algorithms | 2002-02-10 | Paper |
Random sampling of Euler tours
Algorithmica | 2001-10-14 | Paper |
Analyzing Glauber dynamics by comparison of Markov chains
Journal of Mathematical Physics | 2001-08-30 | Paper |
\(\lambda_{\infty}\), vertex isoperimetry and concentration
Combinatorica | 2001-04-01 | Paper |
Optimal linear arrangement of a rectangular grid
Discrete Mathematics | 2000-12-03 | Paper |
scientific article; zbMATH DE number 1334601 (Why is no real title available?)
| 1999-11-11 | Paper |
Design of On-Line Algorithms Using Hitting Times
SIAM Journal on Computing | 1999-10-28 | Paper |
Isoperimetric Inequalities for Cartesian Products of Graphs
Combinatorics, Probability and Computing | 1999-04-23 | Paper |
scientific article; zbMATH DE number 1241390 (Why is no real title available?)
| 1999-03-18 | Paper |
scientific article; zbMATH DE number 1189245 (Why is no real title available?)
| 1999-03-04 | Paper |
A characterization of unique tournaments
Journal of Combinatorial Theory. Series B | 1998-11-26 | Paper |
scientific article; zbMATH DE number 1047747 (Why is no real title available?)
| 1998-01-22 | Paper |
Score certificates for tournaments
| 1997-06-29 | Paper |
A note on expected hitting times for birth and death chains
Statistics & Probability Letters | 1997-06-02 | Paper |
scientific article; zbMATH DE number 1003272 (Why is no real title available?)
| 1997-04-23 | Paper |
scientific article; zbMATH DE number 795113 (Why is no real title available?)
| 1996-03-11 | Paper |
Covering with Latin transversals
Discrete Applied Mathematics | 1995-07-11 | Paper |
Independence of solution sets and minimal asymptotic bases
Acta Arithmetica | 1995-06-28 | Paper |
An Extension of Foster's Network Theorem
Combinatorics, Probability and Computing | 1995-02-14 | Paper |
scientific article; zbMATH DE number 524141 (Why is no real title available?)
| 1994-04-18 | Paper |
Collisions Among Random Walks on a Graph
SIAM Journal on Discrete Mathematics | 1993-10-14 | Paper |
Communication Complexity and Quasi Randomness
SIAM Journal on Discrete Mathematics | 1993-06-29 | Paper |
Random walks and the effective resistance of networks
Journal of Theoretical Probability | 1991-01-01 | Paper |
Representations of integers as the sum of k terms
Random Structures & Algorithms | 1990-01-01 | Paper |
