Peter Brass - Böcker
Visar alla böcker från författaren Peter Brass. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
536 kr
Skickas inom 10-15 vardagar
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 terrific book. I've had drafts of it over the years, and I can't wait to have the final version. It will be extremely popular in the discrete geometry community (where the authors are undisputed leaders). This project has my highest recommendation." Joel Spencer (NYU): "- Pach has that wonderful "Hungarian" sense of problem posing and solving. ' This is a very exciting project'"
1 092 kr
Skickas inom 7-10 vardagar
This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
642 kr
Skickas inom 7-10 vardagar
This text closely examines ideas, analysis, and implementation details of data structures as a specialised topic in applied algorithms. It looks at efficient ways to realise query and update operations on sets of numbers, intervals, or strings by various data structures, including: search trees; structures for sets of intervals or piece-wise constant functions; orthogonal range search structures; heaps; union-find structures; dynamization and persistence of structures; structures for strings; and hash tables. Instead of relegating data structures to trivial material used to illustrate object-oriented programming methodology, this is the first volume to show data structures as a crucial algorithmic topic. Numerous code examples in C and more than 500 references make Advanced Data Structures an indispensable text.
536 kr
Skickas inom 10-15 vardagar
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.