Welcome to MedLibrary.org. For best results, we recommend beginning with the navigation links at the top of the page, which can guide you through our collection of over 14,000 medication labels and package inserts. For additional information on other topics which are not covered by our database of medications, just enter your topic in the search box below:
|Alma mater||Cornell University
Massachusetts Institute of Technology
|Notable awards||MacArthur Fellowship (2005)
Nevanlinna Prize (2006)
ACM-Infosys Foundation Award (2008)
Jon Kleinberg was born in 1971 in Boston, Massachusetts. He received a B.S. in computer science from Cornell University in 1993 and a Ph.D., also in computer science, from MIT in 1996. Since 1996 he has been a professor in the Department of Computer Science at Cornell, as well as a visiting scientist at IBM's Almaden Research Center. His work has been supported by an NSF Career Award, an ONR Young Investigator Award, a MacArthur Foundation Fellowship, a Packard Foundation Fellowship, a Sloan Foundation Fellowship, and grants from Google, Yahoo!, and the NSF. He is a member of the National Academy of Engineering and the American Academy of Arts and Sciences. In 2011, he was elected to the United States National Academy of Sciences.
Kleinberg is best known for his work on networks and particularly for his HITS algorithm, developed while he was at IBM. HITS is an algorithm for web search that builds on the eigenvector-based methods used in algorithms and served as the full scale model for PageRank by recognizing that web pages or sites should be considered important not only if they are linked to by many others (as in PageRank), but also if they link to many others. Search engines themselves are examples of sites that are important because they link to many others. Kleinberg realized that this generalization implies two different classes of important web pages, which he called "hubs" and "authorities". The HITS algorithm is an algorithm for automatically identifying the leading hubs and authorities in a network of hyperlinked pages.
Kleinberg is also known for his work on algorithmic aspects of the small world experiment. He was one of the first to realize that Stanley Milgram's famous "six degrees" letter-passing experiment implied not only that there are short paths between individuals in social networks but also that people seem to be good at finding those paths, an apparently simple observation that turns out to have profound implications for the structure of the networks in question.
Kleinberg has written numerous papers and articles as well as a textbook on computer algorithms, Algorithm Design, co-authored with Éva Tardos. Among other honors, he received a MacArthur Foundation Fellowship also known as the "genius grant" in 2005 and the Nevanlinna Prize in 2006, an award that is given out once every four years along with the Fields Medal as the premier distinction in Computational Mathematics . His new book is entitled "Networks, Crowds, and Markets: Reasoning About a Highly Connected World", published by Cambridge University Press in 2010.
- Kleinberg is affectionately called the "Rebel King" by students (an anagram for "Kleinberg").
- Jon Kleinberg's popularity among students is due in part to his excellence in teaching, which was formally recognized when Cornell's Association of Computer Science Undergraduates awarded him the "Faculty of the Year" award in 2002.
- J. M. Kleinberg (1999). "Authoritative sources in a hyperlinked environment". Journal of the Association for Computing Machinery 46 (5): 604–632. doi:10.1145/324133.324140.
- J. M. Kleinberg (2000). "Navigation in a small world". Nature 406 (6798): 845. doi:10.1038/35022643. PMID 10972276.
- Kleinberg, Jon; Éva Tardos (2006). Algorithm Design. Addison–Wesley, Boston. ISBN 0-321-29535-8 [Amazon-US | Amazon-UK].
- Home page at Cornell
- MacArthur Fellowship biography page
- Still the Rebel King -Video
- Interview with Jon Kleinberg, ACM Infosys Foundation Award recipient by Stephen Ibaraki
- Yury Lifshits, Four Results of Jon Kleinberg: a talk for St. Petersburg Mathematical Society
- Greuel, Gert-Martin; Hopcroft, John E.; Wright, Margaret H. (June/July 2007). "The Mathematical Work of Jon Kleinberg" (PDF). Notices of the American Mathematical Society 54 (6): pp.740–743. Retrieved 2008-01-15.