Radix sorting with no extra space

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 194-205

  Franceschini, Gianni ^a   Muthukrishnan, S ^b   Pǎtraşcu, Mihai ^c  

^a UNIVERSITY OF PISA   (Italy)

^b GOOGLE INC   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE;

EXTRA SPACE; RADIX SORTING; RAM MODELS;

INTEGER PROGRAMMING;

EID: 38049066452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_19     Document Type: Conference Paper

References (10)

1. Andersson, A., Hagerup, T., Nilsson, S., Raman, R.: Sorting in linear time? Journal of Computer and System Sciences 57(1), 74-93 (1998)
2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)
3. Fredman, M.L., Willard, D.E.: Surpassing the information theoretic bound with fusion trees. J. Comput. System Sci. 47, 424-436 (1993)
4. Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. System Sci. 48(3), 533-551 (1994)
5. Han, Y., Thorup, M.: Integer sorting in O(n√log log n) expected time and linear space. In: FOCS, pp. 135-144. IEEE Computer Society, Los Alamitos (2002)
6. Katajainen, J., Pasanen, T.: Stable minimum space partitioning in linear time. BIT 32(4), 580-585 (1992)
7. Katajainen, J., Pasanen, T.: Sorting multisets stably in minimum space. Acta Informatica 31(4), 301-313 (1994)
8. Kronrod, M.A.: Optimal ordering algorithm without operational field. Soviet Math. Dokl. 10, 744-746 (1969)
9. 2 n) time. Journal of Computer and System Sciences 33(1), 66-74 (1986)
10. Salowe, J., Steiger, W.: Simplified stable merging tasks. Journal of Algorithms 8(4), 557-571 (1987)