How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails. - Haixia Jia; Cristopher Moore (CP, 2004)

From Spin Glasses to Hard Satisfiable Formulas. - Haixia Jia; Cristopher Moore; Bart Selman (SAT (Selected Papers, 2004)

Hiding Satisfying Assignments: Two are Better than One. - Dimitris Achlioptas; Haixia Jia; Cristopher Moore (J. Artif. Intell. Res., 2005)

Protecting data privacy through hard-to-reverse negative databases. - Fernando Esponda; Elena S. Ackley; Paul Helman; Haixia Jia; Stephanie Forrest (Int. J. Inf. Sec., 2007)

Generating Hard Satisfiable Formulas by Hiding Solutions Deceptively. - Haixia Jia; Cristopher Moore; Doug Strain (J. Artif. Intell. Res., 2007)