User:Tapdncingchemist/John Iacono
John Iacono (born May 19, 1974), is an associate professor of the Department of Computer Science and Engineering at the Polytechnic Institute of New York University. His research is in theoretical computer science and focuses on data structures and computational geometry.
John Iacono | |
|---|---|
| Born | May 19, 1974 |
| Nationality | American |
| Alma mater | Stevens Institute of Technology Rutgers University |
| Scientific career | |
| Institutions | Polytechnic Institute of New York University |
| Doctoral students | Ozgur Ozkan Dania El-Khechen |
| Website | http://john.poly.edu |
Education
Iacono earned a Bachelor of Science in Computer Science from the Stevens Institute of Technology in 1996 with a minor in History. He simultaneously earned a Master of Science in Computer Science with a focus on theoretical computer science, also finishing in 1996.[1]
He then completed is Doctor of Philosophy in Computer Science at Rutgers University, New Brunswick under the supervision of Michael Fredman in 2001. [1] [2]
Research
Iacono's work is focused primarily on data structures. He is most known for his Working Set Structure, Tango Trees, Retroactive data structures, and Queaps.
Awards
He was awarded a Sloan Fellowship in 2006.[3] His paper, Key-Independent Optimality, won the best paper award at ISAAC 2002.