I am currently a Research Assistant Professor in the Computer Science and Engineering department at NYU School of Engineering. My research interests broadly lie in the design and analysis of algorithms and data structures. I studied fundamental data structuring problems and their amortized complexity for my dissertation. My current work focuses on algorithmic problems arising in information retrieval, cache-efficient algorithm design, and dynamic graph algorithms.
Document Routing and Index Reorganization Strategies in Distributed Search Engines
Constantinos Dimopoulos, Özgür Özkan, Abrar Sheikh, and Torsten Suel.
A Tight Lower Bound for Decrease-Key in the Pure Heap Model
John Iacono and Özgür Özkan.
Pooya Davoodi, Jeremy T. Fineman, John Iacono, and Özgür Özkan.
Proceedings of the 22nd Annual European Symposium on Algorithms (ESA 2014).
Winner of the Best Paper Award.
(Also presented at the 6th Workshop on Massive Data Algorithmics -- MASSIVE 2014.)
Why some heaps support constant-amortized-time decrease-key operations, and others do not
John Iacono and Özgür Özkan
Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP 2014).
The Complexity of Order Type Isomorphism
Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, and Stefanie Wuhrer.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014).
Finding the Thinnest V-shape with Few Outliers.
Boris Aronov, John Iacono, Özgür Özkan, and Mark Yagnatinsky.
Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013).
A preliminary version appeared In the 22nd Annual Fall Workshop on Computational Geometry (FWCG 2012).
Combining Binary Search Trees
Erik Demaine, John Iacono, Stefan Langerman, and Özgür Özkan.
Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013).
Locating a Line at Unit Distance with Two Agents.
Greg Aloupis, John Iacono, Jonathan Lenchner, and Özgür Özkan.
In the Thailand-Japan Joint Conference on Computational Geometry and Graphs (TJJCCGG 2012).
Order Type Invariant Labeling and Comparison of Point Sets
Greg Aloupis, Muriel Dulieu, John Iacono, Stefan Langerman, Özgür Özkan, Suneeta Ramaswami, and Stefanie Wuhrer.
In the 28th European Workshop on Computational Geometry (EuroCG 2012).
Max-Throughput for (Conservative) k-of-n Testing
Lisa Hellerstein, Özgür Özkan, and Linda Sellie.
Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC 2011).
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas
Greg Aloupis, Mirela Damian, Robin Flatland, Matias Korman, Özgür Özkan, David Rappaport, and Stefanie Wuhrer.
Computational Geometry Volume 46, Issue 3, April 2013, Pages 328–339 (CGTA)
A preliminary version appeared in the Proceedings of the 23rd Canadian Conference on Computational Geometry (CCCG 2011).
John Iacono and Özgür Özkan.
Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 2010).