Bounded Incremental Computation (Record no. 36296)

000 -LEADER
fixed length control field 02759nam a22005175i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540684589
-- 978-3-540-68458-9
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
245 10 - TITLE STATEMENT
Title Bounded Incremental Computation
Statement of responsibility, etc edited by G. Ramalingam.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1996.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 196 p.
Other physical details online resource.
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note On incremental algorithms and their complexity -- Terminology and notation -- Incremental algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental algorithm for a generalization of the shortest-path problem -- Incremental algorithms for the circuit value annotation problem -- Inherently unbounded incremental computation problems -- Incremental algorithms for reducible flowgraphs -- Conclusions.
520 ## - SUMMARY, ETC.
Summary, etc 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.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Operating systems (Computers).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer software.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Algorithm Analysis and Problem Complexity.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Combinatorics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computation by Abstract Devices.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Operating Systems.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ramalingam, G.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0028290
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1996.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 0302-9743 ;
Holdings
Withdrawn status Lost status Damaged status Not for loan Current library Accession Number Uniform Resource Identifier Koha item type
        IMSc Library EBK7002 http://dx.doi.org/10.1007/BFb0028290 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha