Skip to content

Author

Clayton Mizgerd

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Sep 2026

A general counting and sampling Lovász local lemma

Consider a constraint satisfaction problem $\mathbf{C}$ on finitely many independent random variables with dependency graph $G$. Let $p_a$ be the violation probability of a constraint $a\in \mathbf{C}$ and $N_G^2 (a)$ the set of constraints at distance one or two from $a$ in $G$. Suppose that, there exists $x\in (0,1)^...

Vishesh Jain, Clayton Mizgerd, H. Pham · 0 citations
Preprint Sep 2026

Transposition achieves OPT$+O(1)$ in polynomial time for IID list update

It is proved that, for arbitrary $p and arbitrary initial orderings $\sigma$ and arbitrary initial orderings $\sigma$, after polynomially many queries in the number of items, the expected cost of a query is at most $\mathsf{OPT} + O(1)$.

Clayton Mizgerd · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.