Journal of Discrete Algorithms: Volume 9 Issue 3, September, 2011
Publisher: Elsevier Science Publishers B. V.
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 ...
Character comparisons, Maximum suffix, String algorithms
CIAC'10: Proceedings of the 7th international conference on Algorithms and Complexity
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) ...
character comparisons, maximum suffix, string algorithms
ACM Transactions on Algorithms (TALG): Volume 4 Issue 1, March 2008
Citation Count: 1
Downloads (6 Weeks): 2, Downloads (12 Months): 16, Downloads (Overall): 635
Full text available:
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 ...
Implicit data structures, sorting, in-place algorithms, searching
ESA'07: Proceedings of the 15th annual European conference on Algorithms
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 . ...
ICALP'07: Proceedings of the 34th international conference on Automata, Languages and Programming
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 ...
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Citation Count: 1
Downloads (6 Weeks): 3, Downloads (12 Months): 9, Downloads (Overall): 438
Full text available:
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 ...
suffixes, order statistics, strings, selection
Theory of Computing Systems: Volume 40 Issue 4, June 2007
Publisher: Springer-Verlag New York, Inc.
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 ...
SWAT'06: Proceedings of the 10th Scandinavian conference on Algorithm Theory
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 ...
ESA'05: Proceedings of the 13th annual European conference on Algorithms
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 ...
ICALP'05: Proceedings of the 32nd international conference on Automata, Languages and Programming
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 ...
STACS'05: Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
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. ...
ICALP'03: Proceedings of the 30th international conference on Automata, languages and programming
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 ...