JOURNAL ARTICLE

Average complexity of divide-and-conquer algorithms

Boris S. Veroy

Year: 1988 Journal:   Information Processing Letters Vol: 29 (6)Pages: 319-326   Publisher: Elsevier BV
Keywords:
Divide and conquer algorithms Computer science Computational complexity theory Algorithm Asymptotic computational complexity Theoretical computer science Average-case complexity Analysis of algorithms Mathematics Computational resource

Metrics

3
Cited By
0.44
FWCI (Field Weighted Citation Impact)
19
Refs
0.68
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

graph theory and CDMA systems
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Algorithms and Data Compression
Physical Sciences →  Computer Science →  Artificial Intelligence
Advanced Combinatorial Mathematics
Physical Sciences →  Mathematics →  Discrete Mathematics and Combinatorics

Related Documents

JOURNAL ARTICLE

Average complexity of divide-and-conquer algorithms

Boris S. Veroy

Journal:   Information Processing Letters Year: 1989 Vol: 32 (6)Pages: 329-329
BOOK-CHAPTER

Divide-and-Conquer Algorithms

Douglas R. Stinson

Year: 2021 Pages: 105-170
JOURNAL ARTICLE

Divide and conquer local average regression

Xiangyu ChangShao-Bo LinYao Wang

Journal:   Electronic Journal of Statistics Year: 2017 Vol: 11 (1)
© 2026 ScienceGate Book Chapters — All rights reserved.