Jump to content

John Iacono

From Wikipedia, the free encyclopedia

This is the current revision of this page, as edited by Edwardx (talk | contribs) at 10:27, 23 April 2023 (See MOS:INFONAT “Most biography infoboxes have nationality and citizenship. Generally, use of either should be avoided when the country to which the subject belongs can be inferred from the country of birth, as specified with |birthplace=."). The present address (URL) is a permanent link to this version.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
John Iacono
Born
Alma materStevens Institute of Technology
Rutgers University
AwardsSloan Fellowship
Scientific career
InstitutionsUniversité libre de Bruxelles
Doctoral advisorMichael Fredman
Websitehttp://johniacono.com

John Iacono is an American computer scientist specializing in data structures, algorithms and computational geometry. He is one of the inventors of the tango tree, the first known competitive binary search tree data structure.

Iacono obtained his M.S. at Stevens Institute of Technology and his Ph.D. in 2001 at Rutgers, the State University of New Jersey under the supervision of Michael Fredman.[1] He is a Sloan Research Fellow[2] and Fulbright Scholar.[3] Formerly a professor of computer science in the New York University Tandon School of Engineering, he now works as a professor at the Université libre de Bruxelles.[4]

References

[edit]
  1. ^ John Iacono at the Mathematics Genealogy Project.
  2. ^ "Sloan Fellowships Past Fellows". Archived from the original on 2018-03-14. Retrieved 2017-09-07.
  3. ^ John Iacono, Fulbright Scholars Program, retrieved 2018-09-03
  4. ^ Algorithms Research Group, ULB, retrieved 2018-09-03
[edit]