From post

Random Instances of Problems in NP - Algorithms and Statistical Physics.

. Algorithms, Probability, Networks, and Games, том 9295 из Lecture Notes in Computer Science, стр. 196-222. Springer, (2015)

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.

 

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

On independent sets in random graphs, и . CoRR, (2010)Local Convergence of Random Graph Colorings., , и . APPROX-RANDOM, том 40 из LIPIcs, стр. 726-737. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)On Sampling Symmetric Gibbs Distributions on Sparse Random Graphs and Hypergraphs.. ICALP, том 229 из LIPIcs, стр. 57:1-57:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hamilton Cycles in Random Intersection Graphs., и . Encyclopedia of Algorithms, (2016)Random Instances of Problems in NP - Algorithms and Statistical Physics.. Algorithms, Probability, Networks, and Games, том 9295 из Lecture Notes in Computer Science, стр. 196-222. Springer, (2015)Planting colourings silently., , и . CoRR, (2014)A simple algorithm for sampling colourings of G(n, d/n) up to Gibbs Uniqueness Threshold.. CoRR, (2016)Spectral Independence Beyond Uniqueness using the topological method.. CoRR, (2022)On sampling diluted Spin Glasses using Glauber dynamics., и . CoRR, (2024)Local Convergence of Random Graph Colorings., , и . Comb., 38 (2): 341-380 (2018)