AVERAGE COMPLEXITY OF DIVIDE-AND-CONQUER ALGORITHMS

被引：1
|
作者：
VEROY, BS
机构：
来源：
INFORMATION PROCESSING LETTERS | 1988年 / 29卷 / 06期
关键词：
D O I：
10.1016/0020-0190(88)90232-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：319 / 326
页数：8
相关论文
共 50 条
  • [21] Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Okumoto, Kazumasa
    Fukunaga, Takuro
    Nagamochi, Hiroshi
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 55 - +
  • [22] Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Okumoto, Kazumasa
    Fukunaga, Takuro
    Nagamochi, Hiroshi
    ALGORITHMICA, 2012, 62 (3-4) : 787 - 806
  • [23] Massive parallelization of divide-and-conquer algorithms over powerlists
    Achatz, K
    Schulte, W
    SCIENCE OF COMPUTER PROGRAMMING, 1996, 26 (1-3) : 59 - 78
  • [24] Divide-and-conquer approximation algorithms via spreading metrics
    Even, G
    Naor, J
    Rao, S
    Schieber, B
    JOURNAL OF THE ACM, 2000, 47 (04) : 585 - 616
  • [25] The divide-and-conquer manifesto
    Dietterich, TG
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2000, 1968 : 13 - 26
  • [26] Divide-and-conquer algorithms on two-dimensional meshes
    Valero-García, M
    González, A
    de Cerio, LD
    Royo, D
    EURO-PAR '98 PARALLEL PROCESSING, 1998, 1470 : 1051 - 1056
  • [27] CASCADING DIVIDE-AND-CONQUER - A TECHNIQUE FOR DESIGNING PARALLEL ALGORITHMS
    ATALLAH, MJ
    COLE, R
    GOODRICH, MT
    SIAM JOURNAL ON COMPUTING, 1989, 18 (03) : 499 - 532
  • [28] TOP-DOWN SYNTHESIS OF DIVIDE-AND-CONQUER ALGORITHMS
    SMITH, DR
    ARTIFICIAL INTELLIGENCE, 1985, 27 (01) : 43 - 96
  • [29] Modeling and simulation of parallel adaptive divide-and-conquer algorithms
    Fernando J. Barros
    The Journal of Supercomputing, 2008, 43 : 241 - 255
  • [30] Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
    Kazumasa Okumoto
    Takuro Fukunaga
    Hiroshi Nagamochi
    Algorithmica, 2012, 62 : 787 - 806
12345