| Publication | Date of Publication | Type |
|---|
Logarithmic Sobolev inequalities in discrete product spaces
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Logarithmic Sobolev inequalities in discrete product spaces: a proof by a transportation cost distance
| 2015-07-10 | Paper |
An inequality for relative entropy and logarithmic Sobolev inequalities in Euclidean spaces
Journal of Functional Analysis | 2013-01-18 | Paper |
Correction: measure concentration for Euclidean distance in the case of dependent random variables
The Annals of Probability | 2010-03-08 | Paper |
Bounding relative entropy by the relative entropy of local specifications in product spaces
| 2009-07-26 | Paper |
An explicit bound on the Logarithmic Sobolev constant of weakly dependent random variables
| 2006-05-15 | Paper |
Measure concentration for Euclidean distance in the case of dependent random variables.
The Annals of Probability | 2004-12-10 | Paper |
How many future measures can there be?
Ergodic Theory and Dynamical Systems | 2002-06-11 | Paper |
Relative capacity and dimension of graphs
Discrete Mathematics | 2001-07-18 | Paper |
Measure concentration for a class of random processes
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 1999-12-13 | Paper |
Correction to: Entropy and the consistent estimation of joint distributions
The Annals of Probability | 1997-04-21 | Paper |
Almost-sure waiting time results for weak and very weak Bernoulli processes
Ergodic Theory and Dynamical Systems | 1996-01-15 | Paper |
Entropy and the consistent estimation of joint distributions
The Annals of Probability | 1995-02-13 | Paper |
On the Shannon capacity of probabilistic graphs
Journal of Combinatorial Theory. Series B | 1994-08-07 | Paper |
The positive-divergence and blowing-up properties
Israel Journal of Mathematics | 1994-06-19 | Paper |
Entropy splitting for antiblocking corners and perfect graphs
Combinatorica | 1990-01-01 | Paper |
On the capacity of uniform hypergraphs
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless (Corresp.)
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
How to encode the modulo-two sum of binary sources (Corresp.)
IEEE Transactions on Information Theory | 1979-01-01 | Paper |
A coding theorem for the discrete memoryless broadcast channel
IEEE Transactions on Information Theory | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3760065 (Why is no real title available?)
| 1978-01-01 | Paper |
General broadcast channels with degraded message sets
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
Images of a set via two channels and their role in multi-user communication
IEEE Transactions on Information Theory | 1977-01-01 | Paper |
Error exponent for source coding with a fidelity criterion
IEEE Transactions on Information Theory | 1974-01-01 | Paper |
