Özgür Özkan

According to our database1, Özgür Özkan authored at least 11 papers between 2010 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Understanding Capacity-Driven Scale-Out Neural Recommendation Inference.
Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Software, 2021

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

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

The Complexity of Order Type Isomorphism.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Cache-Oblivious Persistence.
Proceedings of the Algorithms - ESA 2014, 2014

2013
The Complexity of Order Type Isomorphism.
CoRR, 2013

Establishing strong connectivity using optimal radius half-disk antennas.
Comput. Geom., 2013

Combining Binary Search Trees.
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.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2010
Mergeable Dictionaries.
Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010


  Loading...