- Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. The Complexity of Weighted Boolean CSP. SIAM J. Comput., 38(5):1970-1986, 2009.
- Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung. Breaking a Time-and-Space Barrier in Constructing Full-Text Indices. SIAM J. Comput., 38(6):2162-2178, 2009.
- Leonard M. Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosík. The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM J. Comput., 38(6):2356-2381, 2009.
- Umberto Straccia, Manuel Ojeda-Aciego, Carlos Viegas Damásio. On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs. SIAM J. Comput., 38(5):1881-1911, 2009.
- Mee Yee Chan, Wun-Tat Chan, Francis Y. L. Chin, Stanley P. Y. Fung, Ming-Yang Kao. Linear-Time Haplotype Inference on Pedigrees without Recombinations and Mating Loops. SIAM J. Comput., 38(6):2179-2197, 2009.
- Wouter Gelade, Wim Martens, Frank Neven. Optimizing Schema Languages for XML: Numerical Constraints and Interleaving. SIAM J. Comput., 38(5):2021-2043, 2009.
- T.-H. Hubert Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Aleksandrs Slivkins. Metric Embeddings with Relaxed Guarantees. SIAM J. Comput., 38(6):2303-2329, 2009.
- Libor Barto, Marcin Kozik, Todd Niven. The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell). SIAM J. Comput., 38(5):1782-1802, 2009.
- Sudipto Guha, Adam Meyerson, Kamesh Munagala. A Constant Factor Approximation for the Single Sink Edge Installation Problem. SIAM J. Comput., 38(6):2426-2442, 2009.
- Ulrich Schmid, Bettina Weiss, Idit Keidar. Impossibility Results and Lower Bounds for Consensus under Link Failures. SIAM J. Comput., 38(5):1912-1951, 2009.