The Design of Dynamic Data Structures (Record no. 34129)

000 -LEADER
fixed length control field 02982nam a22004815i 4500
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783540409618
-- 978-3-540-40961-8
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 006.6
100 1# - MAIN ENTRY--AUTHOR NAME
Personal name Overmars, Mark H.
245 14 - TITLE STATEMENT
Title The Design of Dynamic Data Structures
Statement of responsibility, etc by Mark H. Overmars.
260 #1 - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication Berlin, Heidelberg :
Name of publisher Springer Berlin Heidelberg,
Year of publication 1983.
300 ## - PHYSICAL DESCRIPTION
Number of Pages VII, 181 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 A catalog of (multi-dimensional) searching problems -- Local rebuilding (balancing) -- Partial rebuilding -- Global rebuilding -- Order decomposable set problems -- Decomposable searching problems -- Batched dynamization -- Searching in the past -- Final comments and open problems.
520 ## - SUMMARY, ETC.
Summary, etc In numerous computer applications there is a need of storing large sets of objects in such a way that some questions about those objects can be answered efficiently. Data structures that store such sets of objects can be either static (built for a fixed set of objects) or dynamic (insertions of new objects and deletions of existing objects can be performed). Especially for more complex searching problems as they arise in such fields as computational geometry, database design and computer graphics, only static data structures are available. This book aims at remedying this lack of flexibility by providing a number of general techniques for turning static data structures for searching problems into dynamic structures. Although the approach is basically theoretical, the techniques offered are often practically applicable. The book is written in such a way that it is readable for those who have some elementary knowledge of data structures and algorithms. Although this monograph was first published in 1983, it is still unique as a general treatment of methods for constructing dynamic data structures.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data structures (Computer science).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer graphics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical Term Data Structures.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0014927
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type E-BOOKS
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1983.
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 EBK4835 http://dx.doi.org/10.1007/BFb0014927 E-BOOKS
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha