Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Author="{\"O}zkan, {\"O}zg{\"u}r"

• Cache-oblivious persistence
  Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan
  Lecture Notes in Computer Science 8737, 2014, pp. 296-308
• Why some heaps support constant-amortized-time decrease-key operations, and others do not
  John Iacono, Özgür Özkan
  Lecture Notes in Computer Science 8572, 2014, pp. 637-649
• Combining binary search trees
  Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
  Lecture Notes in Computer Science 7965, 2013, pp. 388-399
• Max-throughput for (conservative) k-of-n testing
  Lisa Hellerstein, Özgür Özkan, Linda Sellie
  Lecture Notes in Computer Science 7074, 2011, pp. 703-713
• Mergeable dictionaries
  John Iacono, Özgür Özkan
  Lecture Notes in Computer Science 6198, 2010, pp. 164-175