Gianni Franceschini

2009
27	EE	Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Optimal Cache-Aware Suffix Selection. STACS 2009: 457-468
26	EE	Gianni Franceschini, Roberto Grossi, S. Muthukrishnan: Optimal cache-aware suffix selection CoRR abs/0902.1737: (2009)
2008
25	EE	Gianni Franceschini, Roberto Grossi: No sorting? better searching!. ACM Transactions on Algorithms 4(1): (2008)
2007
24	EE	Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting with No Extra Space. ESA 2007: 194-205
23	EE	Gianni Franceschini, S. Muthukrishnan: In-Place Suffix Sorting. ICALP 2007: 533-545
22	EE	Gianni Franceschini, S. Muthukrishnan: Optimal suffix selection. STOC 2007: 328-337
21	EE	Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting With No Extra Space CoRR abs/0706.4107: (2007)
20	EE	Gianni Franceschini: Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves. Theory Comput. Syst. 40(4): 327-353 (2007)
2006
19	EE	Gianni Franceschini, J. Ian Munro: Implicit dictionaries with O(1) modifications per update and fast search. SODA 2006: 404-413
18	EE	Gianni Franceschini: Sorting by Merging or Merging by Sorting? SWAT 2006: 77-89
17	EE	Gianni Franceschini, Fabrizio Luccio, Linda Pagli: Dense trees: a new look at degenerate graphs. J. Discrete Algorithms 4(3): 455-474 (2006)
16	EE	Gianni Franceschini, Roberto Grossi: Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput. Syst. 39(2): 321-345 (2006)
2005
15	EE	Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro: Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316
14	EE	Gianni Franceschini, Roberto Grossi: Optimal In-place Sorting of Vectors and Records. ICALP 2005: 90-102
13	EE	Gianni Franceschini: Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves. STACS 2005: 629-640
12	EE	Gianni Franceschini, Viliam Geffert: An in-place sorting with O(nlog n) comparisons and O(n) moves. J. ACM 52(4): 515-537 (2005)
2004
11	EE	Gianni Franceschini, Roberto Grossi: No Sorting? Better Searching! FOCS 2004: 491-498
10	EE	Gianni Franceschini, Roberto Grossi: A General Technique for Managing Strings in Comparison-Driven Data Structures. ICALP 2004: 606-617
9	EE	Gianni Franceschini: Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. SODA 2004: 291-299
8	EE	Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli: Implicit B-trees: a new data structure for the dictionary problem. J. Comput. Syst. Sci. 68(4): 788-807 (2004)
2003
7	EE	Gianni Franceschini, Viliam Geffert: An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. FOCS 2003: 242-250
6	EE	Gianni Franceschini, Roberto Grossi: Optimal Cache-Oblivious Implicit Dictionaries. ICALP 2003: 316-331
5	EE	Gianni Franceschini, Roberto Grossi: Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. SODA 2003: 670-678
4	EE	Gianni Franceschini, Roberto Grossi: Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. WADS 2003: 114-126
3	EE	Gianni Franceschini, Viliam Geffert: An In-Place Sorting with O(n log n) Comparisons and O(n) Moves CoRR cs.DS/0305005: (2003)
2002
2	EE	Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli: Implicit B-Trees: New Results for the Dictionary Problem. FOCS 2002: 145-154
2000
1		Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli: Decomposition of k-Dense Trees. WDAS 2000: 11-23

Coauthor Index

1	Arash Farzan	[15]
2	Paolo Ferragina	[15]
3	Viliam Geffert	[3] [7] [12]
4	Roberto Grossi	[2] [4] [5] [6] [8] [10] [11] [14] [16] [25] [26] [27]
5	Fabrizio Luccio	[1] [17]
6	J. Ian Munro	[2] [8] [15] [19]
7	S. Muthukrishnan (S. Muthu Muthukrishnan)	[21] [22] [23] [24] [26] [27]
8	Lino Flores Pacheco	[1]
9	Linda Pagli	[1] [2] [8] [17]
10	Mihai Patrascu	[21] [24]

Colors in the list of coauthors