( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves.

. Theory of Computing Systems, 41 (1): 327 - 353 (2007)

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.

Gianni Capalbo

Romain Franceschini

Aggy Gianni

Gianni Bomio

Gianni Brada

 

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

Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing., , , , , и . CoRR, (2013)Decomposition of k-Dense Trees., , , и . WDAS, том 9 из Proceedings in Informatics, стр. 11-23. Carleton Scientific, (2000)Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves.. Theory of Computing Systems, 41 (1): 327 - 353 (2007)Optimal Cache-Aware Suffix Selection., , и . STACS, том 3 из LIPIcs, стр. 457-468. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Implicit B-trees: a new data structure for the dictionary problem., , , и . J. Comput. Syst. Sci., 68 (4): 788-807 (2004)Optimal suffix selection., и . STOC, стр. 328-337. ACM, (2007)Implicit B-Trees: New Results for the Dictionary Problem., , , и . FOCS, стр. 145-154. IEEE Computer Society, (2002)Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees., и . WADS, том 2748 из Lecture Notes in Computer Science, стр. 114-126. Springer, (2003)Optimal In-place Sorting of Vectors and Records., и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 90-102. Springer, (2005)Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time., и . SODA, стр. 670-678. ACM/SIAM, (2003)