Author image not provided
 Gianni Franceschini

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.25
Citation Count39
Publication count12
Publication years2003-2011
Available for download2
Average downloads per article536.50
Downloads (cumulative)1,073
Downloads (12 Months)25
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


12 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 12 of 12
Sort by:

1
September 2011 Journal of Discrete Algorithms: Volume 9 Issue 3, September, 2011
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 1

It is shown how to compute the lexicographically maximum suffix of a string of n>=2 characters over a totally ordered alphabet using at most (4/3)n-5/3 three-way character comparisons. The best previous bound, which has stood unchallenged for more than 25 years, is (3/2)n-O(1) comparisons. We also prove an interesting property ...
Keywords: Character comparisons, Maximum suffix, String algorithms

2
May 2010 CIAC'10: Proceedings of the 7th international conference on Algorithms and Complexity
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

It is shown how to compute the lexicographically maximum suffix of a string of n ≥2 characters over a totally ordered alphabet using at most (4/3) n −5/3 three-way character comparisons. The best previous bound, which has stood unchallenged for more than 25 years, is (3/2) n − O (1) ...
Keywords: character comparisons, maximum suffix, string algorithms

3 published by ACM
March 2008 ACM Transactions on Algorithms (TALG): Volume 4 Issue 1, March 2008
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 16,   Downloads (Overall): 635

Full text available: PDFPDF
Questions about order versus disorder in systems and models have been fascinating scientists over the years. In computer science, order is intimately related to sorting, commonly meant as the task of arranging keys in increasing or decreasing order with respect to an underlying total order relation. The sorted organization is ...
Keywords: Implicit data structures, sorting, in-place algorithms, searching

4
October 2007 ESA'07: Proceedings of the 15th annual European conference on Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 14

It iswell known that n integers in the range [1, n c ] canbe sorted in O ( n ) time in the RAM model using radix sorting. More generally, integers in any range [1, U ] can be sorted in O ( n √log log n ) time [5]. ...

5
July 2007 ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 11

Given string T = T [1,..., n ], the suffix sorting problem is to lexicographically sort the suffixes T [ i,..., n ] for all i . This problem is central to the construction of suffix arrays and trees with many applications in string processing, computational biology and compression. A ...

6 published by ACM
June 2007 STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 9,   Downloads (Overall): 438

Full text available: PDFPDF
Given a string S[1·s n], the suffix selection problemis to find the k th lexicographically smallest amongst the n suffixes S[i·s n], for i=1,...,n. In particular, the fundamental question is if selection can be performed more efficiently than sorting all the suffixes. If one considered n numbers, they can be ...
Keywords: suffixes, order statistics, strings, selection

7
June 2007 Theory of Computing Systems: Volume 40 Issue 4, June 2007
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

We settle a long-standing open question, namely whether it is possible to sort a sequence of n elements stably (i.e., preserving the original relative order of the equal elements), using O(1) auxiliary space and performing O(n log n) comparisons and O(n) data moves. Munro and Raman stated this problem in ...

8
July 2006 SWAT'06: Proceedings of the 10th Scandinavian conference on Algorithm Theory
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

In the comparison model the only operations allowed on input elements are comparisons and moves to empty cells of memory. We prove the existence of an algorithm that, for any set of s ≤ n sorted sequences containing a total of n elements, computes the whole sorted sequence using O ...

9
October 2005 ESA'05: Proceedings of the 13th annual European conference on Algorithms
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 2

We study three comparison-based problems related to multisets in the cache-oblivious model: Duplicate elimination, multisorting and finding the most frequent element (the mode). We are interested in minimizing the cache complexity (or number of cache misses) of algorithms for these problems in the context under which cache size and block ...

10
July 2005 ICALP'05: Proceedings of the 32nd international conference on Automata, Languages and Programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k , is not a constant. We present the first algorithm for lexicographically sorting n keys in O ( nk + n log n ) time using O (1) auxiliary data locations, which ...

11
February 2005 STACS'05: Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We settle a long-standing open question, namely whether it is possible to sort a sequence of n elements stably (i.e. preserving the original relative order of the equal elements), using O (1) auxiliary space and performing O ( n log n ) comparisons and O ( n ) data moves. ...

12
June 2003 ICALP'03: Proceedings of the 30th international conference on Automata, languages and programming
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 6

We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this paper is that of closing the longstanding open problem about the existence of an optimal implicit dictionary over an unbounded universe. Another finding ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us