A methodological review for the analysis of divide & conquer based sorting/searching algorithms

被引：0
|
作者：
Abhayankar, Deepak [1 ]
Ingle, Maya [1 ]
机构：
[1] School of Computer Science, Devi Ahilya University, Indore, M. P. 452017, India
来源：
International Journal of Computer Science Issues | 2011年 / 8卷 / 5 5-3期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：531 / 533
相关论文
共 50 条
  • [1] On the Analysis of Stochastic Divide and Conquer Algorithms
    Rösler, U.
    2001, Springer New York (29): : 1 - 2
  • [2] On the analysis of stochastic divide and conquer algorithms
    U. Rösler
    Algorithmica, 2001, 29 : 238 - 261
  • [3] On the analysis of stochastic divide and conquer algorithms
    Rösler, U
    ALGORITHMICA, 2001, 29 (1-2) : 238 - 261
  • [4] Cell sorting: Divide and conquer
    Eisenstein, M
    NATURE, 2006, 441 (7097) : 1179 - +
  • [5] Divide and conquer based Fast Shmoo algorithms
    Patten, P
    INTERNATIONAL TEST CONFERENCE 2004, PROCEEDINGS, 2004, : 197 - 202
  • [6] THE DESIGN OF DIVIDE AND CONQUER ALGORITHMS
    SMITH, DR
    SCIENCE OF COMPUTER PROGRAMMING, 1985, 5 (01) : 37 - 58
  • [7] Spike sorting for polytrodes: a divide and conquer approach
    Swindale, Nicholas V.
    Spacek, Martin A.
    FRONTIERS IN SYSTEMS NEUROSCIENCE, 2014, 8
  • [8] Divide and Conquer Based Non-dominated Sorting for Parallel Environment
    Mishra, Sumit
    Saha, Sriparna
    Month, Samrat.
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 4297 - 4304
  • [9] Divide-and-conquer algorithms on the hypercube
    Mayr, EW
    Werchner, R
    THEORETICAL COMPUTER SCIENCE, 1996, 162 (02) : 283 - 296
  • [10] A divide and conquer deformable contour method with a model based searching algorithm
    Wang, X
    He, L
    Tang, YJ
    Wee, WG
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2003, 33 (05): : 738 - 751
12345