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.

This practical text contains fairly "traditional" coverage of data structures with a clear and complete use of algorithm analysis, and some emphasis on file processing techniques as relevant to modern programmers. It fully integrates OO programming with these topics, as part of the detailed presentation of OO programming itself.Chapter topics include lists, stacks, and queues; binary and general trees; graphs; file processing and external sorting; searching; indexing; and limits to computation.For programmers who need a good reference on data structures.

This Second Volume in the series Handbook of Dynamic Data Driven Applications Systems (DDDAS) expands the scope of the methods and the application areas presented in the first Volume and aims to provide additional and extended content of the increasing set of science and engineering advances for new capabilities enabled through DDDAS. The methods and examples of breakthroughs presented in the book series capture the DDDAS paradigm and its scientific and technological impact and benefits. The DDDAS paradigm and the ensuing DDDAS-based frameworks for systems’ analysis and design have been shown to engender new and advanced capabilities for understanding, analysis, and management of engineered, natural, and societal systems (“applications systems”), and for the commensurate wide set of scientific and engineering fields and applications, as well as foundational areas. The DDDAS book series aims to be a reference source of many of the important research and development efforts conducted under the rubric of DDDAS, and to also inspire the broader communities of researchers and developers about the potential in their respective areas of interest, of the application and the exploitation of the DDDAS paradigm and the ensuing frameworks, through the examples and case studies presented, either within their own field or other fields of study. As in the first volume, the chapters in this book reflect research work conducted over the years starting in the 1990’s to the present. Here, the theory and application content are considered for: Foundational Methods Materials Systems Structural Systems Energy Systems Environmental Systems: Domain Assessment & Adverse Conditions/Wildfires Surveillance Systems Space Awareness Systems Healthcare Systems Decision Support Systems Cyber Security Systems Design of Computer Systems The readers of this book series will benefit from DDDAS theory advances such as object estimation, information fusion, and sensor management. The increased interest in Artificial Intelligence (AI), Machine Learning and Neural Networks (NN) provides opportunities for DDDAS-based methods to show the key role DDDAS plays in enabling AI capabilities; address challenges that ML-alone does not, and also show how ML in combination with DDDAS-based methods can deliver the advanced capabilities sought; likewise, infusion of DDDAS-like approaches in NN-methods strengthens such methods. Moreover, the “DDDAS-based Digital Twin” or “Dynamic Digital Twin”, goes beyond the traditional DT notion where the model and the physical system are viewed side-by-side in a static way, to a paradigm where the model dynamically interacts with the physical system through its instrumentation, (per the DDDAS feed-back control loop between model and instrumentation).

Describes several useful paradigms for the design and implementation of efficient external memory (EM) algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing.

Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.

Designed both for those who seek an acquaintance with dynamic programming and for those wishing to become experts, this text is accessible to anyone who's taken a course in operations research. It starts with a basic introduction to sequential decision processes and proceeds to the use of dynamic programming in studying models of resource allocation. Subsequent topics include methods for approximating solutions of control problems in continuous time, production control, decision-making in the face of an uncertain future, and inventory control models. The final chapter introduces sequential decision processes that lack fixed planning horizons, and the supplementary chapters treat data structures and the basic properties of convex functions. 1982 edition. Preface to the Dover Edition.