Author of the publication

Algorithms to approximately count and sample conforming colorings of graphs.

, and . Discret. Appl. Math., (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Targeted Ciphers for Format-Preserving Encryption., and . SAC, volume 11349 of Lecture Notes in Computer Science, page 3-26. Springer, (2018)Rapid Mixing of k-Class Biased Permutations., and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 820-834. Springer, (2018)Rapid Mixing of \(k\)-Class Biased Permutations., and . SIAM J. Discret. Math., 38 (1): 702-725 (March 2024)Iterated Decomposition of Biased Permutations via New Bounds on the Spectral Gap of Markov Chains., , and . APPROX-RANDOM, volume 176 of LIPIcs, page 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Sampling and Counting 3-Orientations of Planar Triangulations., , , and . SIAM J. Discret. Math., 30 (2): 801-831 (2016)Rapid Mixing of k-Class Biased Permutations., and . CoRR, (2017)New Algorithms and Analyses for Sum-Preserving Encryption., and . ASIACRYPT (3), volume 13793 of Lecture Notes in Computer Science, page 3-31. Springer, (2022)Targeted Invertible Pseudorandom Functions and Deterministic Format-Transforming Encryption., and . CT-RSA, volume 13871 of Lecture Notes in Computer Science, page 622-642. Springer, (2023)Cluster Algorithms for Discrete Models of Colloids with Bars., , and . ANALCO, page 135-149. SIAM, (2011)Mixing times of Markov chains for self-organizing lists and biased permutations., , , and . Random Struct. Algorithms, 61 (4): 638-665 (2022)