Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Bounded Incremental Computation

Name: Bounded Incremental Computation
Brand: Springer, Berlin
SKU: 01566144
Price: 19794 HUF
Availability: InStock
Author: G. Ramalingam
ISBN: 9783540613206

G. Ramalingam

Language

English

Book Paperback

Libristo code: 01566144

Publishers Springer, Berlin, November 1995

Incremental computation concerns the re-computation of output after a change in the input, whereas a... Full description

Libristo code: 01566144

136 b

19 794 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Staročeský betlém

Stationery items

2 537 Ft

Kirillow Andreas Maier

Paperback

3 848 Ft

Notice d'Un Beau Mobilier Artistique Ancien Et Moderne, Diamants Et Quantite de Bijoux Georges Bottolier-Lasquin

Paperback

4 841 Ft

Análise Ergonômica do Trabalho para movimentação manual de cargas Raissa Hickmann Corbellini

Paperback

17 174 Ft

La Nouvelle Guerre contre l'intelligence, tome 1 Charles-Xavier Durand

Paperback

10 086 Ft

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.