( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Cache-Oblivious Persistence.

, , , и . ESA, том 8737 из Lecture Notes in Computer Science, стр. 296-308. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Soner Özgür

Nevzat Özgür

Sevim Özgür

Enver Özgür

Ibrahim Özkan

 

Другие публикации лиц с тем же именем

Max-Throughput for (Conservative) k-of-n Testing., , и . ISAAC, том 7074 из Lecture Notes in Computer Science, стр. 703-713. Springer, (2011)Understanding Capacity-Driven Scale-Out Neural Recommendation Inference., , , , , , и . ISPASS, стр. 162-171. IEEE, (2021)Max-Throughput for (Conservative) k-of-n Testing., , и . Algorithmica, 77 (2): 595-618 (2017)Understanding Capacity-Driven Scale-Out Neural Recommendation Inference., , , , , , и . CoRR, (2020)The Complexity of Order Type Isomorphism., , , , и . SODA, стр. 405-415. SIAM, (2014)Mergeable Dictionaries., и . Data Structures, том 10091 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not., и . ICALP (1), том 8572 из Lecture Notes in Computer Science, стр. 637-649. Springer, (2014)Cache-Oblivious Persistence., , , и . ESA, том 8737 из Lecture Notes in Computer Science, стр. 296-308. Springer, (2014)Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas., , , , , , и . CCCG, (2011)How to Cover Most of a Point Set with a V-Shape of Minimum Width., , , и . CCCG, Carleton University, Ottawa, Canada, (2013)