@inproceedings{aiello2000random, title = {A Random Graph Model for Massive Graphs}, author = {William Aiello and Fan Chung and Linyuan Lu}, booktitle = {Proc.\ 32nd Annual ACM Symposium on Theory of Computing}, pages = {171-180}, year = 2000, id = {922}, priority = {3}, biburl = {http://www.bibsonomy.org/bibtex/2137d21ac647079bb6abca8cdaa467e4d/schmitz}, keywords = {searchengine google pagerank} } @misc{haveliwala03second, title = {The second eigenvalue of the Google matrix}, author = {T. Haveliwala and S. Kamvar}, year = 2003, url = {citeseer.ist.psu.edu/haveliwala03second.html}, text = {T. H. Haveliwala and S. D. Kamvar. The second eigenvalue of the Google matrix. Stanford University Technical Report, 2003.}, description = {The Second Eigenvalue of the Google Matrix - Haveliwala, Kamvar (ResearchIndex)}, biburl = {http://www.bibsonomy.org/bibtex/2060fb6a057336a06d65a55344735e3f6/schmitz}, keywords = {google eigensystem eigenvalue pagerank} } @article{brin1998web, title = {The anatomy of a large-scale hypertextual Web search engine}, author = {Sergey Brin and Lawrence Page}, journal = {Computer Networks and ISDN Systems}, number = {1--7}, pages = {107--117}, volume = 30, year = 1998, url = {http://citeseer.ist.psu.edu/brin98anatomy.html}, id = {922}, keywords = {google pagerank searchengine}, priority = {3}, 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}, biburl = {http://www.bibsonomy.org/bibtex/21779c82bd34bbf1ca62956d136a22adf/schmitz}, keywords = {pagerank google ranking} }