◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Özgür Özkan

6 papers hereh-index 8146 citations23 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author3

Across the 4 of 6 papers where every author was matched, so the position is known.

fields
  • cs.DS5
  • cs.CG1
same name
  • Özgür Özkan — 1 paper, h 6
  • Özgür Özkan — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20102014
most citedA Tight Lower Bound for Decrease-Key in the Pure Heap Model

2 citations · 7 across the 6 of their papers we have counts for

collaborators
Showing 2013 · cs.DSShow all

1 paper · 2 filters

cs.DS2013

Why some heaps support constant-amortized-time decrease-key operations, and others do not

John Iacono

A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Omega(log log n / log log log n) amortized time on th…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.