The complexity of certain incremental code generation problems

DOI10.1080/00207169908804821zbMath0946.68059OpenAlexW2051652013MaRDI QIDQ4261193

No author found.

Publication date: 17 October 2000

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169908804821

zbMATH Keywords

bounded incremental algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• The incremental maintenance of a depth-first-search tree in directed acyclic graphs
• Proving relative lower bounds for incremental algorithms
• A topological approach to dynamic graph connectivity

This page was built for publication: The complexity of certain incremental code generation problems