Sequential and Parallel Algorithms and Data Structures The Basic Too
This textbook is a concise introduction to the basic toolbox of structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems
- PDF / 7,884,876 Bytes
- 516 Pages / 439.42 x 683.15 pts Page_size
- 55 Downloads / 224 Views
Sequential and Parallel Algorithms and Data Structures The Basic Toolbox
Sequential and Parallel Algorithms and Data Structures
Peter Sanders • Kurt Mehlhorn Martin Dietzfelbinger • Roman Dementiev
Sequential and Parallel Algorithms and Data Structures The Basic Toolbox
Peter Sanders Karlsruhe Institute of Technology Karlsruhe, Germany
Kurt Mehlhorn Max Planck Institute for Informatics Saarbrücken, Germany
Martin Dietzfelbinger Technische Universität Ilmenau Ilmenau, Germany
Roman Dementiev Intel Deutschland GmbH Feldkirchen, Germany
Intel material (including descriptions of algorithms and their implementations, text, figures, and tables describing their experimental evaluation and experimental results on Intel processors, and sample code) is reproduced by permission of Intel Corporation. ISBN 978-3-030-25208-3 ISBN 978-3-030-25209-0 (eBook) https://doi.org/10.1007/978-3-030-25209-0 © Springer Nature Switzerland AG 2019 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors, and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
To all algorithmicists
Preface
An algorithm is a precise and unambiguous recipe for solving a class of problems. If formulated as programs, they can be executed by a machine. Algorithms are at the heart of every nontrivial computer application. Therefore, every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, key algorithms for problems on graphs, and generic techniques for modeling, understanding, and solving algorithmic problems. This book is a concise introduction to this basic toolbox, intended for students and professionals familiar with programming and basic mathematical language. Although
Data Loading...
