When.com Web Search

  1. Ad

    related to: algorithms part i and ii princeton university download

Search results

  1. Results From The WOW.Com Content Network
  2. Bernard Chazelle - Wikipedia

    en.wikipedia.org/wiki/Bernard_Chazelle

    Bernard Chazelle (born November 5, 1955) is a French computer scientist.He is the Eugene Higgins Professor of Computer Science at Princeton University.Much of his work is in computational geometry, where he is known for his study of algorithms, such as linear-time triangulation [2] of a simple polygon, as well as major complexity results, such as lower bound techniques based on discrepancy ...

  3. Robert Sedgewick (computer scientist) - Wikipedia

    en.wikipedia.org/wiki/Robert_Sedgewick_(computer...

    Robert Sedgewick (born December 20, 1946) is an American computer scientist.He is the founding chair and the William O. Baker Professor in Computer Science at Princeton University [1] and was a member of the board of directors of Adobe Systems (1990–2016). [2]

  4. Richard E. Stearns - Wikipedia

    en.wikipedia.org/wiki/Richard_E._Stearns

    Richard Edwin Stearns (born July 5, 1936) is an American computer scientist who, with Juris Hartmanis, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory". [1]

  5. 9 Algorithms That Changed the Future - Wikipedia

    en.wikipedia.org/wiki/9_Algorithms_that_Changed...

    Download as PDF; Printable version; In other projects ... Algorithm: Publisher: Princeton University Press: ... The book has been re-released by Princeton University ...

  6. Category:Princeton University Press books - Wikipedia

    en.wikipedia.org/wiki/Category:Princeton...

    Download as PDF; Printable version; ... Pages in category "Princeton University Press books" ... 0–9. 9 Algorithms That Changed the Future; 1177 B.C.: The Year ...

  7. Computational number theory - Wikipedia

    en.wikipedia.org/wiki/Computational_number_theory

    In mathematics and computer science, computational number theory, also known as algorithmic number theory, is the study of computational methods for investigating and solving problems in number theory and arithmetic geometry, including algorithms for primality testing and integer factorization, finding solutions to diophantine equations, and explicit methods in arithmetic geometry. [1]

  8. Avi Wigderson - Wikipedia

    en.wikipedia.org/wiki/Avi_Wigderson

    Avi Wigderson (Hebrew: אבי ויגדרזון; born 9 September 1956 [1]) is an Israeli computer scientist and mathematician.He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey, United States of America. [2]

  9. Adji Bousso Dieng - Wikipedia

    en.wikipedia.org/wiki/Adji_Bousso_Dieng

    At Princeton University, Dieng founded the Vertaix research lab, which focuses on the intersection of artificial intelligence (AI) and the natural sciences. The models and algorithms developed are motivated by problems in those domains and contribute to advancing methodological research in AI.