( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Three tutorial lectures on entropy and counting

. (2014)cite arxiv:1406.7872Comment: Notes prepared to accompany a series of tutorial lectures given by the author at the 1st Lake Michigan Workshop on Combinatorics and Graph Theory, Western Michigan University, March 15--16 2014.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Garrett Galvin

Elisabeth Galvin

Bodo David

Erich David

Ernst David

 

Другие публикации лиц с тем же именем

Three tutorial lectures on entropy and counting. (2014)cite arxiv:1406.7872Comment: Notes prepared to accompany a series of tutorial lectures given by the author at the 1st Lake Michigan Workshop on Combinatorics and Graph Theory, Western Michigan University, March 15--16 2014.Slow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs., и . Random Struct. Algorithms, 28 (4): 427-443 (2006)Torpid mixing of local Markov chains on 3-colorings of the discrete torus., и . SODA, стр. 376-384. SIAM, (2007)Global connectivity from local geometric constraints for sensor networks with various wireless footprints., , , и . IPSN, стр. 19-26. ACM, (2006)Slow mixing of Glauber dynamics for the hard-core model on the hypercube., и . SODA, стр. 466-467. SIAM, (2004)Torpid Mixing of Local Markov Chains on 3-Colorings of the Discrete Torus, и . CoRR, (2012)Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree., и . J. Graph Theory, 76 (2): 149-168 (2014)A Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube.. Comb. Probab. Comput., 20 (1): 27-51 (2011)The Multistate Hard Core Model on a Regular Tree., , , и . SIAM J. Discret. Math., 25 (2): 894-915 (2011)Counting Colorings of a Regular Graph.. Graphs Comb., 31 (3): 629-638 (2015)