John Iacono
| John Iacono | |
|---|---|
| Born | Livingston, New Jersey, USA |
| Residence |
 |
| Nationality |
|
| Alma mater |
Stevens Institute of Technology Rutgers University |
| Awards | Sloan Fellowship |
| Scientific career | |
| Institutions | Polytechnic Institute of NYU |
| Doctoral advisor | Michael Fredman |
| Website | http://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 Polytechnic Institute of New York University, he now works as a professor at the Université libre de Bruxelles.[4]
References
- ↑ John Iacono at the Mathematics Genealogy Project.
- ↑ Sloan Fellowships Past Fellows
- ↑ John Iacono, Fulbright Scholars Program, retrieved 2018-09-03
- ↑ Algorithms Research Group, ULB, retrieved 2018-09-03
External links
- Personal web page
- John Iacono publications indexed by Google Scholar
This article is issued from
Wikipedia.
The text is licensed under Creative Commons - Attribution - Sharealike.
Additional terms may apply for the media files.