Skip to content
Home/ Bounded Incremental Computation (1996)
Bounded Incremental Computation (1996)

Bounded Incremental Computation (1996)

by Ramalingam, G
No customer reviews yet ISBN 9783540613206

Incremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs.

About the author

Product details

Pub dateJun 5, 1996
ISBN-10354061320X
ISBN-139783540613206
LanguageEnglish
Last updated 2026-09-08 01:10
$57.47
In stock — ships in 24 hours with free tracking
Delivery by Monday, September 14, 2026
Qty
Sign in to Add to Saved list
Free delivery on orders over $35.
15-day returns. Any reason.
Secure checkout. We never store card details.

Readers who bought this also bought

More from Computers | Machine Theory
See all
Hybrid Computational Intelligence: Challenges and Applications
<p><i>Hybrid Computational Intelligence: Challenges and Utilities </i>is a comprehensive resource that begins with the basics and main components of computational intelligence. It brings together many different aspects of the current research on HCI technologies, such as neural networks, support vector machines, fuzzy logic and evolutionary computation, while also covering a wide range of applications and implementation issues, from pattern recognition and system modeling, to intelligent control problems and biomedical applications. The book also explores the most widely used applications of hybrid computation as well as the history of their development. </p> <p>Each individual methodology provides hybrid systems with complementary reasoning and searching methods which allow the use of domain knowledge and empirical data to solve complex problems.</p>
$173.55
Discrete Mathematics
Biggs, Norman L
$115.52
Topology and Category Theory in Computer Science
This volume reflects the growing use of techniques from topology and category theory in the field of theoretical computer science. In so doing it offers a source of new problems with a practical flavor while stimulating original ideas and solutions. Reflecting the latest innovations at the interface between mathematics and computer science, the work will interest researchers and advanced students in both fields.
$142.95
Philosophical Papers
Humphreys, Paul
$131.97
Discrete Mathematics for Computing (2008)
Grossman, Peter
$109.97
Machine Learning: A Probabilistic Perspective
Murphy, Kevin P
$156.23