PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Franceschini, Gianni"

Author of the publication

copydeleteadd this publication to your clipboard
Implicit B-trees: a new data structure for the dictionary problem.

, , , and . J. Comput. Syst. Sci., 68 (4): 788-807 (2004)

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.

No persons found for author name Franceschini, Gianni
add a person with the name Franceschini, Gianni
 

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)Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves.. Theory Comput. Syst., 40 (4): 327-353 (2007)Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing., , , , , and . CoRR, (2013)Optimal Cache-Aware Suffix Selection., , and . STACS, volume 3 of LIPIcs, page 457-468. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, (2009)Optimal Implicit Dictionaries over Unbounded Universes., and . Theory Comput. Syst., 39 (2): 321-345 (2006)Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time., and . SODA, page 670-678. ACM/SIAM, (2003)Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection, , and . CoRR, (2011)An in-place sorting with O(nlog n) comparisons and O(n) moves., and . J. ACM, 52 (4): 515-537 (2005)An In-Place Sorting with O(n log n) Comparisons and O(n) Moves, and . CoRR, (2003)In-Place Suffix Sorting., and . ICALP, volume 4596 of Lecture Notes in Computer Science, page 533-545. Springer, (2007)