Proving relative lower bounds for incremental algorithms

DOI10.1007/BF00259471zbMath0699.68057OpenAlexW1985623817MaRDI QIDQ913508

A. Michael Berman, Marvin C. Paull, Barbara G. Ryder

Publication date: 1990

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

lower boundsincremental algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

Complexity models for incremental computation ⋮ The complexity of certain incremental code generation problems ⋮ Dynamic expression trees ⋮ On the computational complexity of dynamic graph problems

This page was built for publication: Proving relative lower bounds for incremental algorithms