( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A locality-preserving cache-oblivious dynamic dictionary.

, , , и . SODA, стр. 29-38. ACM/SIAM, (2002)

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.

Ezio Iacono

Francesca Iacono

Luigi Lo Iacono

Luisa Lo Iacono

Luigi Lo Iacono

 

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

Wrapping spheres with flat paper., , , и . Comput. Geom., 42 (8): 748-757 (2009)Mergeable Dictionaries., и . Data Structures, том 10091 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Competitive Online Search Trees on Trees., , , , и . SODA, стр. 1878-1891. SIAM, (2020)The Complexity of Order Type Isomorphism., , , , и . SODA, стр. 405-415. SIAM, (2014)Range Minimum Query Indexes in Higher Dimensions., , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 149-159. Springer, (2015)Key Independent Optimality.. ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 25-31. Springer, (2002)Grid Vertex-Unfolding Orthostacks., , и . JCDCG, том 3742 из Lecture Notes in Computer Science, стр. 76-82. Springer, (2004)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)Alternatives to splay trees with O(log n) worst-case access times.. SODA, стр. 516-522. ACM/SIAM, (2001)Subquadratic Encodings for Point Configurations., , , , и . SoCG, том 99 из LIPIcs, стр. 20:1-20:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)