Artificial Intelligence 126(1–2), 43–62 (2001), DOI 10.1016/S0004-3702(00)00081-3. Primary full byline Carla P. Gomes and Bart Selman on page 43. Abstract and sections 4–5 compare parallel, interleaved and restart portfolios on stated search-problem distributions; no claim of universal speedup.
Published in Proceedings of ECAI 1992, pp. 359–363. The paper introduced the SATPlan approach. The bounded model, state-transition formulas and deletion-sensitive proof used here are given explicitly rather than relying on a copied encoding.