Understanding capacity-driven scale-out neural recommendation inference M Lui, Y Yetim, Ö Özkan, Z Zhao, SY Tsai, CJ Wu, M Hempstead 2021 IEEE International Symposium on Performance Analysis of Systems and …, 2021 | 42 | 2021 |
The complexity of order type isomorphism G Aloupis, J Iacono, S Langerman, Ö Ozkan, S Wuhrer Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014 | 16 | 2014 |
Combining binary search trees ED Demaine, J Iacono, S Langerman, Ö Özkan International Colloquium on Automata, Languages, and Programming, 388-399, 2013 | 14 | 2013 |
Mergeable dictionaries J Iacono, Ö Özkan International Colloquium on Automata, Languages, and Programming, 164-175, 2010 | 12 | 2010 |
A tight lower bound for decrease-key in the pure heap model J Iacono, Ö Özkan arXiv preprint arXiv:1407.6665, 2014 | 11 | 2014 |
Establishing strong connectivity using optimal radius half-disk antennas G Aloupis, M Damian, R Flatland, M Korman, Ö Özkan, D Rappaport, ... Computational Geometry 46 (3), 328-339, 2013 | 11 | 2013 |
Why some heaps support constant-amortized-time decrease-key operations, and others do not J Iacono, Ö Özkan International Colloquium on Automata, Languages, and Programming, 637-649, 2014 | 10 | 2014 |
Max-Throughput for (Conservative) k-of-n Testing L Hellerstein, Ö Özkan, L Sellie Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011 | 5* | 2011 |
Cache-oblivious persistence P Davoodi, JT Fineman, J Iacono, Ö Özkan Algorithms-ESA 2014: 22th Annual European Symposium, Wroclaw, Poland …, 2014 | 2 | 2014 |
How to Cover Most of a Point Set with a V-Shape of Minimum Width. B Aronov, J Iacono, Ö Özkan, MV Yagnatinsky CCCG, 2013 | 1 | 2013 |