- Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi Nissim, Sofya Raskhodnikova, Adam Smith. What Can We Learn Privately?. SIAM J. Comput., 40(3):793-826, 2011.
- Ran Raz. A Counterexample to Strong Parallel Repetition. SIAM J. Comput., 40(3):771-777, 2011.
- Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson. Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput., 40(2):567-596, 2011.
- Timothy M. Chan, Mihai Patrascu, Liam Roditty. Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput., 40(2):333-349, 2011.
- Christian Cachin, Idit Keidar, Alexander Shraer. Fail-Aware Untrusted Storage. SIAM J. Comput., 40(2):493-533, 2011.
- Alan M. Frieze, Páll Melsted, Michael Mitzenmacher. An Analysis of Random-Walk Cuckoo Hashing. SIAM J. Comput., 40(2):291-308, 2011.
- Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Ben Toner, Thomas Vidick. Entangled Games Are Hard to Approximate. SIAM J. Comput., 40(3):848-877, 2011.
- Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank. On Achieving the Best of Both Worlds in Secure Multiparty Computation. SIAM J. Comput., 40(1):122-141, 2011.
- Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung. Degree Bounded Network Design with Metric Costs. SIAM J. Comput., 40(4):953-980, 2011.
- Satyen Kale, C. Seshadhri. An Expansion Tester for Bounded Degree Graphs. SIAM J. Comput., 40(3):709-720, 2011.