Kushilevitz, Eyal; Lindell, Yehuda; Rabin, Tal Information-theoretically secure protocols and security under composition. (English) Zbl 1202.94185 SIAM J. Comput. 39, No. 5, 2090-2112 (2010). Reviewer: Tiit Riismaa (Tallinn) MSC: 94A60 68Q17 68Q25 PDFBibTeX XMLCite \textit{E. Kushilevitz} et al., SIAM J. Comput. 39, No. 5, 2090--2112 (2010; Zbl 1202.94185) Full Text: DOI
Chan, Timothy M. More algorithms for all-pairs shortest paths in weighted graphs. (English) Zbl 1207.68436 SIAM J. Comput. 39, No. 5, 2075-2089 (2010). MSC: 68W05 68Q25 68W40 PDFBibTeX XMLCite \textit{T. M. Chan}, SIAM J. Comput. 39, No. 5, 2075--2089 (2010; Zbl 1207.68436) Full Text: DOI
Cohen, Edith; Kaplan, Haim; Milo, Tova Labeling dynamic XML trees. (English) Zbl 1207.68157 SIAM J. Comput. 39, No. 5, 2048-2074 (2010). MSC: 68Q17 68P15 PDFBibTeX XMLCite \textit{E. Cohen} et al., SIAM J. Comput. 39, No. 5, 2048--2074 (2010; Zbl 1207.68157) Full Text: DOI
Matulef, Kevin; O’Donnell, Ryan; Rubinfeld, Ronitt; Servedio, Rocco A. Testing halfspaces. (English) Zbl 1207.68167 SIAM J. Comput. 39, No. 5, 2004-2047 (2010). MSC: 68Q25 06E30 PDFBibTeX XMLCite \textit{K. Matulef} et al., SIAM J. Comput. 39, No. 5, 2004--2047 (2010; Zbl 1207.68167) Full Text: DOI Link
Kaufman, Tali; Litsyn, Simon; Xie, Ning Breaking the \(\epsilon\)-soundness bound of the linearity test over GF(2). (English) Zbl 1202.68178 SIAM J. Comput. 39, No. 5, 1988-2003 (2010). MSC: 68P30 68Q17 94B25 PDFBibTeX XMLCite \textit{T. Kaufman} et al., SIAM J. Comput. 39, No. 5, 1988--2003 (2010; Zbl 1202.68178) Full Text: DOI
Czumaj, Artur; Krysta, Piotr; Vöcking, Berthold Selfish traffic allocation for server farms. (English) Zbl 1208.60089 SIAM J. Comput. 39, No. 5, 1957-1987 (2010). Reviewer: Hans Daduna (Hamburg) MSC: 60K25 90B15 91A10 91A80 PDFBibTeX XMLCite \textit{A. Czumaj} et al., SIAM J. Comput. 39, No. 5, 1957--1987 (2010; Zbl 1208.60089) Full Text: DOI Link
Fomin, Fedor V.; Golovach, Petr A.; Lokshtanov, Daniel; Saurabh, Saket Intractability of clique-width parameterizations. (English) Zbl 1207.68161 SIAM J. Comput. 39, No. 5, 1941-1956 (2010). MSC: 68Q17 68Q25 68W40 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., SIAM J. Comput. 39, No. 5, 1941--1956 (2010; Zbl 1207.68161) Full Text: DOI
Chakrabarti, Amit; Regev, Oded An optimal randomized cell probe lower bound for approximate nearest neighbor searching. (English) Zbl 1207.68156 SIAM J. Comput. 39, No. 5, 1919-1940 (2010). MSC: 68Q17 68P05 PDFBibTeX XMLCite \textit{A. Chakrabarti} and \textit{O. Regev}, SIAM J. Comput. 39, No. 5, 1919--1940 (2010; Zbl 1207.68156) Full Text: DOI
Cheng, Siu-Wing; Na, Hyeon-Suk; Vigneron, Antoine; Wang, Yajun Querying approximate shortest paths in anisotropic regions. (English) Zbl 1207.68415 SIAM J. Comput. 39, No. 5, 1888-1918 (2010). MSC: 68U05 68W25 PDFBibTeX XMLCite \textit{S.-W. Cheng} et al., SIAM J. Comput. 39, No. 5, 1888--1918 (2010; Zbl 1207.68415) Full Text: DOI
Rao, Satish; Zhou, Shuheng Edge disjoint paths in moderately connected graphs. (English) Zbl 1207.68448 SIAM J. Comput. 39, No. 5, 1856-1887 (2010). MSC: 68W25 68R10 68Q17 90C35 PDFBibTeX XMLCite \textit{S. Rao} and \textit{S. Zhou}, SIAM J. Comput. 39, No. 5, 1856--1887 (2010; Zbl 1207.68448) Full Text: DOI Link
Razborov, Alexander A.; Sherstov, Alexander A. The sign-rank of AC\(^0\). (English) Zbl 1211.68213 SIAM J. Comput. 39, No. 5, 1833-1855 (2010). MSC: 68Q17 68Q15 68Q32 94C10 PDFBibTeX XMLCite \textit{A. A. Razborov} and \textit{A. A. Sherstov}, SIAM J. Comput. 39, No. 5, 1833--1855 (2010; Zbl 1211.68213) Full Text: DOI
Chen, Ho-Lin; Roughgarden, Tim; Valiant, Gregory Designing network protocols for good equilibria. (English) Zbl 1207.68164 SIAM J. Comput. 39, No. 5, 1799-1832 (2010). MSC: 68Q25 68M12 90B10 91A43 PDFBibTeX XMLCite \textit{H.-L. Chen} et al., SIAM J. Comput. 39, No. 5, 1799--1832 (2010; Zbl 1207.68164) Full Text: DOI
Chekuri, C.; Hajiaghayi, M. T.; Kortsarz, G.; Salavatipour, M. R. Approximation algorithms for nonuniform buy-at-bulk network design. (English) Zbl 1207.90019 SIAM J. Comput. 39, No. 5, 1772-1798 (2010). MSC: 90B10 90C27 90C59 90C60 PDFBibTeX XMLCite \textit{C. Chekuri} et al., SIAM J. Comput. 39, No. 5, 1772--1798 (2010; Zbl 1207.90019) Full Text: DOI
Arora, Sanjeev; Hazan, Elad; Kale, Satyen \(O(\sqrt{\log n})\) approximation to sparsest cut in \(\tilde{O}(n^2)\) time. (English) Zbl 1207.68441 SIAM J. Comput. 39, No. 5, 1748-1771 (2010). MSC: 68W25 PDFBibTeX XMLCite \textit{S. Arora} et al., SIAM J. Comput. 39, No. 5, 1748--1771 (2010; Zbl 1207.68441) Full Text: DOI
Kirschmer, Markus; Voight, John Algorithmic enumeration of ideal classes for quaternion orders. (English) Zbl 1208.11125 SIAM J. Comput. 39, No. 5, 1714-1747 (2010); corrigendum ibid. 41, No. 3, 714 (2012). Reviewer: Dimitros Poulakis (Thessaloniki) MSC: 11R52 11S45 11R29 PDFBibTeX XMLCite \textit{M. Kirschmer} and \textit{J. Voight}, SIAM J. Comput. 39, No. 5, 1714--1747 (2010; Zbl 1208.11125) Full Text: DOI arXiv
Harnik, Danny; Naor, Moni On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications. (English) Zbl 1207.68162 SIAM J. Comput. 39, No. 5, 1667-1713 (2010). MSC: 68Q17 68Q15 94A60 PDFBibTeX XMLCite \textit{D. Harnik} and \textit{M. Naor}, SIAM J. Comput. 39, No. 5, 1667--1713 (2010; Zbl 1207.68162) Full Text: DOI