The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gianni Franceschini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  25. Finding the Maximum Suffix with Fewer Comparisons. [Citation Graph (, )][DBLP]


  26. Optimal Cache-Aware Suffix Selection. [Citation Graph (, )][DBLP]


  27. Optimal cache-aware suffix selection [Citation Graph (, )][DBLP]


Search in 0.183secs, Finished in 0.184secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002