- Markus Kirschmer, John Voight. Algorithmic Enumeration of Ideal Classes for Quaternion Orders. SIAM J. Comput., 39(5):1714-1747, 2010.
- Russell Impagliazzo, Ragesh Jaiswal, Valentine Kabanets, Avi Wigderson. Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized. SIAM J. Comput., 39(4):1637-1665, 2010.
- Alexander A. Razborov, Alexander A. Sherstov. The Sign-Rank of AC:::0:::. SIAM J. Comput., 39(5):1833-1855, 2010.
- Satish Rao, Shuheng Zhou. Edge Disjoint Paths in Moderately Connected Graphs. SIAM J. Comput., 39(5):1856-1887, 2010.
- Danny Harnik, Moni Naor. On the Compressibility of ::::NP:::: Instances and Cryptographic Applications. SIAM J. Comput., 39(5):1667-1713, 2010.
- Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour. Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design. SIAM J. Comput., 39(5):1772-1798, 2010.
- Ho-Lin Chen, Tim Roughgarden, Gregory Valiant. Designing Network Protocols for Good Equilibria. SIAM J. Comput., 39(5):1799-1832, 2010.
- Sanjeev Arora, Elad Hazan, Satyen Kale. O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n:::2:::) Time. SIAM J. Comput., 39(5):1748-1771, 2010.
- Siu-Wing Cheng, Hyeon-Suk Na, Antoine Vigneron, Yajun Wang. Querying Approximate Shortest Paths in Anisotropic Regions. SIAM J. Comput., 39(5):1888-1918, 2010.
- Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum. The Complexity of Weighted Boolean CSP. SIAM J. Comput., 38(5):1970-1986, 2009.