@article{haveliwala8090seg, author = {Haveliwala, T.H. and Kamvar, S.D.}, interhash = {0d40b575bd05c58b401f7a78ad3d4627}, intrahash = {bc3bddcd6ea80eea5716492751bdff36}, journal = {A Stanford University Technical Report http://dbpubs. stanford. edu}, title = {{The second eigenvalue of the Google matrix}}, year = 2003 } @article{chebolu2008pagerank, author = {Chebolu, P. and Melsted, P.}, booktitle = {Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms}, interhash = {b186427a40b0af4a6414d82f0040613f}, intrahash = {742b675a09d540687fc2c352a883d501}, organization = {Society for Industrial and Applied Mathematics Philadelphia, PA, USA}, pages = {1010--1018}, title = {{PageRank and the random surfer model}}, url = {http://scholar.google.de/scholar.bib?q=info:f7YaFVQIaeIJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=2}, year = 2008 } @article{aiello2000random, author = {Aiello, W. and Chung, F. and Lu, L.}, booktitle = {Proceedings of the thirty-second annual ACM symposium on Theory of computing}, interhash = {fc01c77b63e8bc0367d4281e6f7722fc}, intrahash = {bbf5b80f716eacb6e82ffc4e389e8d2b}, organization = {ACM New York, NY, USA}, pages = {171--180}, title = {{A random graph model for massive graphs}}, url = {http://scholar.google.de/scholar.bib?q=info:iG723gINfRAJ:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, year = 2000 } @inproceedings{Brin98theanatomy, abstract = {In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://infolab.stanford.edu/~backrub/google.html To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -- the first such detailed public description w...}, author = {Brin, Sergey and Page, Lawrence}, booktitle = {Computer Networks and ISDN Systems}, interhash = {1234ad3633d435ef79d8a7f36dafa0a9}, intrahash = {418d0096690f6320d81f3b07f0c77ed0}, pages = {107--117}, title = {The Anatomy of a Large-Scale Hypertextual Web Search Engine}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.3243}, year = 1998 } @article{langville2004deeper, author = {Langville, A.N. and Meyer, C.D.}, interhash = {ee90e6dabf6645028ff3905a6fea3356}, intrahash = {61853f1132a86f31923ec41fffef7924}, journal = {Internet Mathematics}, number = 3, pages = {335--380}, publisher = {AK Peters}, title = {{Deeper inside pagerank}}, url = {http://scholar.google.de/scholar.bib?q=info:2bjOOHLGPW8J:scholar.google.com/&output=citation&hl=de&ct=citation&cd=0}, volume = 1, year = 2004 }