John Iacono
| John Iacono | |
|---|---|
| Born | Livingston, New Jersey, USA |
| Residence |
 U.S. |
| Nationality |
American |
| Institutions | Polytechnic Institute of NYU |
| Alma mater |
Stevens Institute of Technology Rutgers University |
| Doctoral advisor | Michael Fredman |
| Notable awards | Sloan Fellowship |
|
Website http://johniacono.com | |
John Iacono is an American computer scientist in the department of Computer Science and Engineering of the Polytechnic Institute of New York University in Brooklyn, New York, United States. He 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. John Iacono specializes in Data Structures, Algorithms and Computational Geometry. He is most known for his work on distribution-sensitive data structures and being one of the inventors of the Tango tree, which is the first known competitive Binary search tree data structure.
References
External links
This article is issued from Wikipedia - version of the 11/30/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.