Kevin McCurley is a research scientist at Google. He is a fellow of the International Association for Cryptologic Research and previously held positions at IBM Research, Sandia National Laboratories, and University of Southern California. His research interests include information retrieval, algorithms, and information security. More information at the Kevin McCurley home page.
Incremental Crawling, Kevin S. McCurley, Encyclopedia of Database Systems, 2009, pp. 1417-1421.
Dense Subgraph Extraction, David Gibson, Ravi Kumar, Kevin S. McCurley, Andrew Tomkins, in: Mining Graph Data, 2006, pp. 411-441.
Language Modeling and Encryption on Packet Switched Networks, Kevin S. McCurley, Advances in Cryptology: Proc. Eurocrypt 2006, pp. 359-372.
Fast discovery of connection subgraphs, Christos Faloutsos, Kevin S. McCurley, Andrew Tomkins, KDD, 2004, pp. 118-127.
Links in Hierarchical Information Networks, Nadav Eiron, Kevin S. McCurley, WAW, 2004, pp. 143-155.
Mining and Knowledge Discovery from the Web, Kevin S. McCurley, Andrew Tomkins, ISPAN, 2004, pp. 4-11.
Ranking the web frontier, Nadav Eiron, Kevin S. McCurley, John A. Tomlin, Proceedings International WWW Conference, 2004, pp. 309-318.
A case for automated large-scale semantic annotation, Stephen Dill, Nadav Eiron, David Gibson, Daniel Gruhl, R. Guha, Anant Jhingran, Tapas Kanungo, Kevin S. McCurley, Sridhar Rajagopalan, Andrew Tomkins, John A. Tomlin, Jason Y. Zien, J. Web Sem., vol. 1 (2003), pp. 115-132.
Analysis of anchor text for web search, Nadav Eiron, Kevin S. McCurley, SIGIR, 2003, pp. 459-460.
Extracting Spatial Knowledge from the Web, Yasuhiko Morimoto, Masaki Aono, Michael E. Houle, Kevin S. McCurley, SAINT, 2003, pp. 326-333.
Searching the workplace web, Ronald Fagin, Ravi Kumar, Kevin S. McCurley, D. Sivakumar, John A. Tomlin, David P. Williamson, WWW, 2003, pp. 366-375.
Untangling compound documents on the web, Nadav Eiron, Kevin S. McCurley, Hypertext, 2003, pp. 85-94.
Self-similarity in the web, Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, ACM Trans. Internet Techn., vol. 2 (2002), pp. 205-223.
An adaptive model for optimizing performance of an incremental web crawler, Jenny Edwards, Kevin S. McCurley, John A. Tomlin, WWW, 2001, pp. 106-113.
Geospatial mapping and navigation of the web, Kevin S. McCurley, WWW, 2001, pp. 221-229.
Self-similarity in the Web, Stephen Dill, Ravi Kumar, Kevin S. McCurley, Sridhar Rajagopalan, D. Sivakumar, Andrew Tomkins, VLDB, 2001, pp. 69-78.
Surfing the Web Backwards, Soumen Chakrabarti, David Gibson, Kevin S. McCurley, Computer Networks, vol. 31 (1999), pp. 1679-1693.
Advances in Cryptology 1981-1997, Electronic Proceedings and Index of the CRYPTO and EUROCRYPT Conferences 1981-1997, Kevin S. McCurley, Claus Dieter Ziegler, 1998.
Cryptography and the Internet: Lessons and Challenges, Kevin S. McCurley, ASIACRYPT, 1996, pp. 50-56.
Lattice sieving and trial division, Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley, ANTS, 1994, pp. 18-27.
Open problems in number theoretic complexity, II, Leonard M. Adleman, Kevin S. McCurley, ANTS, 1994, pp. 291-322.
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring, Ernest F. Brickell, Kevin S. McCurley, J. Cryptology, vol. 5 (1992), pp. 29-39.
Fast Exponentiation with Precomputation (Extended Abstract), Ernest F. Brickell, Daniel M. Gordon, Kevin S. McCurley, David Bruce Wilson, EUROCRYPT, 1992, pp. 200-207.
Massively Parallel Computation of Discrete Logarithms, Daniel M. Gordon, Kevin S. McCurley, CRYPTO, 1992, pp. 312-323.
Asymptotically Fast Triangularization of Matrices Over Rings, Kevin S. McCurley, James L Hafner, SIAM J. Comput., vol. 20 (1991), pp. 1068-1083.
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring, Ernest F. Brickell, Kevin S. McCurley, EUROCRYPT, 1990, pp. 63-71.
Asymptotically Fast Triangularization of Matrices Over Rings, James L. Hafner, Kevin S. McCurley, SODA, 1990, pp. 194-200.
A Key Distribution System Equivalent to Factoring, Kevin S. McCurley, J. Cryptology, vol. 1 (1988), pp. 95-105.
Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields, Dennis Estes, Leonard M. Adleman, Kireeti Kompella, Kevin S. McCurley, Gary L. Miller, CRYPTO, 1985, pp. 3-13.