| 2010 | CIAC | Finding the Maximum Suffix with Fewer Comparisons. | Gianni Franceschini, Torben Hagerup |
| 2009 | STACS | Optimal Cache-Aware Suffix Selection. | Gianni Franceschini, Roberto Grossi, S. Muthukrishnan |
| 2007 | ESA | Radix Sorting with No Extra Space. | Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu |
| 2007 | ICALP | In-Place Suffix Sorting. | Gianni Franceschini, S. Muthukrishnan |
| 2007 | STOC | Optimal suffix selection. | Gianni Franceschini, S. Muthukrishnan |
| 2006 | SODA | Implicit dictionaries with | Gianni Franceschini, J. Ian Munro |
| 2005 | ESA | Cache-Oblivious Comparison-Based Algorithms on Multisets. | Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro |
| 2005 | ICALP | Optimal In-place Sorting of Vectors and Records. | Gianni Franceschini, Roberto Grossi |
| 2005 | STACS | Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves. | Gianni Franceschini |
| 2004 | FOCS | No Sorting? Better Searching! | Gianni Franceschini, Roberto Grossi |
| 2004 | ICALP | A General Technique for Managing Strings in Comparison-Driven Data Structures. | Gianni Franceschini, Roberto Grossi |
| 2004 | SODA | Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. | Gianni Franceschini |
| 2003 | FOCS | An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. | Gianni Franceschini, Viliam Geffert |
| 2003 | ICALP | Optimal Cache-Oblivious Implicit Dictionaries. | Gianni Franceschini, Roberto Grossi |
| 2003 | SODA | Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. | Gianni Franceschini, Roberto Grossi |
| 2003 | WADS | Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. | Gianni Franceschini, Roberto Grossi |
| 2002 | FOCS | Implicit B-Trees: New Results for the Dictionary Problem. | Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli |