Wyniki wyszukiwania:

This graduate-level text explains the implementation and analysis of data structures as a specialised topic in applied algorithms. It examines efficient ways to realise query operations and the history of various structures as they are related to basic concepts of data storage.

Advanced Data Structures presents a comprehensive look at the ideas, analysis, and implementation details of data structures as a specialized topic in applied algorithms. Data structures are how data is stored within a computer, and how one can go about searching for data within. This text examines efficient ways to search and update sets of numbers, intervals, or strings by various data structures, such as search trees, structures for sets of intervals or piece-wise constant functions, orthogonal range search structures, heaps, union-find structures, dynamization and persistence of...

Discrete Geometry is the kind of area in which problems can be quickly expressed and understood by a wide audience, as usually only elementary geometry is involved. This long-awaited book is based on William O.J. Moser's problem collection that has been circulating in the community for many years. The authors state a much extended variety of problems. For each problem they provide the historical background and give comprehensive references. The book will be of great value to any graduate student and researcher in discrete geometry.Bernard Chazelle (Princeton University): This will be a...

This book is a collection of more than 500 attractive open problems in the field. The largely self-contained chapters provide a broad overview of discrete geometry, along with historical details and the most important partial results related to these problems.