default search action
Gianni Franceschini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j8]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing. SIAM J. Comput. 43(4): 1396-1416 (2014) - 2013
- [i5]Amihood Amir, Gianni Franceschini, Roberto Grossi, Tsvi Kopelowitz, Moshe Lewenstein, Noa Lewenstein:
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing. CoRR abs/1306.0406 (2013) - 2011
- [j7]Gianni Franceschini, Torben Hagerup:
Finding the maximum suffix with fewer comparisons. J. Discrete Algorithms 9(3): 279-286 (2011) - [i4]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Partial Data Compression and Text Indexing via Optimal Suffix Multi-Selection. CoRR abs/1110.3381 (2011) - 2010
- [c19]Gianni Franceschini, Torben Hagerup:
Finding the Maximum Suffix with Fewer Comparisons. CIAC 2010: 323-334
2000 – 2009
- 2009
- [c18]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Optimal Cache-Aware Suffix Selection. STACS 2009: 457-468 - [i3]Gianni Franceschini, Roberto Grossi, S. Muthukrishnan:
Optimal cache-aware suffix selection. CoRR abs/0902.1737 (2009) - 2008
- [j6]Gianni Franceschini, Roberto Grossi:
No sorting? better searching! ACM Trans. Algorithms 4(1): 2:1-2:13 (2008) - 2007
- [j5]Gianni Franceschini:
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves. Theory Comput. Syst. 40(4): 327-353 (2007) - [c17]Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu:
Radix Sorting with No Extra Space. ESA 2007: 194-205 - [c16]Gianni Franceschini, S. Muthukrishnan:
In-Place Suffix Sorting. ICALP 2007: 533-545 - [c15]Gianni Franceschini, S. Muthukrishnan:
Optimal suffix selection. STOC 2007: 328-337 - [i2]Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu:
Radix Sorting With No Extra Space. CoRR abs/0706.4107 (2007) - 2006
- [j4]Gianni Franceschini, Fabrizio Luccio, Linda Pagli
:
Dense trees: a new look at degenerate graphs. J. Discrete Algorithms 4(3): 455-474 (2006) - [j3]Gianni Franceschini, Roberto Grossi:
Optimal Implicit Dictionaries over Unbounded Universes. Theory Comput. Syst. 39(2): 321-345 (2006) - [c14]Gianni Franceschini, J. Ian Munro:
Implicit dictionaries with O(1) modifications per update and fast search. SODA 2006: 404-413 - [c13]Gianni Franceschini:
Sorting by Merging or Merging by Sorting? SWAT 2006: 77-89 - 2005
- [j2]Gianni Franceschini, Viliam Geffert:
An in-place sorting with O(nlog n) comparisons and O(n) moves. J. ACM 52(4): 515-537 (2005) - [c12]Arash Farzan, Paolo Ferragina, Gianni Franceschini, J. Ian Munro:
Cache-Oblivious Comparison-Based Algorithms on Multisets. ESA 2005: 305-316 - [c11]Gianni Franceschini, Roberto Grossi:
Optimal In-place Sorting of Vectors and Records. ICALP 2005: 90-102 - [c10]Gianni Franceschini:
Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves. STACS 2005: 629-640 - 2004
- [j1]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) - [c9]Gianni Franceschini, Roberto Grossi:
No Sorting? Better Searching! FOCS 2004: 491-498 - [c8]Gianni Franceschini, Roberto Grossi:
A General Technique for Managing Strings in Comparison-Driven Data Structures. ICALP 2004: 606-617 - [c7]Gianni Franceschini:
Proximity Mergesort: optimal in-place sorting in the cache-oblivious model. SODA 2004: 291-299 - 2003
- [c6]Gianni Franceschini, Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. FOCS 2003: 242-250 - [c5]Gianni Franceschini, Roberto Grossi:
Optimal Cache-Oblivious Implicit Dictionaries. ICALP 2003: 316-331 - [c4]Gianni Franceschini, Roberto Grossi:
Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time. SODA 2003: 670-678 - [c3]Gianni Franceschini, Roberto Grossi:
Optimal Worst-Case Operations for Implicit Cache-Oblivious Search Trees. WADS 2003: 114-126 - [i1]Gianni Franceschini, Viliam Geffert:
An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. CoRR cs.DS/0305005 (2003) - 2002
- [c2]Gianni Franceschini, Roberto Grossi, J. Ian Munro, Linda Pagli:
Implicit B-Trees: New Results for the Dictionary Problem. FOCS 2002: 145-154 - 2000
- [c1]Lino Flores Pacheco, Gianni Franceschini, Fabrizio Luccio, Linda Pagli:
Decomposition of k-Dense Trees. WDAS 2000: 11-23
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: