Computing with time-varying data: Sequential complexity and parallel speed-up

DOI10.1007/S002240000074MaRDI QIDQ1384702zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, L. Pagli

Publication date 20 April 1998

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002240000074

zbMATH Keywords

succeeding algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• On limits on the computational power of data-accumulating algorithms
• The characterization of data-accumulating algorithms
• Data-movement-intensive problems: Two folk theorems in parallel computation revisited
• Parallel and sequential computation: A statistician's view
• Dynamic databases with optimal in order time complexity

Cited in

(3)

• On limits on the computational power of data-accumulating algorithms
• The characterization of data-accumulating algorithms
• Bounds on the multi-clients incremental computing for homogeneous decreasing computation sequences

This page was built for publication: Computing with time-varying data: Sequential complexity and parallel speed-up

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384702)