Frigo, M., C.E. Leiserson, H. Prokop, and S. Ramachandran. 1999. Cache-oblivious algorithms. Pp. 285-298 in Proceedings of the 40th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Washington, D.C. Available at

Gajentaan, A., and M. Overmars. 1995. On a class of O(n2) problems in computational geometry. Computational Geometry: Theory and Applications 5(3):165-185.

Harsha, P., Y. Ishai, J. Kilian, K. Nissim, and S. Venkatesh. 2004. Communication versus computation. Pp. 745-756 in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP). Springer, New York, N.Y.

Hölzle, U., and B. Weihl. 2006. High-Efficiency Power Supplies for Home Computers and Servers. Internal Google technical report. Available at

Indyk, P. 2007. “Sketching, Streaming and Sublinear-Space Algorithms.” Graduate course notes. Available at

Kalyanasundaram, B., and G. Schnitger. 1992. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics 5(5):545-557.

Kushilevitz, E., and N. Nisan. 1997. Communication Complexity. Cambridge University Press.

Lipton, R. “Galactic Algorithms.” Online posting. Available at or

Malik, S., and L. Zhang. 2009. Boolean satisfiability from theoretical hardness to practical success. Communications of the ACM 52(8):76-82.

Muthukrishnan, S. 2005. Data Streams: Algorithms and Applications. Now Publishers, Hanover, Mass.

Razborov, A.A. 1992. On the distributional complexity of disjointness. Theoretical Computer Science 106(2):385-390.

Rubinfeld, R., and A. Shapira. 2012. Sublinear time algorithms. SIAM Journal of Discrete Mathematics 25(4):1562-1588.

Snir, M. 2011. “Parallel Computing 2020: Preparing for the Post-Moore Era.” Presentation from the DIMACS Workshop on Parallelism: A 2020 Vision. Available at

Sweeney, L. 2002. k-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems 10(5):557-570.

Vitter, J. 2008. Algorithms and data structures for external memory. Foundations and Trends in Theoretical Computer Science 2(4):305-474.

The National Academies | 500 Fifth St. N.W. | Washington, D.C. 20001
Copyright © National Academy of Sciences. All rights reserved.
Terms of Use and Privacy Statement