( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Proximate point searching.

, , и . CCCG, стр. 1-4. (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

 

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

A Tight Lower Bound for Decrease-Key in the Pure Heap Model., и . CoRR, (2014)Entropy, Triangulation, and Point Location in Planar Subdivisions, , , , и . CoRR, (2009)Spanning Properties of Theta-Theta-6., , и . CoRR, (2018)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)Key Independent Optimality.. ISAAC, том 2518 из Lecture Notes in Computer Science, стр. 25-31. Springer, (2002)Range Minimum Query Indexes in Higher Dimensions., , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 149-159. Springer, (2015)Grid Vertex-Unfolding Orthostacks., , и . JCDCG, том 3742 из Lecture Notes in Computer Science, стр. 76-82. Springer, (2004)Alternatives to splay trees with O(log n) worst-case access times.. SODA, стр. 516-522. ACM/SIAM, (2001)External Memory Planar Point Location with Fast Updates., , и . ISAAC, том 149 из LIPIcs, стр. 58:1-58:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Competitive Online Search Trees on Trees., , , , и . ACM Trans. Algorithms, 19 (3): 25:1-25:19 (июля 2023)