Skip to content
Surf Wiki
Save to docs
general

From Surf Wiki (app.surf) — the open knowledge base

Marc Najork


Marc-Alexander Najork
(1963-08-14)August 14, 1963Frankfurt, Germany
Ph.D.
University of Illinois Urbana-Champaign, Technische Universität Darmstadt
Information retrieval, web search
Scientific career
Computer science
Google DeepMind, Google Research, Microsoft Research Silicon Valley, Compaq, Digital Equipment Corporation
Programming in Three Dimensions (1994)
Simon M. Kaplan
https://marc.najork.org

Marc-Alexander Najork is a distinguished research scientist at Google DeepMind working on generative artificial intelligence. His career spans research at Google Research, Microsoft Research and DEC Systems Research Center on data retrieval, link-based ranking algorithms, detection of spam websites, a distributed web crawler, and a scripting system for 3D animations, among others. He has served in several leadership positions for publications and conferences of the Association for Computing Machinery. He has coauthored over a hundred research papers and holds over 40 US patents. He is an IEEE Fellow, ACM Fellow, AAAS Fellow, and AAIA Fellow.

Marc graduated with a diplom in wirtschaftsinformatik from Technische Universität Darmstadt in 1989. He completed his Ph.D. in computer science at University of Illinois Urbana-Champaign. Overseen by Simon M. Kaplan, his thesis was on Cube, "the first visual language to employ a three-dimensional syntax." The programming language was also supported by a grant from the National Science Foundation.

In 1993, Marc joined Digital Equipment Corporation which was later merged with Compaq. One of his contributions was to Mercator, an extendable, Java-based, high-performance web crawler which was integrated into AltaVista in 2001. Marc Najork and Marc Brown were the main contributors to JCAT, a Java-based algorithm animation system with classroom applications. Luca Cardelli developed Obliq, which Marc used to make Obliq-3D, a fast-turnaround 3D animation system.

In 2001, he joined Microsoft Research Silicon Valley. He contributed to Boxwood, a distributed, scalable B-tree which serves as a foundation for storage infrastructure. The creation of PageTurner, with Dennis Fetterly and Mark Manasse, was designed to study the evolution of webpages. They also found that past behavior of changes in websites was indicative of future changes on that site. Further study of the data showed that statistical anomalies were a good predictor of spam, which led Microsoft to file a patent later used by Microsoft Bing. Marc also developed the Scalable Hyperlink Store, which is a scalable, fault-tolerant, and incrementally updateable database for storing large portions of a webgraph in memory.

He joined the Personal Search Infrastructure team at Google in 2014 where he worked on HappyHour, a processing and serving system for structured personal data. He then became a senior director of research engineering at Google Research where he managed a team advancing the state of the art in information retrieval. Marc then became a distinguished research scientist at Google Deepmind where he works on generative artificial intelligence.

Marc was along the inaugural inductees of the ACM SIGIR Academy. He is also an IEEE Fellow, ACM Fellow, AAAS Fellow, and AAIA Fellow.

Marc served both as an associate editor and editor-in-chief of ACM Transactions on the Web, served as co-chair of the news section of the Communications of the ACM, and sits on the ACM Publications Board. He was conference chair of WSDM 2008 and program co-chair of WSDM 2025 with Cha Meeyoung and Marie-Francine Moens. In The Web Conference series, he was program co-chair of WWW 2004 and WWW 2021. Along with Yoelle Maarek, Marc is a co-chair of the SIGIR Academy 2025 Selection Committee. Marc will be co-chairs with Hannah Bast and Min Zhang for SIGIR 2026.

  • .mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"""""""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/6/65/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/d/d6/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/a/aa/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/4/4c/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#bf3c2c)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#bf3c2c)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}Ntoulas, Alexandros; Najork, Marc; Manasse, Mark; Fetterly, Dennis (23 May 2006). "Detecting spam web pages through content analysis". Proceedings of the 15th international conference on World Wide Web. pp. 83–92. doi:10.1145/1135777.1135794. ISBN 1-59593-323-9.

  • Heydon, Allan; Najork, Marc (December 1999). "Mercator: A Scalable, Extensible Web Crawler". World Wide Web. 2 (4): 219–229. doi:10.1023/A:1019213109274.

  • Fetterly, Dennis; Manasse, Mark; Najork, Marc; Wiener, Janet (20 May 2003). "A large-scale study of the evolution of web pages". Proceedings of the twelfth international conference on World Wide Web - WWW '03. pp. 669–678. doi:10.1145/775152.775246. ISBN 1-58113-680-3.

  • Olston, Christopher; Najork, Marc (11 February 2010). "Web Crawling". Foundations and Trends in Information Retrieval. 4 (3): 175–246. doi:10.1561/1500000017 (inactive 15 March 2026).{{cite journal}}: CS1 maint: DOI inactive as of March 2026 (link)

  • Najork, Marc; Wiener, Janet L. (1 April 2001). "Breadth-first crawling yields high-quality pages". Proceedings of the 10th international conference on World Wide Web. pp. 114–118. doi:10.1145/371920.371965. ISBN 1-58113-348-0.

  • Wang, Xuanhui; Golbandi, Nadav; Bendersky, Michael; Metzler, Donald; Najork, Marc (2018). "Position Bias Estimation for Unbiased Learning to Rank in Personal Search". Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining. pp. 610–618. doi:10.1145/3159652.3159732. ISBN 978-1-4503-5581-0.

  • Metzler, Donald; Tay, Yi; Bahri, Dara; Najork, Marc (16 July 2021). "Rethinking Search: Making Domain Experts Out of Dilettantes". ACM SIGIR Forum. 55 (1): 1–27. doi:10.1145/3476415.3476428.

  • Andrei Broder

  • Monika Henzinger

  • Michael Mitzenmacher

  • Krishna Bharat

  • Héctor García-Molina

  • Atrax, a distributed web crawler Interview at Microsoft, 2001

  • The Scalable Hyperlink Store Talk at Microsoft Research Cambridge, 2005

  • Марк Найорк о прошлом и будущем поиска English language interview on YouTube conducted at European Conference on Information Retrieval, 2013

  • KDD 2025 - Applied Data Science Invited Speakers: Marc Najork Talk at KDD, 2025

Want to explore this topic further?

Ask Mako anything about Marc Najork — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report