Introspective sorting and selection algorithms

被引:0
|
作者
Musser, David R. [1 ]
机构
[1] Rensselaer Polytechnic Inst, Troy, NY, United States
来源
Software - Practice and Experience | 1997年 / 27卷 / 08期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:983 / 993
相关论文
共 50 条
  • [31] The Information Content in Sorting Algorithms
    Busse, Ludwig M.
    Chehreghani, Morteza Haghir
    Buhmann, Joachim M.
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [32] A SURVEY OF ADAPTIVE SORTING ALGORITHMS
    ESTIVILLCASTRO, V
    WOOD, D
    COMPUTING SURVEYS, 1992, 24 (04) : 441 - 476
  • [33] Optimizing sorting with genetic algorithms
    Li, XM
    Garzarán, MJ
    Padua, D
    CGO 2005: INTERNATIONAL SYMPOSIUM ON CODE GENERATION AND OPTIMIZATION, 2005, : 99 - 110
  • [34] FAST PARALLEL SORTING ALGORITHMS
    HIRSCHBERG, DS
    COMMUNICATIONS OF THE ACM, 1978, 21 (08) : 657 - 661
  • [35] Design Patterns for Sorting Algorithms
    Rosiene, Joel A.
    Rosiene, Carolyn Pe
    2019 IEEE FRONTIERS IN EDUCATION CONFERENCE (FIE 2019), 2019,
  • [36] Algorithms for the Generalized Sorting Problem
    Huang, Zhiyi
    Kannan, Sampath
    Khanna, Sanjeev
    2011 IEEE 52ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2011), 2011, : 738 - 747
  • [37] AN INVERTED TAXONOMY OF SORTING ALGORITHMS
    MERRITT, SM
    COMMUNICATIONS OF THE ACM, 1985, 28 (01) : 96 - 99
  • [38] ON THE DISTRIBUTION OF COMPARISONS IN SORTING ALGORITHMS
    RICHARDS, D
    VAIDYA, P
    BIT, 1988, 28 (04): : 764 - 774
  • [39] PARALLEL ALGORITHMS FOR MERGING AND SORTING
    DEO, N
    SARKAR, D
    INFORMATION SCIENCES, 1991, 56 (1-3) : 151 - 161
  • [40] Comparison Criticality in Sorting Algorithms
    Jones, Thomas B.
    Ackley, David H.
    2014 44TH ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN), 2014, : 726 - 731