메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 242-250

An in-place sorting with O(n log n) comparisons and O(n) moves

Author keywords

Computer science; Contracts; History; Internet; Layout; Merging; Sorting; Upper bound

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; CONTRACTS; HISTORY; INTERNET; MERGING; SORTING;

EID: 1842602935     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2003.1238198     Document Type: Conference Paper
Times cited : (3)

References (15)
  • 5
    • 85034662285 scopus 로고
    • A sparse table implementation of priority queues
    • Proc. Internat. Colloq. Automata, Languages, & Programming, Springer-Verlag
    • A. Itai, A. Konheim, and M. Rodeh. A sparse table implementation of priority queues. In Proc. Internat. Colloq. Automata, Languages, & Programming, volume 115 of Lect. Notes Comput. Sci., pages 417-31. Springer-Verlag, 1981.
    • (1981) Lect. Notes Comput. Sci. , vol.115 , pp. 417-431
    • Itai, A.1    Konheim, A.2    Rodeh, M.3
  • 8
    • 0000811402 scopus 로고
    • Sorting and Searching
    • Addison-Wesley, Second edition
    • D. Knuth. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, 1973. (Second edition: 1998).
    • (1973) The Art of Computer Programming , vol.3
    • Knuth, D.1
  • 9
    • 38249010040 scopus 로고
    • Sorting with minimum data movement
    • J. Munro and V. Raman. Sorting with minimum data movement. J. Algorithms, 13:374-93, 1992.
    • (1992) J. Algorithms , vol.13 , pp. 374-393
    • Munro, J.1    Raman, V.2
  • 10
    • 0345701272 scopus 로고    scopus 로고
    • Fast stable in-place sorting with O(n) data moves
    • J. Munro and V. Raman. Fast stable in-place sorting with O(n) data moves. Algorithmica, 16:151-60, 1996.
    • (1996) Algorithmica , vol.16 , pp. 151-160
    • Munro, J.1    Raman, V.2
  • 11
    • 0030258040 scopus 로고    scopus 로고
    • Selection from read-only memory and sorting with minimum data movement
    • J. Munro and V. Raman. Selection from read-only memory and sorting with minimum data movement. Theoret. Comput. Sci., 165:311-23, 1996.
    • (1996) Theoret. Comput. Sci. , vol.165 , pp. 311-323
    • Munro, J.1    Raman, V.2
  • 13
    • 85016893131 scopus 로고
    • Sorting in-place with a worst case complexity of n log n - 1.3n + O(log n) comparisons and ε n log n + O(1) transports
    • Proc. Internat. Symp. Algorithms and Comput., Springer-Verlag
    • K. Reinhardt. Sorting in-place with a worst case complexity of n log n - 1.3n + O(log n) comparisons and ε n log n + O(1) transports. In Proc. Internat. Symp. Algorithms and Comput., volume 650 of Lect. Notes Comput. Sci., pages 489-98. Springer-Verlag, 1992.
    • (1992) Lect. Notes Comput. Sci. , vol.650 , pp. 489-498
    • Reinhardt, K.1
  • 14
    • 84925109506 scopus 로고
    • Maintaining dense sequential files in a dynamic environment
    • ACM Press
    • D. Willard. Maintaining dense sequential files in a dynamic environment. In Proc. Symp. Theory of Comput., pages 114-21. ACM Press, 1982.
    • (1982) Proc. Symp. Theory of Comput. , pp. 114-121
    • Willard, D.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.