![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Özgür Özkan
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [c9]Michael Lui, Yavuz Yetim, Özgür Özkan, Zhuoran Zhao, Shin-Yeh Tsai, Carole-Jean Wu, Mark Hempstead:
Understanding Capacity-Driven Scale-Out Neural Recommendation Inference. ISPASS 2021: 162-171 - 2020
- [i8]Michael Lui, Yavuz Yetim, Özgür Özkan, Zhuoran Zhao, Shin-Yeh Tsai, Carole-Jean Wu, Mark Hempstead:
Understanding Capacity-Driven Scale-Out Neural Recommendation Inference. CoRR abs/2011.02084 (2020)
2010 – 2019
- 2017
- [j2]Lisa Hellerstein, Özgür Özkan, Linda Sellie:
Max-Throughput for (Conservative) k-of-n Testing. Algorithmica 77(2): 595-618 (2017) - 2014
- [c8]Pooya Davoodi, Jeremy T. Fineman, John Iacono
, Özgür Özkan:
Cache-Oblivious Persistence. ESA 2014: 296-308 - [c7]John Iacono, Özgür Özkan:
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ICALP (1) 2014: 637-649 - [c6]Greg Aloupis, John Iacono
, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. SODA 2014: 405-415 - [i7]Pooya Davoodi, Jeremy T. Fineman, John Iacono
, Özgür Özkan:
Cache-Oblivious Persistence. CoRR abs/1402.5492 (2014) - [i6]John Iacono, Özgür Özkan:
A Tight Lower Bound for Decrease-Key in the Pure Heap Model. CoRR abs/1407.6665 (2014) - 2013
- [j1]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing strong connectivity using optimal radius half-disk antennas. Comput. Geom. 46(3): 328-339 (2013) - [c5]Boris Aronov, John Iacono, Özgür Özkan, Mark V. Yagnatinsky:
How to Cover Most of a Point Set with a V-Shape of Minimum Width. CCCG 2013 - [c4]Erik D. Demaine, John Iacono
, Stefan Langerman
, Özgür Özkan:
Combining Binary Search Trees. ICALP (1) 2013: 388-399 - [i5]Erik D. Demaine, John Iacono
, Stefan Langerman, Özgür Özkan:
Combining Binary Search Trees. CoRR abs/1304.7604 (2013) - [i4]Greg Aloupis, John Iacono
, Stefan Langerman, Özgür Özkan:
The Complexity of Order Type Isomorphism. CoRR abs/1311.0928 (2013) - 2011
- [c3]Greg Aloupis, Mirela Damian, Robin Y. Flatland, Matias Korman, Özgür Özkan, David Rappaport, Stefanie Wuhrer:
Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas. CCCG 2011 - [c2]Lisa Hellerstein, Özgür Özkan, Linda Sellie:
Max-Throughput for (Conservative) k-of-n Testing. ISAAC 2011: 703-713 - [i3]Lisa Hellerstein, Özgür Özkan, Linda Sellie:
Max-Throughput for (Conservative) k-of-n Testing. CoRR abs/1109.3401 (2011) - 2010
- [c1]John Iacono, Özgür Özkan:
Mergeable Dictionaries. ICALP (1) 2010: 164-175 - [i2]John Iacono, Özgür Özkan:
Mergeable Dictionaries. Data Structures 2010 - [i1]John Iacono, Özgür Özkan:
Mergeable Dictionaries. CoRR abs/1002.4248 (2010)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint