On limits on the computational power of data-accumulating algorithms

DOI10.1016/S0020-0190(02)00499-4zbMath1162.68815OpenAlexW2092094102MaRDI QIDQ1007605

Stefan D. Bruda, Selim G. Akl

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00499-4

zbMATH Keywords

computational complexitysortingparallel algorithmsdata-accumulating algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Pursuit and evasion on a ring: An infinite hierarchy for parallel real-time systems
• Computing with time-varying data: Sequential complexity and parallel speed-up
• On the computational power of pushdown automata
• The Parallel Evaluation of General Arithmetic Expressions

This page was built for publication: On limits on the computational power of data-accumulating algorithms