Özgür Özkan

According to our database¹, Özgür Özkan authored at least 11 papers between 2010 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of two.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

The Complexity of Order Type Isomorphism.

[BibT_eX]

[DOI]

Discret. Comput. Geom., September, 2024

2021

Understanding Capacity-Driven Scale-Out Neural Recommendation Inference.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2021

2017

Max-Throughput for (Conservative) k-of-n Testing.

[BibT_eX]

[DOI]

Lisa Hellerstein

Özgür Özkan

Linda Sellie

Algorithmica, 2017

2014

A Tight Lower Bound for Decrease-Key in the Pure Heap Model.

[BibT_eX]

[DOI]

John Iacono

Özgür Özkan

CoRR, 2014

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.

[BibT_eX]

[DOI]

John Iacono

Özgür Özkan

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Cache-Oblivious Persistence.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2014, 2014

2013

The Complexity of Order Type Isomorphism.

[BibT_eX]

[DOI]

CoRR, 2013

Establishing strong connectivity using optimal radius half-disk antennas.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Combining Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

How to Cover Most of a Point Set with a V-Shape of Minimum Width.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2010

Mergeable Dictionaries.

[BibT_eX]

[DOI]

John Iacono

Özgür Özkan

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Özgür Özkan

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...