( en | de | ru )

 

Disambiguation of "Franceschini, Gianni"

Author of the publication

copydeleteadd this publication to your clipboard
Decomposition of k-Dense Trees.

, , , and . WDAS, volume 9 of Proceedings in Informatics, page 11-23. Carleton Scientific, (2000)

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. You can also use the button next to the name to display some publications already assigned to the person.

Gianni Capalbo

Romain Franceschini

Aggy Gianni

Gianni Bomio

Gianni Brada

 

Other publications of authors with the same name

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