Independently published, 2023. — 655 p. Dive into over 90 captivating algorithm challenges, spanning more than 600 pages of insights and real-world applications. With comprehensive coverage of essential data structures like linked lists, stacks, queues, trees, and graphs, you'll be fully prepared for success in interviews and equipped to thrive at top tech companies worldwide....
BPB Publications, 2023. — 214 p. — ISBN 978-93-5551-792-0. Solve complex problems by performing analysis of algorithms or selecting suitable techniques for optimal performance. Description: “Advanced Data Structures and Algorithms” is an important subject area in Computer Science that covers more complex and advanced topics related to data structures and algorithms. This book...
Pittsburgh: Carnegie Mellon University, 2019. — 358 p. This book aims to present techniques for problem solving using today’s computers, including both sequentially and parallel. For example, you might want to find the shortest path from where you are now to the nearest cafe by using your computer. The primary concerns will likely include correctness (the path found indeed...
Independently published, 2021. — 157 p. — ISBN B08V51PVCX. What are algorithms and why should you care? We’ll start with an overview of algorithms and then discuss two games that you could use an algorithm to solve more efficiently – the number guessing game and a route-finding game. In mathematics and computer science, an algorithm (/ˈælɡərɪðəm/ ( listen)) is a finite sequence...
Springer, 2008. — 353 p. The Burrows-Wheeler Transform is one of the best lossless compression methods available. It is an intriguing — even puzzling — approach to squeezing redundancy out of data, it has an interesting history, and it has applications well beyond its original purpose as a compression method. It is a relatively late addition to the compression canon, and hence...
2nd Edition. — Packt Publishing, 2018. — 389 p. — ISBN: 978-1-78899-557-3. Learn to implement complex data structures and algorithms using Python. Data structures allow you to store and organize data efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. Hands-On Data Structures and Algorithms with Python teaches you the...
2nd Edition. — Packt Publishing, 2018. — 389 p. — ISBN: 978-1-78899-557-3. Code files only! Learn to implement complex data structures and algorithms using Python Data structures allow you to store and organize data efficiently. They are critical to any problem, provide a complete solution, and act like reusable code. Hands-On Data Structures and Algorithms with Python teaches...
Оригинал работы трех индийских математиков об алгоритме проверки числа на простоту (АКС - алгоритм).
Дата публикации - 6 августа 2002 года
"Abstract
We present an unconditional deterministic polynomial-time algorithm that determines whether
an input number is prime or composite. "
Основным достижением авторов является то, что тест АКС является первым опубликованным...
Wiley, 2019. — 419 p. Data Structure has the importance not only in Computer Science but for any discipline of Engineering and Technology where there is a requirement of appropriate data structures in program development. Before solving a problem, a major decision is taken about which data structure will be used to represent the data. In this book, multiple stacks and multiple...
Birmingham: Packt Publishing, 2020. — 373 p. — ISBN: 9781789801217. Learn algorithms for solving classic computer science problems with this concise guide covering everything from fundamental algorithms, such as sorting and searching, to modern algorithms used in machine learning and cryptography ! Key Features Learn the techniques you need to know to design algorithms for...
Б.м.: Quickstudy Reference Guides, 2020. — 6 p. Covering the essential concepts of the computer science area of algorithms, this 6 page laminated guide is part 2 of 2 guides that also serves as a reference for designing and analyzing algorithms. Guaranteed to boost grades in required algorithms courses this reference tool can continue to offer support well beyond a course....
Tłumaczenie z języka angielskiego. — Gliwice: Helion, 2003. — 442 s. — ISBN 83-7361-177-0. W niniejszej książce przedstawiono struktury danych i algorytmy stanowiące podstawę współczesnego programowania komputerów. Algorytmy są niczym przepis na rozwiązanie postawionego przed programistę problemu. Są one nierozerwalnie związane ze strukturami danych - listami, rekordami,...
Addison-Wesley, 1983. — 400 p. — ISBN: 0201000237. This book presents the data structures and algorithms that underpin much of today’s computer programming. The basis of this book is the material contained in the first six chapters of our earlier work, The Design and Analysis of Computer Algorithms. We have expanded that coverage and have added material on algorithms for...
John Wiley, 2005. — 575. The present book is the result of an ambitious project to bring together the various visions of researchers in both the parallelism and metaheuristic fields, with a main focus on optimization. In recent years, devising parallel models of algorithms has been a healthy field for developing more efficient optimization procedures. What most people using...
GoalKicker.com, 2018. — 256 p. The Algorithms Notes for Professionals book is compiled from Stack Overflow Documentation, the content is written by the beautiful people at Stack Overflow. Text content is released under Creative Commons BY-SA. See credits at the end of this book whom contributed to the various chapters. Images may be copyright of their respective owners unless...
CRC Press, 2009. — 1044. The physical design flow of any project depends upon the size of the design, the technology, the number of designers, the clock frequency, and the time to do the design. As technology advances and design-styles change, physical design flows are constantly reinvented as traditional phases are removed and new ones are added to accommodate changes in...
Dhahran: King Fahd University of Petroleum & Minerals, 1998. - 430p. The field of computer algorithms has flourished since the early 1960's when the 1rst users of electronic computers started to pay attention to the performance of programs. The limited resources of computers at that time resulted in additional impetus for devising efficient computer algorithms. After extensive...
2nd edition. — World Scientific, 2022. — 725 p. — ISBN 9811238642. Available at a lower price from other sellers that may not offer free Prime shipping. Problem solving is an essential part of every scientific discipline. It has two components: (1) problem identification and formulation, and (2) the solution to the formulated problem. One can solve a problem on its own using ad...
Wiley, 2022. — 226 p. — ISBN 978-1-119-72441-4. The Self-Taught Computer Scientist is Cory Althoff's follow-up to The Self-Taught Programmer, which inspired hundreds of thousands of professionals to learn how to program outside of school. In The Self-Taught Programmer, Cory showed readers why you don't need a computer science degree to program professionally and taught the...
Springer, 2016. — 262 p. — ISBN: 9783319431734, EISBN: 9783319431741 This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The...
Independently published, 2024. — 139 р. — ISBN: 979-8413681985. A concise, illustrated guide to algorithms and data structures, perfect for coding interviews, classes, or self-study. Covers key concepts, from fundamentals to graphs, trees, sorting, and search techniques. This book is a concise and illustrated guide for anyone who wants to brush up on their fundamentals in the...
Routledge, 2016. — 265 p. — ISBN: 113885283X, 9781138852839 This book critically explores forms and techniques of calculation that emerge with digital computation, and their implications. The contributors demonstrate that digital calculative devices matter beyond their specific functions as they progressively shape, transform and govern all areas of our life. In particular, it...
Anand Rohit, Juneja Abhinav, Pandey Digvijay, Juneja Sapna, Sindhwani Nidhi. — John Wiley & Sons, Inc., 2024. — 460 р. — ISBN: 978-1394188062. Discover a collection of meta-heuristic algorithms for distributed systems in different application domains. Meta-heuristic techniques are increasingly gaining favor as tools for optimizing distributed systems—generally, to enhance the...
Apple Academic Press, 2011. — 350 p. — ISBN: 1926692977, 9781466562608 Data structure and software engineering is an integral part of computer science. This volume presents new approaches and methods to knowledge sharing, brain mapping, data integration, and data storage. The author describes how to manage an organization’s business process and domain data and presents new...
A. B. Lawal, 2023. — 50 p. Benefits of This Book Learning algorithms and data structures from this book will help you become a better programmer. Algorithms and data structures will make you think more logically. Furthermore, they can help you design better systems for storing and processing data. They also serve as a tool for optimization and problem-solving. As a result, the...
Ojula Technology Innovations, 2023. — 271 p. — ISBN 9791222443188. This playbook is the third volume of the series Introduction to Algorithms & Data Structures. It is written in the form of a course. It is a very comprehensive data structures and algorithms book, packed with: text tutorials with a lot of illustrations hours of HD video tutorials, popular interview questions...
Nova Science Publishers, 2023. — 442 p. The book provides different avenues to study algorithms. It also brings new techniques and methodologies to problem solving in computational Sciences, Engineering, Scientific Computing and Medicine (imaging, radiation therapy) to mention a few. A plethora of algorithms which are universally applicable is presented on a sound analytical...
Mathematics Research Developments, 2022. — 450 р. — ISBN: 979-8-88697-425-6. This book provides different avenues to study algorithms. It also brings new techniques and methodologies to problem solving in computational sciences, engineering, scientific computing and medicine (imaging, radiation therapy) to mention a few. A plethora of algorithms which are universally applicable...
Nova Science Publishers, 2023. — 424 р. — (Mathematics Research Developments). — ISBN: 979-8-88697-479-9. The book is a continuation of Volume I with the same title. It provides different avenues to study algorithms. It also brings new techniques and methodologies to problem solving in computational sciences, engineering, scientific computing and medicine (imaging, radiation...
Nova Science Publishers, 2024. — 476 p. Due to the explosion of technology, scientific and parallel computing, faster computers have become available. This development simply means that new optimized algorithms should be developed to take advantage of these improvements. There is where this book containing such algorithms comes in handy, with applications in economics,...
The Fourier transform. The discrete Fourier transform (DFT). Radix 2 FFT algorithms. Decimation in time (DIT) FFT. Decimation in frequency (DIF) FFT. Using higher radix algorithms. Higher radix DIT and DIF algorithms. Split radix Fourier transforms (SRFT). Multidimensional FTs. The matrix Fourier algorithm (MFA). Eigenvectors of the Fourier transform. Convolutions. Weighted...
New York: Cognella Academic Publishing, 2014. — 160 p. The book begins with a clear explanation of the basics—what algorithms are, their practical applications, asymptotic notation, and data structures. The second section covers the algorithmic design techniques of divide and conquer, greedy, dynamic programming, branch and bound, and graph traversal. For each of these techniques,...
ISTE / John Wiley, 2008. — 293 p. Nowadays, material and human resource management is an increasingly important issue for organizations. Thus, a careful management of projects is an absolute necessity to preserve the competitiveness of companies. Scheduling plays a major part in project management. Indeed, the scheduling process amounts to deciding when the project activities...
Independently published, 2023. — 289 p. As the second book in the Anyone Can Code series, Algorithmic Thinking focuses on the logic behind computer programming and software design. With a data-centred approach, it starts with simple algorithms that work on simple data items and advances to more complex ones covering data structures and classes. Examples are given in C/C++ and...
Springer, 1999. — 535 p. The complexity of optimization problems Design techniques for approximation algorithms Approximation classes Input-dependent and asymptotic approximation Approximation through rando NP, PCP and non-approximability results The PCP theorem Approximation preserving reductions Probabilistic analysis of approximation algorithms Heuristic methods A....
B.: Springer, 2013. - 262 p. — ISBN: 978-3-642-39651-9 To examine, analyze, and manipulate a problem to the point of designing an algorithm for solving it is an exercise of fundamental value in many fields. With so many everyday activities governed by algorithmic principles, the power, precision, reliability and speed of execution demanded by users have transformed the design...
Independently published, 2018. — 158 p. — ASIN B08G8BM7CN It is my heartfelt thankful to Mr. Dennis Richie for his invention of simple, powerful, beautiful and grateful programming language named “C”. C programming is the gateway of learning advanced programming languages. This textbook covers the content of Data types, Keywords, Statements, Control structures, Arrays, Strings,...
Chichester: John Wiley & Sons, 2011. — 426 p. — ISBN: 9780470684535 An entertaining and captivating way to learn the fundamentals of using algorithms to solve problems The algorithmic approach to solving problems in computer technology is an essential tool. With this unique book, algorithm expert Roland Backhouse shares his four decades of experience to teach the fundamental...
Apress, 2019. — 240 p. The human mind is evolutionarily designed to take shortcuts in order to survive. We jump to conclusions because our brains want to keep us safe. A majority of our biases work in our favor, such as when we feel a car speeding in our direction is dangerous and we instantly move, or when we decide not take a bite of food that appears to have gone bad. However,...
Engineering Science Reference, 2018. — 444 p. — ISBN: 1522558527, 978-1522558521. As technology continues to become more sophisticated, mimicking natural processes and phenomena becomes more of a reality. Continued research in the field of natural computing enables an understanding of the world around us, in addition to opportunities for manmade computing to mirror the natural...
Springer, 2019. — 111 p. — ISBN: 978-3030023744. This book explores the updated version of the GLOBAL algorithm which contains improvements for a local search algorithm and new Java implementations. Efficiency comparisons to earlier versions and on the increased speed achieved by the parallelization, are detailed. Examples are provided for students as well as researchers and...
Springer, 2022. — 133 p. — ISBN 9783030964122. От цифровых двойников к цифровым личностям и дальше: инженерные и социальные модели для трансгуманистического мира This open access book aims at deepening the understanding of the relation between cyber-physical systems (CPSs) as socio-technical systems and their digital representations with intertwined artificial intelligence...
Dotnetslackers.com, 2008. — 112 p. This book written by Granville Barnett and Luca Del Tongo is part of an effort to provide all developers with a core understanding of algorithms that operate on various common, and uncommon data structures. What this book is, and what it isn’t. Assumed knowledge. Big Oh notation. Imperative programming language. Object oriented concepts....
Springer, 2006. — 664 p. Since a real univariate polynomial does not always have real roots, a very natural algorithmic problem, is to design a method to count the number of real roots of a given polynomial (and thus decide whether it has any). The real root counting problem plays a key role in nearly all the algorithms in real algebraic geometry studied in this book. Much of...
Springer, 2006. — 275 p. — (Data-Centric Systems and Applications). — ISBN: 3540331727 This book is an ideal combination of the soundness of theoretical foundations and the applicability of practical approaches. It is ideally suited for everyone – researchers, students, or professionals – interested in a comprehensive overview of data quality issues. In addition, it will serve as...
Springer, 2013. — 377 p. 82 illus., 12 illus. in color — ISBN: 3642354939, 9783642354939 This Festschrift in honour of Ursula Gather’s 60th birthday deals with modern topics in the field of robust statistical methods, especially for time series and regression analysis, and with statistical methods for complex data structures. The individual contributions of leading experts...
Boca Raton: CRC Press, 2014. — 359 p. Exercises Polynomial-time algorithms On the complexity to compute Exercises Solutions to exercises Bibliographical notes Strassen's algorithm Master theorem Solving recurrences Exercises Solutions to exercises Bibliographical notes Motivating example: The sports hall Designing greedy algorithms Graph coloring Theory of matroids Exercises...
New York: Addison-Wesley, 1988. — 204 p. What do topics ranging from organic chemistry to Napoleon's campaigns have to do with computer programming? This collection of essays demonstrates the many varied aspects of programming, showing how programming can be both a fun and elegant science. Some of the essays cover programming techniques, like how profilers can provide insight...
Independently published, 2019. — 106 p. This book covers various algorithms for compression and encryption, some of which overlap, serving both purposes simultaneously. We will discuss why one algorithm works better for one case and not another as well as how different implementations are superior or more robust. All of the algorithms and code are presented in the C programming...
Morgan Kaufmann / Elsevier, 2013. — 288 p. — ISBN: 0124045766, 9780124045767 Principles of Big Data helps readers avoid the common mistakes that endanger all Big Data projects. By stressing simple, fundamental concepts, this book teaches readers how to organize large volumes of complex data, and how to achieve data permanence when the content of the data is constantly changing....
2nd Edition. — Manning Publications, 2024. — 320 p. — eBook ISBN: 9781633438538. A friendly, fully-illustrated introduction to the most important computer programming algorithms. Master the most widely used algorithms and be fully prepared when you’re asked about them at your next job interview. With beautifully simple explanations, over 400 fun illustrations, and dozens of...
Solution manual to "Introduction to Algorithms Second Edition by Cormen T.H., Leiserson C.E., Rivest R.L., Stein C." — Technical University of Denmark, Copenhagen. 2002. — 51 p.
Foundations
Sorting and Order Statistics
Data Structures
Advanced Design and Analysis Techniques
Advanced Data Structures
Graph Algorithms
Selected Topics
Cambridge University Press, 2010. — 290 p. — ISBN: 0521513383, 9780521513388
Richard Bird takes a radically new approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression...
Springer, 2007. — 654. This handbook is in a sense a continuation of Scheduling Computer and Manufacturing Processes , two editions of which have received kind acceptance of a wide readership. As the previous volume, it is the result of a long lasting German- Polish collaboration. However, due to important reasons, it has a new form. Namely, following the suggestions of the...
We propose elementary ASCII exchange formats for matrices. Specific instances of the format are defined for dense and sparse matrices with real, complex, integer and pattern entries, with special cases for symmetric, skew-symmetric and Hermitian matrices. Sparse matrices are represented in a coordinate storage format. The overall file structure is designed to allow future...
Podręcznik. — Białystok: Politechnika Białostocka, 2020. — 114 s. — ISBN 978-83-66391-35-2. Niniejszy skrypt jest przeznaczony dla Czytelników zainteresowanych projektowaniem efektywnych algorytmów, w tym przede wszystkim dla studentów studiów informatycznych. Może także posłużyć jako podręcznik do samodzielnej nauki dla uczniów szkół średnich pasjonujących się programowaniem...
Boca Raton: Chapman and Hall/CRC, 2023. — 820 p. A best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted...
Cambridge University Press; 1 edition (September 8, 2008) — 472 p. — ISBN: 978-0521880374
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...
Manning Publications, 2022. — 166 p. Graphs are the natural way to understand connected data. This book explores the most important algorithms and techniques for graphs in data science, with practical examples and concrete advice on implementation and deployment. Graph Algorithms for Data Science teaches you how to construct graphs from both structured and unstructured data....
Manning Publications, 2023. — 386 p. — (MEAP v7). Graphs are the natural way to understand connected data. This book explores the most important algorithms and techniques for graphs in data science, with practical examples and concrete advice on implementation and deployment. In Graph Algorithms for Data Science you will learn Labeled-property graph modeling Constructing a...
Manning Publications, 2024. — 353 p. — ISBN 9781617299469. Practical methods for analyzing your data with graphs, revealing hidden connections and new insights. Graphs are the natural way to represent and understand connected data. This book explores the most important algorithms and techniques for graphs in data science, with concrete advice on implementation and deployment....
Academic Press, 2004. — 353 p. Подробно изложена математическая основа косинусного и синусного преобразований, а также быстрые алгоритмы вычисления преобразований. Особое внимание уделено целочисленным алгоритмам. Discrete Cosine and Sine Transforms Definitions and General Properties The Karhunen – Loéve Transform and Optimal Decorrelation Fast DCT/DST Algorithms Integer...
New York: O’Reilly Media, Inc, 2019. — 66 p. With Early Release ebooks, you get books in their earliest form—the authors' raw and unedited content as they write—so you can take advantage of these technologies long before the official release of these titles. This book will enable you to apply graph thinking to solve complex problems. If you want to learn how to build...
Lulu, 2011. — 454 p. — ISBN: 978-1-4467-8506-5 ( Revision 2. 16 June 2012 ) Welcome to Clever Algorithms! This is a handbook of recipes for computational problem solving techniques from the fields of Computational Intelligence, Biologically Inspired Computation, and Metaheuristics. Clever Algorithms are interesting, practical, and fun to learn about and implement. Research...
Lulu, 2011. — 436 p. — ISBN: 978-1-4467-8506-5
Welcome to Clever Algorithms! This is a handbook of recipes for computational problem solving techniques from the fields of Computational Intelligence, Biologically Inspired Computation, and Metaheuristics. Clever Algorithms are interesting, practical, and fun to learn about and implement. Research scientists may be interested in...
Springer, 2007. — 379 p. This is a book about scheduling algorithms. The first such algorithms were formulated in the mid fifties. Since then there has been a growing interest in scheduling. During the seventies, computer scientists discovered scheduling as a tool for improving the performance of computer systems. Furthermore, scheduling problems have been investigated and...
2nd Edition. — Springer, 2012. — 348 p. — (GOR Publications). — ISBN: 3642239285. Scheduling problems have been investigated since the late fifties. Two types of applications have mainly motivated research in this area: project planning and machine scheduling. While in machine scheduling a large number of specific scheduling situations depending on the machine environment and...
Springer, 2007. — 326 p. — (Algorithms and Computation in Mathematics, Volume 20) This book Binary Quadratic Forms - An Algorithmic Approach has been published as Volume 20 in the series ”Algorithms and Computation in Mathematics” of Springer. The main author of the book Johannes Buchmann is a well-known computational number theory expert. The book consists of twelve chapters...
Pragmatic Bookshelf, 2015. — 286 p. A book on mazes? Seriously? Yes! Not because you spend your day creating mazes, or because you particularly like solving mazes. But because it’s fun. Remember when programming used to be fun? This book takes you back to those days when you were starting to program, and you wanted to make your code do things, draw things, and solve puzzles. It’s...
Kluwer, 2004. — 343 p. This book is based on contributions to two workshops in the series International Workshop on Parsing Technology. IWPT2000, the 6th workshop in the series, was held in Trento, Italy, in February 2001, and was organized by John Carroll (Programme Chair), Harry Bunt (General Chair) and Alberto Lavelli (Local Chair). The 7th workshop, IWPT2001, took place in...
River Publishers, 2023. — 314 p. — (River Publishers Series In Computing And Information Science And Technology). — ISBN 978-87-7004-066-2. Interactive visualization and visual analytics tools have been designed and developed in the past and will be developed in the future as well. In each application domain in which data is measured, generated, and recorded we see a potential...
Springer, 2011. — 538 p. Real-time computing plays a crucial role in our society since an increasing number of complex systems rely, in part or completely, on computer control. Examples of applications that require real-time computing include nuclear power plants, railway switching systems, automotive and avionic systems, air traffic control, telecommunications, robotics, and...
Independently published, 2024. — 112 p. Dive into the world of data structures and algorithms with this comprehensive guide tailored for Python programmers. "Data Structures and Algorithms for Beginners: Elevating Your Coding Skills with Data Structures and Algorithms" is an essential resource for anyone looking to deepen their understanding of computational methods and enhance...
Independently Published, 2024. — 274 p. This comprehensive guide is designed to introduce budding programmers and those new to computer science to the critical concepts of data structures and algorithms—key components that underpin efficient problem-solving and coding practices. In the realm of software development, understanding data structures and algorithms is not just an...
Princeton University Press, 2004. — 211 p. The general areas of failure detection and model identification cover a number of different technical areas and numerous types of applications. No book could hope to cover all of this material. This book focuses on one particular approach to failure detection which is the use of auxiliary signals to assist in multimodel identification....
New York: Nova Science Publishers, 2022. - 125 p. - (Computer Science, Technology and Applications). - ISBN 9798886973860. As there can be more than one algorithm for the same problem, designing and analyzing an algorithm becomes important in order to make it as efficient and robust as possible. This book will serve as a guide to design and analysis of computer algorithms....
OpenGenus, 2021. — 44 p. Binary Tree is one of the most important Data Structure (for Coding Interviews and Real Life System Design) and is equally challenging. With practice and correct way of thinking, you can master it easily and know when to use it in real life problems. We will attempt one problem every day in the week and analyze the problem deeply. Our schedule: Day 1:...
OpenGenus, 2020. — 46 p. Become Dynamic Programming Master in 7 days. Dynamic Programming is one of the most important algorithmic domains and is equally challenging. With practice and correct way of thinking, you can master it easily. If a problem takes O(2^N) time to search a solution among possible solutions, Dynamic Programming has the potential to reduce it to O(N) or...
OpenGenus, 2021. — 363 p. — ASIN B094YJ1K13. This book Binary Tree Problems is carefully crafted to present you the knowledge and practice (around the data structure, Binary Tree) needed to ace Coding Interviews and Competitive Coding Contests. The book takes you through the fundamentals of Binary Tree, presents how to implement it in a good and secure way, make you practice...
N.Y.: Programmers Mind Inc, 2014. — 233 p.
This book gives a good start and Complete introduction for data structures and algorithms for Beginner’s. While reading this book it is fun and easy to read it. This book is best suitable for first
time DSA readers, Covers all fast track topics of DSA for all Computer Science students and
Professionals.
Data Structures and Other...
21st International Symposium, ISAAC 2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part II
493 pages
published 2011
This book constitutes the refereed proceedings of the 21st International Symposium on Algorithms and Computation, ISAAC 2010, held in Jeju, South Korea in December 2010. The 77 revised full papers presented were carefully reviewed and selected from...
Springer, 2020. — 212 p. — ISBN: 3030418855. This book brings together two important trends: graph algorithms and high-performance computing . Efficient and scalable execution of graph processing applications in data or network analysis requires innovations at multiple levels: algorithms, associated data structures, their implementation and tuning to a particular hardware....
Springer, 2006. —212 p. The aim of this book is to outline the recent development of Markov chain models for modeling queueing systems, Internet, re-manufacturing systems, inventory systems, DNA sequences, genetic networks and many other practical systems. This book consists of eight chapters. In Chapter 1, we give a brief introduction to the classical theory on both discrete...
Data-Centric Systems and Applications. Springer-Verlag Berlin Heidelberg, 2012. — 279 p. — ISBN 978-3-642-31163-5, ISBN 978-3-642-31164-2 (eBook) Data matching is the task of identifying, matching, and merging records that correspond to the same entities from several databases. The entities under consideration most commonly refer to people, such as patients, customers, tax...
The MIT Press, 2013. — 240 p. — ISBN: 978-0-262-51880-2. Have you ever wondered how your GPS can find the fastest way to your destination, selecting one route from seemingly countless possibilities in mere seconds? How your credit card account number is protected when you make a purchase over the Internet? The answer is algorithms. And how do these mathematical formulations...
3rd edition. — The MIT Press, 2009. — 1312 p. — ISBN-13 978-0262033848. Solutions for a select set of exercises and problems for Introduction to Algorithms, Third Edition . Selected Solutions for Chapter 2: Getting Started Selected Solutions for Chapter 3: Growth of Functions Selected Solutions for Chapter 4: Divide-and-Conquer Selected Solutions for Chapter 5: Probabilistic...
3rd Edition. — MIT Press, 2009. — 499 p. Руководство инструктора для 3-ей редакции фундаментальной книги по алгоритмам Томаса Кормена "Алгоритмы. Построение и анализ" включает в себя решения всех задач из книги, а также краткую выжимку информации по каждой главе для удобного запоминания. This document is an instructor’s manual to accompany Introduction to Algorithms, Third...
3rd Edition. — MIT Press, 2009. — 1312 p. — ISBN 978-0262033848. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter...
2 edition — McGraw-Hill, 2001. — 1056 p. — ISBN 10-9780070131514, 13-978-0070131514 This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution agreement with the McGraw-Hill Book Company. This...
4th Edition. — The MIT Press, 2022. — 1312 p. — ISBN 9780262046305. A comprehensive update of the leading algorithms text, with new material on matchings in bipartite graphs, online algorithms, machine learning, and other topics. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines...
New Age International, 2006 — 376 p. Principles of DATA STRUCTURES using C and C++ covers all the fundamental topics to give a better understanding about the subject. The study of data structures is essential to every one who comes across with computer science. This book is written in accordance with the revised syllabus for B.Tech./B.E. (both Computer Science and Electronics...
John Wiley, 2013. — 535 p. This text attempts to realize a number of goals. First, the book attempts to introduce the reader to a number of classical facility location models on which other more complicated and realistic models are based. Second, the book tries to assist the reader in developing his or her own modeling skills. Toward that end, many of the exercises at the end...
Independently published, 2021. — 186 p. — ISBN: 9798591756123. Data Structures are the programmatic way of storing data so that data can be used efficiently. Almost every enterprise application uses various types of data structures in one or the other way. This tutorial will give you a great understanding on Data Structures needed to understand the complexity of enterprise...
Michael David, 2021. — 78 p. This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hillclimbing. Any solvable problem generally has at least one algorithm of each of the following types: 1. the obvious way; 2. the methodical way; 3. the...
FiNew York: Independently published, 2021. — 78 p. This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hill-climbing. Any solvable problem generally has at least one algorithm of each of the following types: the obvious way; the methodical...
Independently published, 2021. — 78 p. This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hill-climbing. Any solvable problem generally has at least one algorithm of each of the following types:1. the obvious way;2. the methodical way;3....
Springer, 2010. — 550 p. Triangulations appear in many different parts of mathematics and computer science since they are the natural way to decompose a region of space into smaller, easy-to-handle pieces. From volume computations and meshing to algebra and topology, there are many natural situations in which one has a fixed set of points that can be used as vertices for the...
Hagen: University of Applied Sciences of Hagen, 2015. — 123 p. Why mathematics in a book about algorithmics? Algorithms are, in essence, applied mathematics. Even if they deal with apparently “unmathematical” subjects such as manipulating strings or searching objects, mathematics is the basis. To mention just a few examples: the classical algorithmic concept of recursion is...
Dedov Florian, 2020. — 116 p. — ISBN: n/a. The Most Important Skill in Computer Science! The field of algorithms and data structures is one of the most important in computer science. You will rarely be invited to a coding interview at Google, Microsoft or Facebook and not be asked questions about it. This is because these companies know how valuable the skills taught are. It...
Cambridge University Press, 2020. — 237 p. — ISBN: 9781108487764, 9781108767910. In Beyond the Algorithm: Qualitative Insights for Gig Work Regulation, Deepa Das Acevedo and a collection of scholars and experts show why government actors must go beyond mass surveys and data-scrubbing in order to truly understand the realities of gig work. The contributors draw on qualitative...
Springer, 2013. — 552 p. — ISBN: 3642401031.
На англ. языке.
This book constitutes the refereed proceedings of the 13th Algorithms and Data Structures Symposium, WADS 2013, held in London, ON, Canada, August 2013. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of...
New York: ICI Global, 2017. — 358 p. Metaheuristic algorithms are present in various applications for different domains. Recently, researchers have conducted studies on the effectiveness of these algorithms in providing optimal solutions to complicated problems. Advancements in Applied Metaheuristic Computing is a crucial reference source for the latest empirical research on...
Springer, 2005. — 432 p. The subject of this book is the solution of polynomial equations, that is, systems of (generally) non-linear algebraic equations. This study is at the heart of several areas of mathematics and its applications. It has provided the motivation for advances in different branches of mathematics such as algebra, geometry, topology, and numerical analysis. In...
De Gruyter, 2024. — 383 p. — (De Gruyter Series on the Applications of Mathematics in Engineering and Information Sciences 17). — ISBN-13 978-3111228006. Algorithms are ubiquitous in the contemporary technological world, and they ultimately consist of finite sequences of instructions used to accomplish tasks with necessary input values. This book analyzes the top performing...
Pearson Education New Zealand Limited, 2002. — 262 p. "Introduction to Algorithms, Data Structures and Formal Languages" provides a concise, straightforward, yet rigorous introduction to the key ideas, techniques, and results in three areas essential to the education of every computer scientist. The textbook is closely based on the syllabus of the course COMPSCI220, which the...
Книги по алгоритмам и структурам данных из серии Dr. Dobb’s Essential (9 классических книг и подборка статей с примерами кода). Data Structures and Algorithms by Alfred V. Aho, Murray Hill, John E. Hopcroft, and Jeffrey D. Ullman Data Structures: From Arrays to Priority Queues by Wayne Amsbury Introduction to Algorithms by Thomas H. Cormen, Charles E. Leiserson, and Ronald L....
4th Edition. — Cengage Learning, 2012. — 792 p. — ISBN10: 1-133-60842-6, ISBN13: 978-1-133-60842-4. На англ. языке. Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. T heoretical, yet practical, Data Structures and Algorithms in C++ , 4E by experienced...
Cengage Learning, 2012. — 818 p. — 4th ed. — ISBN: 1133608426, 9781133608424
Strengthen your understanding of data structures and their algorithms for the foundation you need to successfully design, implement and maintain virtually any software system. Theoretical, yet practical, Data Structures and Algorithms in C++, 4E by experienced author Adam Drosdek highlights the...
Second Edition. — Course Technology, 2005. — 770 р. Using the Java programming language, author Adam Drozdek highlights three important aspects of data structures and algorithms. First, the book places special emphasis on the connection between data structures and their algorithms, including an analysis of the algorithms' complexity. Second, the book presents data structures in...
Springer, 2012. — 450 p. An approximation algorithm is an efficient algorithm that produces solutions to an optimization problem that are guaranteed to be within a fixed ratio of the optimal solution. Instead of spending an exponential amount of time finding the optimal solution, an approximation algorithmsettles for near-optimal solutions within polynomial time in the input...
2nd ed. — Cambridge: Cambridge University Press, 2024. — 617 p. — ISBN 1009302140. Understand algorithms and their design with this revised student-friendly textbook . Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable . Without grinding through lots of formal proof,...
New York: Cambridge University Press, 2008. — 472 p. — ISBN: 978-0-511-41370-4. There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and...
Б.м.: Independently published, 2021. — 78 p. This book covers techniques for the design and analysis of algorithms. The algorithmic techniques covered include: divide and conquer, backtracking, dynamic programming, greedy algorithms, and hill-climbing. Any solvable problem generally has at least one algorithm of each of the following types: the obvious way; the methodical way;...
Morgan Kaufmann, 2004. — 555 p. Слайды, исправления ошибок и решения задач к книге Ercegovac M.D., Lang T. Digital Arithmetic Our main objective in preparing this book is to provide a comprehensive discussion of the main ideas and concepts in digital arithmetic, reflecting both the theory and design aspects, and to help students and practicing engineers develop a good...
CRC Press, 2015. — 318 p. Recent technological advances in the last two decades have provided availability of enormous amounts of data about large networks consisting of hundreds and thousands of nodes. These so-called complex networks have non-trivial topological features and can vary from technological networks to social networks to biological networks. The study of complex...
Springer International Publishing AG, 2018. — 138 p. — (Logic, Argumentation & Reasoning 15). — ISBN: 331972973X. This book explains exactly what human knowledge is. The key concepts in this book are structures and algorithms, i.e., what the readers “see” and how they make use of what they see. Thus in comparison with some other books on the philosophy (or methodology) of...
Cambridge: Cambridge University Press, 2023. — 319 p. There are many textbooks on algorithms focusing on big-O notation and basic design principles. This book offers a unique approach to taking the design and analyses to the level of predictable practical efficiency, discussing core and classic algorithmic problems that arise in the development of big data applications, and...
Springer, 2018. — 174 p. This book offers a gentle motivation and introduction to computational thinking, in particular to algorithms and how they can be coded to solve significant, topical problems from domains such as finance, cryptography, Web search, and data compression. The book is suitable for undergraduate students in computer science, engineering, and applied mathematics,...
O’Reilly Media, 2006. — 166 p. — ISBN: 0596100167, 9780596100162 Dashboards have become popular in recent years as uniquely powerful tools for communicating important information at a glance. Although dashboards are potentially powerful, this potential is rarely realized. The greatest display technology in the world won't solve this if you fail to use effective visual design....
Arcler, 2019. — 252 p. Preface Fundamentals of Algorithms Classification of Algorithms An Introduction to Heuristic Algorithms Types of Machine Learning Algorithms Approximation Algorithms Comparative Investigation Of Exact Algorithms For 2D Strip Packing Problem Governance of Algorithms Limitations of Algorithmic Governance Options Index
Arcler Press, 2019. — 256 p. — ISBN: 978-1-77361-618-6. Introduction to Search Algorithms considers various aspects of search algorithms including an extensive overview of search algorithms and related terms. It includes introduction and the fundamentals of search algorithms, fundamentals of linear search algorithm, introduction to a* based best-first search algorithms....
Springer, 2018. — 180 p. — (Frontiers in Mathematics). — ISBN10: 3319952633. The book collects and contributes new results on the theory and practice of ill-posed inverse problems. Different notions of ill-posedness in Banach spaces for linear and nonlinear inverse problems are discussed not only in standard settings but also in situations up to now not covered by the...
Cambridge University Press, 2019. — 534 p. — ISBN: 978-1-107-05776-0. Preprocessing, or data reduction, is a standard technique for simplifying and speeding up computation. Written by a team of experts in the field, this book introduces a rapidly developing area of preprocessing analysis known as kernelization. The authors provide an overview of basic methods and important...
Springer, 2010. — 210 p. — ISBN 978-3-642-16532-0. For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are...
Chandos Publishing, 2008. — 220 p. — (Chandos Information Professional Series). — ISBN: 1843343010, 9781843343011
This book assists information professionals in improving the usability of digital objects by adequately documenting them and using tools for metadata management. It provides practical advice for libraries, archives, and museums dealing with digital collections in a...
O’Reilly Media, 2020. — 347 p. — ISBN: 978-1-492-07266-9. Most of the high-profile cases of real or perceived unethical activity in data science aren’t matters of bad intent. Rather, they occur because the ethics simply aren’t thought through well enough. Being ethical takes constant diligence, and in many situations identifying the right choice can be difficult. In this...
Wiley, 2012. — 334 p. Big data is the next wave of new data sources that will drive the next wave of analytic innovation in business, government, and academia. These innovations have the potential to radically change how organizations view their business. The analysis that big data enables will lead to decisions that are more informed and, in some cases, different from what they...
Springer, 2019. — 610 p. — ISBN: 9783030247669. This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Data Structures, WADS, 2019, held in Edmonton, AB, Canada, in August 2019. The 42 full papers presented together with 3 invited lectures, we carefully reviewed and selected from a total of 88 submissions. They present original...
Springer, 2016. — 205 p. — ISBN: 978-3-658-12225-6; ISBN: 978-3-658-12224-9. Christian Fürber investigates the useful application of semantic technologies for the area of data quality management. Based on a literature analysis of typical data quality problems and typical activities of data quality management processes, he develops the Semantic Data Quality Management framework...
Springer, 2011. — 793 p. 297 illus. — ISBN: 9781461414155 Data Intensive Computing refers to capturing, managing, analyzing, and understanding data at volumes and rates that push the frontiers of current technologies. The challenge of data intensive computing is to provide the hardware architectures and related software systems and techniques which are capable of transforming...
Books on Demand GmbH, 2019. - 220 p. A technical book about popular space-efficient data structures and fast algorithms that are extremely useful in modern Big Data applications. Probabilistic data structures is a common name for data structures based mostly on different hashing techniques. Unlike regular (or deterministic) data structures, they always provide approximated...
Leanpub, 2020. — 152 p. Version: 2020-08-15. A collection of Python code solving some of the common Data Structures and Algorithms you might be expected to encounter at an interview process. Land the Software Engineer job you want by mastering one of the most challenging questions you might face during the interview. This book is a collection of Data Structures and Algorithms...
2nd Edition. — Springer, 2020. — 535 p. — ISBN: 978-3-662-59361-5. This is a comprehensive study of various time-dependent scheduling problems in single-, parallel- and dedicated-machine environments. In addition to complexity issues and exact or heuristic algorithms which are typically presented in scheduling books, the author also includes more advanced topics such as matrix...
Proceedings of the 6th International for Approximation, Ambleside, UK, August 31st – September 4th, 2009 Conference on Algorithms 319 pages published 2011 This book collects up-to-date papers from world experts in a broad variety of relevant applications of approximation theory, including dynamical systems, multiscale modelling of fluid flow, metrology, and geometric modelling...
London: Wayland, 2016. — 35 p. Discover how computers work and learn about computer coding languages. The bright and engaging book guides readers through clear explanations of binary code, simple algorithms and computer language. With real-life examples, readers learn about the development of coding using simple decision-making processes. Looks at programming languages that...
Independently published, 2021. — 215 p. Scratch 3.0. Inside, there are about a hundred algorithms and Scratch programs, displayed as examples or exercises with their correction, easily usable in classrooms or at home. A common belief is that computers are very intelligent machines. That’s a complete lie, computers are very stupid and can’t do anything without their programmers...
Packt Publishing, 2024. — 368 p. Key Features: Leverage data-as-product to unlock the modular platform potential and fix flaws in traditional monolithic architectures Learn how to identify, implement, and operate data products throughout their life cycle Design and execute a forward-thinking strategy to turn your data products into organizational assets Book Description:...
Cambridge University Press, 2017. — 469 p. — ISBN: 978-1-107-19405-2. Property testing is concerned with the design of super-fast algorithms for the structural analysis of large quantities of data. The aim is to unveil global features of the data, such as determining whether the data has a particular property or estimating global parameters. Remarkably, it is possible for...
Springer, 2009. – 336 p. – 130 illus., 107 in color – ISBN: 184882405X, 9781848824065 Implicit objects have gained increasing importance in geometric modeling, visualisation, animation, and computer graphics, because their geometric properties provide a good alternative to traditional parametric objects. This book presents the mathematics, computational methods and data...
Springer, 2009. — 338 p. This book presents the mathematics, computational methods and data structures, as well as the algorithms needed to render implicit curves and surfaces. Implicit objects have gained an increasing importance in geometric modelling, visualisation, animation, and computer graphics due to their nice geometric properties which give them some advantages over...
CRC Press, 2007. — 1351 p. — ISBN: 1584885505
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics.
Starting with basic approaches, the handbook...
CRC Press, 2018. — 797p. The book reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with...
CRC Press, 2018. — 817 p. The book reflects the tremendous growth in the field, over the past two decades. Through contributions from leading experts, this handbook provides a comprehensive introduction to the underlying theory and methodologies, as well as the various applications of approximation algorithms and metaheuristics. Volume 1 of this two-volume set deals primarily with...
Cambridge University Press, 2013. — 299 p. — ISBN: 0521191955, 9780521191951. The world is awash with digital data from social networks, blogs, business, science and engineering. Data-intensive computing facilitates understanding of complex problems that must process massive amounts of data. Through the development of new classes of software, algorithms and hardware,...
O’Reilly Media, 2020. — 420 p. — ISBN13: 978-1-492-04407-9. Graph data closes the gap between the way humans and computers view the world. While computers rely on static rows and columns of data, people navigate and reason about life through relationships. This practical guide demonstrates how graph data brings these two approaches together. By working with concepts from graph...
New York: Morgan & Claypool, 2021. — 194 p. Providing a shared memory abstraction in distributed systems is a powerful tool that can simplify the design and implementation of software systems for networked platforms. This enables the system designers to work with abstract readable and writable objects without the need to deal with the complexity and dynamism of the underlying...
Springer, 2012. — 264 p. This text, based on a graduate course taught by the authors, introduces the reader to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics as well as a significant amount of recent and more advanced material, sometimes on the edge of current research. Methods based on semidefinite programming have...
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2006. — 91 p. Error-correcting codes are used to cope with the corruption of data by noise during communication or storage. A code uses an encoding procedure that judiciously introduces redundancy into the data to produce an associated codeword. The redundancy built into the codewords enables...
Leanpub, Gábor László Hajba, 2023. — 220 p. Руководство по динамическому программированию: осваиваем эффективные решения Unleash the power of dynamic programming! Master efficiency and solve complex problems with expertly crafted solutions. Java and Python code examples guide your path to optimized application performance. Dive into "The Dynamic Programming Manual" and unlock...
Manning Publications, 2024. — 280 p. — ISBN: 978-1633437418. A friendly illustrated guide to designing and implementing your first database. Grokking Relational Database Design makes the principles of designing relational databases approachable and engaging. Everything in this book is reinforced by hands-on exercises and examples. In Grokking Relational Database Design, you’ll...
ITexLi, 2023. — 119 p. — ISBN 1839690879 9781839690877 1839690860 9781839690860 1839690887 9781839690884. Algorithms, particularly those embedded in search engines, social media platforms, recommendation systems, and information databases, play an increasingly important role in selecting what information is most relevant to us, which is a crucial feature of our participation in...
[Wrox, 2006].
This book aims to explain those algorithms and data structures most commonly encountered in day-today software development, while remaining at all times practical, concise, and to the point, with little or no verbiage to distract from the core concepts and examples.
Second edition. — O’Reilly, 2016. — 389 p. — ISBN: 978-1-4919-4892-7. This book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate.
O’Reilly Media, Inc., 2021. — 282 p. — ISBN 978-1-492-09106-6. When it comes to writing efficient code, every software professional needs to have an effective working knowledge of algorithms. In this practical book, author George Heineman (Algorithms in a Nutshell) provides concise and informative descriptions of key algorithms that improve coding in multiple languages....
2nd ed. — Mount St. Mary’s University (Dept. of Math. and C.S.), 2019. — 144 p. This book covers standard topics in data structures including running time analysis, dynamic arrays, linked lists, stacks, queues, recursion, binary trees, binary search trees, heaps, hashing, sets, maps, graphs, and sorting. . It is based on Data Structures and Algorithms classes I’ve taught over...
Springer, 2015. — 194 p. — ISBN: 9783319150772, 9783319150789, 3319150774. The rapidly progressing digital revolution is now touching the foundations of the governance of societal structures. Humans are on the verge of evolving from consumers to prosumers, and old, entrenched theories – in particular sociological and economic ones – are falling prey to these rapid developments....
Packt Publishing, 2015. — 280 p.
Learning Object-Oriented Programming is an easy-to-follow guide full of hands-on examples of solutions to common problems with object-oriented code in Python, JavaScript, and C#. It starts by helping you to recognize objects from real-life scenarios and demonstrates that working with them makes it simpler to write code that is easy to understand...
Springer, 2006. — 237 p. This book is entirely about triangulations. With emphasis on computational issues, we present the basic theory necessary to construct and manipulate triangulations. In particular, we make a tour through the theory behind the Delaunay triangulation, including algorithms and software issues. We also discuss various data structures used for the...
Sebastopol: O’Reilly, 2019. — xvi+240 p. — ISBN: 978-1-492-05781-9. Learn how graph algorithms can help you leverage relationships within your data to develop intelligent solutions and enhance your machine learning models. With this practical guide,developers and data scientists will discover how graph analytics deliver value, whether they’re used for building dynamic network...
Springer, 2022. — xii, 136 p. — (SpringerBriefs in Mathematics). — ISBN 978-3-031-11697-1, 978-3-031-11698-8. This book focuses on linear time eigenvalue location algorithms for graphs. This subject relates to spectral graph theory, a field that combines tools and concepts of linear algebra and combinatorics, with applications ranging from image processing and data analysis to...
Syncfusion Inc, 2012. — 111 p. Categories: General Programming Data Structures Succinctly Part 1 is your first step to a better understanding of the different types of data structures, how they behave, and how to interact with them. Starting with simple linked lists and arrays, and then moving to more complex structures like binary search trees and sets, author Robert Horvick...
Syncfusion Inc, 2013. — 126 p. Categories: General Programming Data Structures Succinctly Part 2 is your concise guide to skip lists, hash tables, heaps, priority queues, AVL trees, and B-trees. As with the first book, you'll learn how the structures behave, how to interact with them, and their performance limitations. Starting with skip lists and hash tables, and then moving...
Singapore: World Scientific Publishing Company, 2023. — 610 p. — ISBN 9811263833. This comprehensive compendium provides a rigorous framework to tackle the daunting challenges of designing correct and efficient algorithms. It gives a uniform approach to the design, analysis, optimization, and verification of algorithms. The volume also provides essential tools to understand...
Springer, 2009. — 367 p. The public image of computer science does not reflect its true nature. The general public and especially high school students identify computer science with a computer driving license. They think that studying computer science is not a challenge, and that anybody can learn it. Computer science is not considered a scientific discipline but a collection...
Springer, 2005. — 290 p. Randomization has become a standard approach in algorithm design. Efficiency and simplicity are the main features of randomized algorithms that often made randomization a miraculous springboard for solving complex problems in various applications. Especially in the areas of communication, cryptography, data management, and discrete optimization,...
Springer, 2023. — 233 p. This book constitutes the refereed proceedings of the 43rd IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems, FORTE 2023, held in Lisbon, Portugal, in June 2023, as part of the 18th International Federated Conference on Distributed Computing Techniques, DisCoTec 2023. The 13 regular papers and 3...
Amazon Digital Services LLC., 2018. — 141 p. — ASIN B07FDLH599. This is not a freaking textbook. No confusing academic jargon. No long lists of properties to memorize. No proofs. Because that stuff doesn’t help you actually get it. Here’s what does: Learning what to picture in your head when you think of a dynamic array or a hash map. Learning how to think in algorithms. That’s...
Springer, 2017. — 272 p. — ISBN: 978-3-319-63344-2. This book presents source code modularization as a key activity in reverse engineering to extract the software architecture from the existing source code. To this end, it provides detailed techniques for source code modularization and discusses their effects on different software quality attributes. Nonetheless, it is not a...
N.-Y.: Springer, 2007. - 387p.
Approximation methods are vital in many challenging applications of computational science and engineering.
This is a collection of papers from world experts in a broad variety of relevant applications, including pattern recognition, machine learning, multiscale modelling of fluid flow, metrology, geometric modelling, tomography, signal and image...
MondAt Kft, 2007. — 579 p. It is a special pleasure for me to recommend to the Readers the book Algorithms of Computer Science, edited with great care by Antal Ivanyi. Computer algorithms form a very important and fast developing branch of computer science. Design and analysis of large computer networks, large scale scienti c computations and simulations, economic planning,...
MondAt Kft, 2007. — 573 p. It is a special pleasure for me to recommend to the Readers the book Algorithms of Computer Science, edited with great care by Antal Ivanyi. Computer algorithms form a very important and fast developing branch of computer science. Design and analysis of large computer networks, large scale scienti c computations and simulations, economic planning,...
AnTonCom, 2011. — 328 p. This third volume of the algorithm book (volume 1 /file/916180/, volume 2 /file/916182/) contains seven new chapters. The Branch and Bound Method Comparison Based Ranking Complexity of Words Conflict Situations General Purpose Computing on Graphics Processing Units Perfect Arrays Score Sets and Kings
Cambridge University Press, 2015. — 390 pages. — ISBN: 978-0521876087 How do you distinguish a cat from a dog by their DNA? Did Shakespeare really write all of his plays? Pattern matching techniques can offer answers to these questions and to many others, from molecular biology, to telecommunications, to classifying Twitter content. This book for researchers and graduate...
CRC Press, 2022. — 363 p. — ISBN 9780367616373. This book provides a quick study of data structures. The conventions of ‘C’ language is used to describe the used algorithms and Data Structures primarily, because of their value. The book provides a comprehensive and technically rigorous introduction to data structures such as arrays, stacks, queues, linked lists, trees and...
CreateSpace Independent Publishing Platform, 2016. — 418 p. — ISBN: 978-1541128255. "Problem Solving in Data Structures & Algorithms" is a series of books about the usage of Data Structures and Algorithms in computer programming. The book is easy to follow and is written for interview preparation point of view. In various books, the examples are solved in various languages like...
Springer, 2013. — 91 p. This work is a synopsis of research work done by me and my fellow co-investigators in the fields of computer arithmetic and computer architecture spanning a period of over 20 years. During the 1990s, discussion among the computer architects used to be focused on weighing the merits and demerits of control-flow and data-flow models of computation for...
Gruyter GmbH, 2019. — 411 p. — ISBN: 978-3-11-061549-4. Algorithms are the essence of programming. After their construction, they have to be translated to the codes of a specific programming language. There exists a maximum of ten basic algorithmic templates. This textbook aims to provide the reader with a more convenient and efficient method to create a program by translating...
Boston: The MIT Press, 2021. — 401 p. — (Inside Technology) — ISBN 9780262542142 A laboratory study that investigates how algorithms come into existence. Algorithms - often associated with the terms big data, Machine Learning (ML), or Artificial Intelligence (AI) - underlie the technologies we use every day, and disputes over the consequences, actual or potential, of new...
Independently published, 2021. — 176 p. — ASIN B095BPM2MF. Tree calculus is seeded by a single operator, whose self-application gives rise to pow- erful reflective programs including a size program that can compute its own size, an equality program that can decide its own equality, and a self-evaluator that can evaluate itself. This is achieved without any of the usual outside...
Springer, 2007. — 266 p. The philosophy of just-in-time manufacturing was first introduced by the Japanese automobile producer Toyota in 1950s. This philosophy may be briefly defined as elimination of waste and simultaneous continuous improvement of productivity. There are many different sources of waste in a manufacturing system; therefore, many activities need to be...
Wiley, 2014. — 304 p. — ISBN: 1118342321, 9781118342329
Create a competitive advantage with data quality
Data is rapidly becoming the powerhouse of industry, but low-quality data can actually put a company at a disadvantage. To be used effectively, data must accurately reflect the real-world scenario it represents, and it must be in a form that is usable and accessible....
University Of Chicago Press, 2014. — 328 p. — ISBN13: 978-0226002736. These days, we take for granted that our computer screens—and even our phones—will show us images in vibrant full color. Digital color is a fundamental part of how we use our devices, but we never give a thought to how it is produced or how it came about. Chromatic Algorithms reveals the fascinating history...
Independently published, 2020. — 404 p. — ISBN B08LBY7Q16. A Data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an effective way. An Algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. Algorithms are generally created...
CareerMonk Publications, 2019. — 555 p. Algorithm Design Techniques: Recursion, Backtracking, Greedy, Divide and Conquer, and Dynamic Programming Algorithm Design Techniques is a detailed, friendly guide that teaches you how to apply common algorithms to the practical problems you face every day as a programmer. What's Inside Enumeration of possible solutions for the problems....
5th Edition. — CareerMonk Publications, 2017. — 828 p. — ISBN: 9788192107547 "Data Structures And Algorithms Made Easy: Data Structure And Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer...
2nd edition. — CareerMonk Publications, 2017. — 450 р. — ISBN: 978-8192107554. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy in Java: Data Structure And Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in...
CareerMonk Publications, 2020. — 416 p. — ISBN: 978-8192107554. “Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles” is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. It can...
McGraw-Hill Osborne Media, 2004. – 301 p. – ISBN: 0072253592 The fast and easy way to understanding the fundamentals of data structures If you’ve been searching for that quick, easy-to-understand guide to walk you through data structures, look no further. Data Structures Demystified is all these things and more. Whether you’re trying to program stacks and linked lists or figure...
Leanpub, 2023. — 121 p. With a focus on practicality, This guide is designed to provide readers with the tools they need to approach problem-solving differently, write efficient code, and clear their coding interviews. Preparing for coding interviews can often be a daunting task, causing stress and anxiety for many individuals. Several factors contribute to this feeling: -...
Arcler Press, 2023. — 342 p. Data structure and algorithms are two of the most important aspects of Computer science. Data structure and algorithms help in understanding the nature of the problem at a deeper level and thereby a better understanding of the world. Learning data structure and algorithms will help you become a better programmer. This book provides a comprehensive...
CRC Press, 2009. – 379 p. – ISBN: 0849328802, 9780849328800 Data flow analysis is used to discover information for a wide variety of useful applications, ranging from compiler optimizations to software engineering and verification. Modern compilers apply it to produce performance-maximizing code, and software engineers use it to re-engineer or reverse engineer programs and...
Amazon, Netflix, Google, and Facebook have used data-driven design techniques to improve the user experience of their consumer products. With this book, you'll learn how improve your design decisions through data-driven A/B testing, and how you can apply this process to everything from small design tweaks to large-scale UX concepts. Want to determine if a new color will improve...
O’Reilly Media, 2015. — 369 p. — ISBN: 978-1-449-33483-3. Amazon, Netflix, Google, and Facebook have used data-driven design techniques to improve the user experience of their consumer products. With this book, you'll learn how improve your design decisions through data-driven A / B testing, and how you can apply this process to everything from small design tweaks to...
World Scientific, 2021. — 404 p. — ISBN 978-9811238529. This book is the result of several decades of teaching experience in data structures and algorithms. It is self-contained but does assume some prior knowledge of data structures, and a grasp of basic programming and mathematics tools. Basic Concepts in Algorithms focuses on more advanced paradigms and methods combining...
Cambridge: Cambridge University Press, 2016. — 226 p. Data structures are the fundamental building blocks of any computer program, used for storing, representing and manipulating data in a computer. This text presents the basic concepts of data structures as part of the art of writing computer programs. The author concentrates on the fundamentals of what should be done to solve a...
New York: Springer, 2020. — 360 p. This is a central topic in any computer science curriculum. To distinguish this textbook from others, the author considers probabilistic methods as being fundamental for the construction of simple and efficient algorithms, and in each chapter at least one problem is solved using a randomized algorithm. Data structures are discussed to the...
Knowledge flow, 2015. — 50 p. — ASIN: B00U47EHEE Data Structures is a study or a technique used to understand how to store a bunch of data in an organized manner, so it can be used in a very sophisticated manner for designing of programs and algorithms. Data structure for string and pattern matching Algorithm Arrays and Pointers Linked Lists Stacks and Queues Trees Graphs in...
Berlin: Springer, 1992. — 124 p. One way to advance the science of computational geometry is to make a comprehensive study of fundamental operations that are used in many different algorithms. This monograph attempts such an investigation in the case of two basic predicates: the counterclockwise relation pqr, which states that the circle through points (p, q, r) is traversed...
Addison-Wesley Professional, 2022. — 733 p. — ISBN 0201038064. The Art of Computer Programming is Knuth's multivolume analysis of algorithms. With the addition of this new volume, it continues to be the definitive description of classical computer science. Volume 4B, the sequel to Volume 4A, extends Knuth's exploration of combinatorial algorithms. These algorithms are of keen...
Springer, 2000. — 399 p.
This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial...
San Francisco: No Starch Press, 2025. — 410 p. — ISBN 1718503865. Enter the wonderful world of graph algorithms, where you’ll learn when and how to apply these highly useful data structures to solve a wide range of fascinating (and fantastical) computational problems. Graph Algorithms the Fun Way offers a refreshing approach to complex concepts by blending humor, imaginative...
New York: No Starch Press, 2016. — 259 p. Meet Frank Runtime. Disgraced ex-detective. Hard-boiled private eye. Search expert. When a robbery hits police headquarters, it’s up to Frank Runtime and his extensive search skills to catch the culprits. In this detective story, you’ll learn how to use algorithmic tools to solve the case. Runtime scours smugglers’ boats with binary...
No Starch Press, 2023. — 307 p. — ISBN-13: 978-1-7185-0260-4. Learn how and when to use the right data structures in any situation, strengthening your computational thinking, problem-solving, and programming skills in the process. This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures — a critical...
Springer, 2022. — 134 p. — (SpringerBriefs in Computer Science). The feedback arc set problem is a one of the quintessential problems of algorithmics and, more generally, of Computer Science. The main aim of the book is to give a review of all relevant information regarding a well-known and important problem of Feedback Arc Set (FAS). This review naturally also includes a...
Leanpub, 2021-07-02. — 227 p. — ISBN: 978-0985731205. There are many excellent books on Algorithms — why in the world we would write another one? Because we feel that while these books excel in introducing algorithmic ideas, they have not yet succeeded in teaching you how to implement algorithms, the crucial computer science skill. Our goal is to develop an Intelligent Tutoring...
Boca Raton: CRC Press, 2021. — 322 p. This book covers theory and practical knowledge of Probabilistic data structures (PDS) and Blockchain (BC) concepts. It introduces the applicability of PDS in BC to technology practitioners and explains each PDS through code snippets and illustrative examples. Further, it provides references for the applications of PDS to BC along with...
Arcler Press, 2021. — 276 p. — ISBN 978-1-77407-748-1. The book defines complexity as a numerical function T (n)-the relationship between time and input size n, as one of the basic ideas of computer science. The computational complexity is categorized by algorithm based on its nature and function. The (computational) complexity of the algorithm is a measurement of the ratio of...
Manning Publications, 2024. — 282 p. Don't be perplexed by data structures! This fun, friendly, and fully illustrated guide makes it easy to learn useful data structures you'll put to work every day. Grokking Data Structures makes it a breeze to learn the most useful day-to-day data structures. You'll follow a steady learning path from absolute basics to advanced concepts, all...
Manning Publications, 2021. — 769 p. — ISBN 978-1617295485. Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. As a software engineer, you’ll encounter countless programming challenges that initially seem confusing, difficult, or even impossible. Don’t despair!...
Sams, 1999. — 523 р. — (Sams Teach Yourself...in 24 Hours). — ISBN: 978-0672316333. This book is about data structures and algorithms as used in computer programming. Data structures are ways in which data is arranged in your computer’s memory (or stored on disk). Algorithms are the procedures a software program uses to manipulate the data in these structures. Almost every...
Springer, 2003. — 301. Our work is intended to be a reference book for researchers and practitioners interested in gaining in-depth understanding of scatter search with the goal of expanding this methodology or applying it to solving difficult practical problems. The book could also be used to complement other materials in a graduate seminar on metaheuristic optimization. We...
Ronald Lane. 2022. — 777 p. A pleasant intro to one of the most valuable formulas written in basic, user-friendly English. The modified as well as updated 2nd edition of Vital Formulas, offers an available intro to computer algorithms. The book includes a summary of essential timeless formulas as well as describes when each is appropriate. The writer shows how to evaluate...
Independently published, 2020. - 126 p. What's new in version 2.0? Teaching, like software development and learning is about refinement. In this new version there are two key changes . Firstly , challenges now directly follow each relevant skill. This reflects the structure of most mathematics textbooks and workbooks. It means there’s less time and effort spent flicking...
Chapman & Hall/CRC, 2004. — 1157 p. Scheduling is a form of decision-making that plays an important role in many disciplines. It is concerned with the allocation of scarce resources to activities with the objective of optimizing one or more performance measures. Depending on the situation, resources and activities can take on many different forms. Resources may be nurses in a...
I-Tech, 2007. — 445. Scheduling theory is concerned with the optimal allocation of scarce resources (for instance, machines, processors, robots, operators, etc.) to activities over time, with the objective of optimizing one or several performance measures. The study of scheduling started about fifty years ago, being initiated by seminal papers by Johnson (1954) and Bellman...
HarperCollins, 1991. – 524 p. – ISBN: 0-673-39736-X. Using only practically useful techniques, this book teaches methods for organizing, reorganizing, exploring, and retrieving data in digital computers, and the mathematical analysis of those techniques. The authors present analyses that are relatively brief and non-technical but illuminate the important performance...
2nd ed. — CRC, 2016. — 662 p. — ISBN: 978-1-4987-3216-1. Praise for the first edition: "The well-written, comprehensive book [is] aiming to become a de facto reference for the language and its features and capabilities. The pace is appropriate for beginners; programming concepts are introduced progressively through a range of examples and then used as tools for building...
Springer Science+Business Media, 2014. — 161 p. — (SpringerBriefs in Mathematics) — ISBN: 1493907476. The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent...
MIT Press, 2020. — 314 p. — (Essential Knowledge). — ISBN: 978-0262539029. An accessible introduction to algorithms, explaining not just what they are but how they work, with examples from a wide range of application areas.Digital technology runs on algorithms, sets of instructions that describe how to do something efficiently. Application areas range from search engines to...
Cambridge (Mass.): The MIT Press, 2017. — 526 p. — ISBN: 9780262035705. An introduction to algorithms for readers with no background in advanced mathematics or computer science, emphasizing examples and real-world problems. Algorithms are what we do in order not to have to do something. Algorithms consist of instructions to carry out tasks―usually dull, repetitive ones....
Springer, 2021. — 687 p. — ISBN 978-3-030-83507-1. This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research...
NOWPress, 2006. — 78 p. — (Foundations and Trends in Theoretical Computer Science). This article gives several applications of the following paradigm, which has proven extremely powerful in algorithm design and computational complexity. First, design a probabilistic algorithm for a given problem. Then, show that the correctness analysis of the algorithm remains valid even when...
Princeton: Princeton University Press, 2013. — 231 p. — ISBN: 9780691158198. Every day, we use our computers to perform remarkable feats. A simple web search picks out a handful of relevant needles from the world's biggest haystack: the billions of pages on the World Wide Web. Uploading a photo to Facebook transmits millions of pieces of information over numerous error-prone...
Princeton: Princeton University Press, 2020. — 232 p. — ISBN: 978-0-691-14714-7. Nine revolutionary algorithms that power our computers and smartphones Every day, we use our computers to perform remarkable feats. A simple web search picks out a handful of relevant needles from the world’s biggest haystack. Uploading a photo to Facebook transmits millions of pieces of...
Apress, 2020. — 298 p. — ISBN: 148425919X. Implement practical data structures and algorithms for text search and discover how it is used inside other larger applications. This unique in-depth guide explains string algorithms using the C programming language. String Algorithms in C teaches you the following algorithms and how to use them: classical exact search algorithms;...
New York: Apress, 2021. — 661 p. — 978-1-4842-7076-9. Learning how to program can be very rewarding. It is a special feeling to seeing a computer translate your thoughts into actions and see it solve your problems for you. To get to that point, however, you must learn to think about computations in a new way?you must learn computational thinking.
CRC Press, 2022. — 177 p. — ISBN 978- 1- 032- 10238- 2. In our increasingly digital world, coding is an essential skill. Communicating an algorithm to a machine to perform a set of tasks is vital. Beginner’s Guide to Code Algorithms: Experiments to Enhance Productivity and Solve Problems written by Deepankar Maitra teaches you how to think like a programmer. The author unravels...
Mercury Learning and Information, 2020. — 447 p. — ISBN 978-1-68392-464-7. Data structures provide a means to managing large amounts of information such as large databases, usingSEO effectively, and creating Internet/Web indexing services. This book isdesigned to present fundamentals of data structures for beginners using the Javaprogramming language in a friendly,...
Cambridge University Press, 2011. — 250 p. — ISBN: 9780511794292, 9781107005570
Need to get up to speed quickly on the latest advances in high performance data converters? Want help choosing the best architecture for your application? With everything you need to know about the key new converter architectures, this guide is for you. It presents basic principles, circuit and...
Second edition. — Springer, 2019. — 280 p. — ISBN: 978-3-319-89620-5. This book is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to...
Springer, 2012. — 260. Data Approximation by Low-complexity Models details the theory, algorithms, and applications of structured low-rank approximation. Efficient local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. Much of the text is devoted to describing the applications of the theory...
Manning Publications, 2009. — 368 p. — ISBN-10: 1933988665, ISBN-13: 978-1933988665. The book covers five important categories of algorithms: search, recommendations, groupings, classification, and the combination of classifiers. What's inside How to create recommendations just like those on Netflix and Amazon. How to implement Google's Pagerank algorithm. How to discover...
Routledge, 2024. — 193 p. — ISBN 978-1-032-29061-4. Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms. It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical...
New York: Jones & Bartlett Learning, 2008. — 670 p. With an accessible writing style and manageable amount of content, Data Structures and Algorithms Using Java is the ideal text for your course. This outstanding text correlates to the recommended syllabus put forth by the Association of Computing Machinery standard curriculum guidelines. The author has produced a resource that is...
O’Reilly Media, Inc. – 2012, 264 pages ISBN: 1449321887, 9781449321888 What is bad data? Some people consider it a technical phenomenon, like missing values or malformed records, but bad data includes a lot more. In this handbook, data expert Q. Ethan McCallum has gathered 19 colleagues from every corner of the data arena to reveal how they’ve recovered from nasty data...
2nd edition. — Jones & Bartlett Publishers, 2009. — xviii, 452 p. — ISBN 0-7637-0782-1, 978-0-7637-0782-8. Updated to follow the recommendations put forth by the ACM/SIGCSE 2001 task force, Analysis of Algorithms raises awareness of the effects that algorithms have on the efficiency of a program and develops the necessary skills to analyze general algorithms used in programs....
Cambridge University Press – 2012, 272 pages
ISBN: 1107001730, 9781107001732
Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations, and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure?...
CRC Press, 2024. — 294 p. — ISBN 978-0-367-63479-7. Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it...
Springer, 1984. — 917. The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3:...
Springer-Verlag, Berlin, Heidelberg, 2008. — 305. — ISBN: 3642096824 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, frequently used algorithms, and generic techniques for...
Chapman and Hall/CRC, 2018. — 1120 p. The Handbook of Data Structures and Applications was first published over a decade ago. This second edition aims to update the first by focusing on areas of research in data structures that have seen significant progress. While the discipline of data structures has not matured as rapidly as other areas of computer science, the book aims to...
PHI Learning Private Limited, 2023. — 473 p. — ISBN-978-93-91818-86-9. The book is self-contained and includes the desired mathematical background. The book covers most of the data structures and classical graphs algorithms, string algorithms, matroid algorithms, linear algebra algorithms, flow and circulation algorithms, linear programming solvers, and integer algorithms. It...
CRC Press, 2014. — 259 p. — EISBN: 9781498726528 Digital Humanitarians examines how new uses of technology and vast quantities of digital data are transforming the way societies prepare for, respond to, cope with, and ultimately understand humanitarian disasters. There was a time when humanitarian response was the purview of an elite, hardened set of type A personalities...
Springer International Publishing, 2016. — 397 p. — ISBN: 978-3-319-41706-6. In celebration of Prof. Morik's 60th birthday, this Festschrift covers research areas that Prof. Morik worked in and presents various researchers with whom she collaborated. The 23 refereed articles in this Festschrift volume provide challenges and solutions from theoreticians and practitioners on data...
Springer, 1998. - 387 pages. 3rd Edition. ISBN 3540606769, 9783540606765
Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling...
Cengage Learning, 2012. – 448 p. – 3rd ed. – ISBN: 1133366805, 9781133366805 Equip yourself for success with a state-of-the-art approach to algorithms available only in Miller/Boxer's Algorithms Sequential & Parallel: A Unified Approach, 3E. This unique and functional text gives you an introduction to algorithms and paradigms for modern computing systems, integrating the study...
Academic Press/Elsevier, 2023. — 468 р. — ISBN 978-0-323-91781-0. Comprehensive Metaheuristics: Algorithms and Applications presents the foundational underpinnings of metaheuristics and a broad scope of algorithms and real-world applications across a variety of research fields. The book starts with fundamentals, mathematical prerequisites, and conceptual approaches to provide...
CRC Press, 2023. — 327 p. — ISBN: 978-0-367-75049-7. This comprehensive reference text discusses nature inspired algorithms and their applications. It presents the methodology to write new algorithms with the help of MatLAB programs and instructions for better understanding of concepts. It covers well-known algorithms including evolutionary algorithms, genetic algorithm,...
A Bradford Book The MIT Press
Cambridge, Massachusetts London, England
Fifth printing, 1999. - 158 c.
Genetic Algorithms: An Overview
Genetic Algorithms in Problem Solving
Genetic Algorithms in Scientific Models
Theoretical Foundations of Genetic Algorithms
Conclusions and Future Directions
AMACOM American Management Association, 2001.
ISBN: 0-8144-0588-6.
Язык: Английский.
Turn to this book to learn to manage mountains of data through distributed data warehousing techniques.
Springer, 2002. — 275 p. — ISBN: 1461353122, 9781461353126 Compression and Coding Algorithms describes in detail the coding mechanisms that are available for use in data compression systems. The well known Huffman coding technique is one mechanism, but there have been many others developed over the past few decades, and this book describes, explains and assesses them. People...
Springer, 2015. — 184 p. — (Studies in Big Data). — ISBN: 8132224930, 9788132224938
This book is a collection of chapters written by experts on various aspects of big data. The book aims to explain what big data is and how it is stored and used. The book starts from the fundamentals and builds up from there. It is intended to serve as a review of the state-of-the-practice in...
Apress, 2013. — 310 p. — ISBN: 1430248726, 9781430248729 Big Data Imperatives, focuses on resolving the key questions on everyone’s mind: Which data matters? Do you have enough data volume to justify the usage? How you want to process this amount of data? How long do you really need to keep it active for your analysis, marketing, and BI applications? Big data is emerging from...
CRC Press, 2022. — 319 p. — ISBN 978-0-367-55526-9. The Art of Algorithm Design is a complementary perception of all books on algorithm design and is a roadmap for all levels of learners as well as professionals dealing with algorithmic problems. Further, the book provides a comprehensive introduction to algorithms and covers them in considerable depth, yet makes their design...
Springer, 1992. — 397. The German Science Foundation (Deutsche Forschungsgemeinschaft, DFG) started a special joint intiative (Schwerpunktprogramm) entitled "Datenstrukturen und effiziente Algorithmen" in 1986. The aim of the initiative was to encourage collaborative research on algorithms, a central concept in computer science. For a period of five years about a dozen projects...
IGI Global, 2012. — 354 p.
In a global and highly-competitive world, organizations face an increasingly difficult environment, with increasing economic pressure and customer demands for more complex products and services that are inexpensive and that can be provided at short notice. In relation to this, hybrid algorithms could play an important role in helping organizations...
AU Press, 2013. — 344 p. — ISBN: 1927356385, 9781927356388 Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast,...
New Edition. — Amazon Digital Services LLC, — 359 р. — ASIN B07MRB762Z. Introduction to Data Structures and Algorithms in Java, 2019 Edition is designed to be easy to read and understand although the topic itself is complicated. Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a...
2nd Edition. — John Wiley & Sons, 2022. — 451 p. — (For Dummies). Your secret weapon to understanding―and using!―one of the most powerful influences in the world today. From your Facebook News Feed to your most recent insurance premiums―even making toast!―algorithms play a role in virtually everything that happens in modern society and in your personal life. And while they can...
John Wiley & Sons, Inc., 2017. — 430 p. — (For Dummies). — ISBN: 9781119330493. Discover how algorithms shape and impact our digital world. All data, big or small, starts with algorithms. Algorithms are mathematical equations that determine what we see—based on our likes, dislikes, queries, views, interests, relationships, and more—online. They are, in a sense, the electronic...
Springer, 2010. — 526 p. The systematic development of efficient algorithms has become a key technology for all kinds of ambitious and innovative computer applications. With major parts of algorithmic theory and algorithmic practice developing in different directions since the 1970s a group of leading researchers in the field started about 15 years ago to coin the new paradigm...
NOWPress, 2008. — 120 p. — (Foundations and Trends in Theoretical Computer Science). In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. In the past few years, a new theory has...
O’Reilly Media, 2013. — 169 p. — ISBN: 1449358721, 9781449358723 There is an easier way to build Hadoop applications. With this hands-on book, you’ll learn how to use Cascading, the open source abstraction framework for Hadoop that lets you easily create and manage powerful enterprise-grade data processing applications—without having to learn the intricacies of MapReduce....
Cambridge University Press, 2016. — 574 p. — ISBN: 978-1-107-15238-0. Compact data structures help represent data in reduced space while allowing it to be queried, navigated, and operated in compressed form. They are essential toolsfor efficiently handling massive amounts of data by exploiting the memory hierarchy. They also reduce the resources needed in distributed...
Издательство Cambridge University Press, 2002, -220 p. String matching problems range from the relatively simple task of search a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information...
E-Papers, no date. — 34 p. This is a collection of algorithms for sorting and searching. Descriptions are brief and intuitive, with just enough theory thrown in to make you nervous. I assume you know a high-level language, such as C, and that you are familiar with programming concepts including arrays and pointers. The first section introduces basic data structures and...
Prentice-Hall, 1993. — 365 p. This book aims to be a challenging introduction to computer science of unconventional coverage and style. Let us explain its prerequisites and aims, so that the reader may judge whether it matches his or her background and goals. This is not a beginner's introduction to programming. We assume that the reader has mastered a high-level programming...
Это - научное исследование компании Numenta.
Детально описывает новые алгоритмы обучения и предсказания состояний, разработанные в компании Numenta в 2010 году. Эти новые алгоритмы описаны здесь достаточно детально, чтобы программисты смогли их полностью понять и, по желанию, самостоятельно имплементировать.
Существует множество вещей, которые люди делают очень легко, а...
Boca Raton: CRC Press, 2005. — 658 p. Featuring contributions from leading experts in the field, Handbook of Bioinspired Algorithms and Applications explores the connection between biologically inspired (or bio-inspired) techniques and the development of solutions to problems that arise in a variety of problem domains. This comprehensive book describes various techniques based on...
Berlin: Springer, 2013. — 169 p. Computing power performance was important at times when hardware was still expensive, because hardware had to be put to the best use. Later on this criterion was no longer critical, since hardware had become inexpensive. Meanwhile, however, people have realized that performance again plays a significant role, because of the major drain on system...
Arcler Press, 2023. — 271 p. This book focuses on the creative elements of algorithmic design by delving into the phases involved in algorithm creation. The conceptual underpinnings of this creative process are analogous to the invention and development of mathematical theorems that result in the induction of combinatorial algorithms. Numerous issue examples are included in the...
Academic Press/Elsevier, 2023. — 460 p. Fast exact triangle counting in large graphs using SIMD acceleration, A comprehensive investigation on attack graphs, Qubit representation of a binary tree and its operations in quantum computation, Modified ML-KNN: Role of similarity measures and nearest neighbor configuration in multi label text classification on big social network...
Academic Press, 2023. — 230 p. The book focuses on both the theory and practice of the most emerging areas for Bloom filter application, including Big Data, Cloud Computing, Internet of Things, and Bioinformatics. Sections provide in-depth insights on structure and variants, focus on its role in computer networking, and discuss applications in various research domains, such as...
Leanpub, 2015. — 162 p.
This book describes the process of analyzing data in simple and general terms. The authors have extensive experience both managing data analysts and conducting their own data analyses, and this book is a distillation of their experience in a format that is applicable to both practitioners and managers in data science.
New York: Springer, 2022. — 314 p. In this book the author presents some techniques for exploring trees and graphs. He illustrates the linear search technique and the backtracking technique, and as instances of tree exploration methods he presents various algorithms for parsing subclasses of context-free languages. He also illustrates some tree and graph exploration and...
MIT Press, 2006. — 240 p. — ISBN: 9780262122870; ISBN: 9780262513357; ISBN: 9780262252645. All organizations today confront data quality problems, both systemic and structural. Neither ad hoc approaches nor fixes at the systems leve—installing the latest software or developing an expensive data warehouse—solve the basic problem of bad data quality practices. Journey to Data...
Arcler Press, 2019. — 252 p. — ISBN: 9781773616179. Introduction to Algorithms considers various aspects of Introduction to Algorithms including an extensive overview of algorithms and related terms. It includes definitions of Classification of algorithms, an introduction to heuristic algorithms, types of machine learning algorithms, approximation algorithms. Provides the...
Marcel Dekker, 2000. — 315 p. The theory of controlled Markov chains originated several years ago in the work of Bellman and other investigators. This theory has seen a tremendous growth in the last decade. In fact, several engineering and theoretical problems can be modelled or rephrased as controlled Markov chains. These problems cover a very wide range of applications in the...
New York: Springer International Publishing, 2019. — 167 p. In this book, differential evolution and its modified variants are applied to the clustering of data and images. Metaheuristics have emerged as potential algorithms for dealing with complex optimization problems, which are otherwise difficult to solve using traditional methods. In this regard, differential evolution is...
John Wiley, 1996. — 367 p. The last few decades have been an exciting time for those of us working in optimisation. The theoretical foundations of complexity have been laid starting with Cook's theorem in the seventies and followed by a plethora of results on NP-Completeness and the definition of yet more complexity classes. Added to this, we have had remarkable progress in...
Facile Publishing, 2024. — 146 p. Unlock the power of algorithms with this accessible and richly illustrated guide. Whether you're a novice eager to learn the fundamentals of computer science or a professional preparing for interviews, this book provides clear explanations and practical examples to help you get an overview of problem-solving techniques. Explore key concepts,...
New York: Soundlikeyourself Publishing, 2017. — 216 p. — ISBN: 978-0-9992829-1-5. Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and database system implementation. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical...
Soundlikeyourself Publishing, LLC, 2018. — 221 p. — ISBN: 0999282921, 9780999282922. Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews....
New York: Soundlikeyourself Publishing, LLC, 2019. — 229 p. Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic...
New York: Soundlikeyourself Publishing, 2020. — 271 p. Fourth book in a series that provides an accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 4 covers algorithmic tools for tackling NP-hard problems (heuristic...
Cambridge University Press, 2021. — 706 p. — ISBN 1108494315, 9781108494311. There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the...
Springer, 2013. — 440 p. — ISBN: 3642362567, 9783642362569 The issue of data quality is as old as data itself. However, the proliferation of diverse, large-scale and often publically available data on the Web has increased the risk of poor data quality and misleading data interpretations. On the other hand, data is now exposed at a much more strategic level e.g. through...
CRC Press, 2025. — 159 p. — (Серия: Advances in Metaheuristics). — ISBN 978-1-032-69979-0. Метаэвристика для анализа корпоративных данных With the emergence of the Data Economy, information has become integral to business excellence. Every enterprise, irrespective of its domain of interest, carries and processes a lot of data in their day-to-day activities. Converting massive...
Springer, 2016. — 111 p. — ISBN: 9783319387758
This book provides readers the “big picture” and a comprehensive survey of the domain of big data processing systems. For the past decade, the Hadoop framework has dominated the world of big data processing, yet recently academia and industry have started to recognize its limitations in several application domains and big data...
Springer, 2010. — 1369 p. — 5th ed. — ISBN: 1848829027, 9781848829022 Data compression is such an important tool in modern computing that some researchers even suggest that all computing is compression! This comprehensive fifth edition of David Salomon’s highly successful reference, Data Compression, now fully reconceived under its new title, Handbook of Data Compression, is...
Morgan Kaufmann, 2006. – 1022 p. – ISBN: 0123694469, 9780123694461 The field of multidimensional data structures is large and growing very quickly. Here, for the first time, is a thorough treatment of multidimensional point data, object and image-based representations, intervals and small rectangles, and high-dimensional datasets. The book includes a thorough introduction; a...
Springer, 2019. — 270 p. — ISBN: 978-3-030-21204-9. With relevant, timely topics, this book gathers carefully selected, peer-reviewed scientific works and offers a glimpse of the state-of-the-art in disaster prevention research, with an emphasis on challenges in Latin America. Topics include studies on surface frost, an extreme meteorological event that occasionally affects...
Springer, 2007. — 254 p. — (Series on Integrated Circuits and Systems). — ISBN 978-0-387-30037-5. With dramatic increases in on-chip packing densities, routing congestion has become a major problem in integrated circuit design, impacting convergence, performance, and yield, and complicating the synthesis of critical interconnects. The problem is especially acute as...
5th Edition. — Morgan Kaufmann, 2018. — 770 p. — ISBN: 978-0-12-809474-7. This book, Fifth Edition, builds on the success of what is widely considered the best introduction and reference text on the art and science of data compression. Data compression techniques and technology are ever-evolving with new applications in image, speech, text, audio and video. This new edition...
Morgan Kaufmann, 2012. — 768 p. — 4th ed. — ISBN: 0124157963, 9780124157965 Each edition of Introduction to Data Compression has widely been considered the best introduction and reference text on the art and science of data compression, and the fourth edition continues in this tradition. Data compression techniques and technology are ever-evolving with new applications in...
Springer, 2008. — 259 p. Introductory Notions Compositionality Random Bag Preservation and Isolated Subsets BasicMOQA Operations Average-CaseTime of BasicMOQA Operations Joint with D. Early TheMOQA Language Examples ofMOQA Programs Average-CaseAnalysis ofMOQA programs Distri-Track Joint with D. Hickey and M. Boubekeur Conclusion and FutureWork
Morgan Kaufmann, 2013. – 404 p. – ISBN: 9780123970336
"The Data Quality Assessment Framework" shows you how to measure and monitor data quality, ensuring quality over time. You'll start with general concepts of measurement and work your way through a detailed framework of more than three dozen measurement types related to five objective dimensions of quality: completeness,...
3rd Edition. — Addison-Wesley Professional, 2002. — 670 p. — ISBN 0-201-36118-3. Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and...
3rd Edition. — Addison-Wesley Professional, 1998. — 752 p. — ISBN 0201350882, 9780201350883. Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the...
New York: Addison-Wesley, 2014. — 437 p. This book is Part II of the fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms , the leading textbook on algorithms today, widely used in colleges and universities worldwide. Part II contains Chapters 4 through 6 of the book. The fourth edition of Algorithms surveys the most important computer algorithms currently in use and...
4th Edition. — Addison-Wesley, 2011. — 969 p. — ISBN: 032157351X. Essential Information about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph...
3rd ed. — Addison-Weasley Professional, 2001. — 550 p. — ISBN: 9780768685329. A complete overview of graph properties and types Diagraphs and DAGs Minimum spanning trees Shortest paths Network flows Diagrams, sample C code, and detailed algorithm descriptions The Web site for this book (http://www.cs.Princeton.edu/~rs/) provides additional source code for programmers along with...
3rd ed. — Addison-Weasley, 1997. — 702 p. — ISBN13: 978-0201314526; ISBN10: 0201314525. Robert Sedgewick has thoroughly rewritten and substantially expanded his popular work to provide current and comprehensive coverage of important algorithms and data structures. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous...
Second International Workshop, ALGOCLOUD 2016. — Aarhus, Denmark, August 22, 2016. Revised Selected Papers. — Springer International Publishing, 2017. — ISBN: 978-3-319-57044-0 ISBN: 978-3-319-57045-7; The International Workshop on Algorithmic Aspects of Cloud Computing (ALGOCLOUD) is an annual event aiming to tackle the diverse new topics in the emerging area of algorithmic...
Cambridge University Press, 2019. — 395 p. — ISBN: 9781108496827. The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient...
O’Reilly Media, Inc., 2024. — 225 p. — ISBN: 978-1-098-15076-1. Data fabric, data lakehouse, and data mesh have recently appeared as viable alternatives to the modern data warehouse. These new architectures have solid benefits, but they're also surrounded by a lot of hyperbole and confusion. This practical book provides a guided tour of each architecture to help data...
Prentice Hall, 2010. – 620 p. – 3rd ed. – ISBN: 0136609112, 9780136609117 This book is intended as a teaching text. I believe it is more important for a practitioner to understand the principles required to select or design the data structure that will best solve some problem than it is to memorize a lot of textbook implementations. Hence, I have designed this as a teaching...
New Delhi: BPB Publications, 2016. — 272 p. Helping readers build efficient C data structures, this handbook explains how to apply data structures to enhance program execution. With a strong emphasis on structured design and programming techniques, it features precise instructions on all the steps involved in data structure development-from theoretical conception to concrete...
Springer – 2009, 272 pages ISBN: 1441917470, 9781441917478 New to the second edition are added chapters on suffix trees, games and strategies, and Huffman coding as well as an appendix illustrating the ease of conversion from Pascal to C. The material covers such topics as combinatorics, sorting, searching, queues, grammar and parsing, selected well-known algorithms, and much...
CRC Press, 2023. — 196 p. Computational complexity is critical in analysis of algorithms and is important to be able to select algorithms for efficiency and solvability. Algorithm and Design Complexity initiates with discussion of algorithm analysis, time-space trade-off, symptotic notations, and so forth. It further includes algorithms that are definite and effective, known as...
Из серии Foundations and Trends in Theoretical Computer Science издательства NOWPress, 2009. — 184 p. A large class of problems in symbolic computation can be expressed as the task of computing some polynomials; and arithmetic circuits form the most standard model for studying the complexity of such computations. This algebraic model of computation attracted a large amount of...
Boca Raton: CRC Press, 2018. — 318 p. This book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc. Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including...
Wiley, 2013. — 384 p. — ISBN: 1118343360, 9781118343364 The confluence of cloud computing, parallelism and advanced machine intelligence approaches has created a world in which the optimum knowledge system will usually be architected from the combination of two or more knowledge-generating systems. There is a need, then, to provide a reusable, broadly-applicable set of design...
Birkhäuser, 1993. — 158 p. This monograph is a slightly revised version of my PhD thesis (86), completed in the Department of Computer Science at the University of Edinburgh in June 1988, with an additional chapter summarising more recent developments. Some of the material has appeared in the form of papers. The underlying theme of the monograph is the study of two classical...
Independently published, 2021. — 266 p. — ASIN B09G2Z7QY1. This book is an introduction to the complex world of the Data Structure & Algorithm. A key factor of this book and its associated implementations is that all algorithms (unless otherwise stated) were designed by me, using the theory of the algorithm in question as a guideline (for which we are eternally grateful to...
New Delhi: BPB Publications,2018. — 193 p. A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer Key Features This book is especially designed for beginners and explains all aspects of algorithm and its analysis in a simple and systematic manner. Algorithms and their working are explained in detail with the help...
Leanpub, 2022. — 405 p. Version: 2022-03-23 Readers will learn discrete mathematical abstracts as well as its implementation in algorithm and data structures shown in various programming languages, such as C, C++, PHP, Java, C#, Python and Dart. This book combines two major components of Mathematics and Computer Science under one roof. Readers will learn discrete mathematical...
3rd Edition. — Springer, 2020. — 800 p. — (Texts in Computer Science). — ISBN: 978-3-030-54256-6. Unique, handy reference package with a practical, hands-on appeal to a wide audience. This classic bestseller has been fully updated, and enhanced with new and expanded material on hashing and randomized algorithms, divide and conquer algorithms, and dealing with hard problems...
Springer International Publishing AG, 2017. — 456 p. — (Texts in Computer Science) — ISBN: 3319554433. The Data Science Design Manual is a source of practical insights that highlights what really matters in analyzing data, and provides an intuitive understanding of how these core concepts can be used. The book does not emphasize any particular programming language or suite of...
2nd edition. — Springer, 2012. — 730 p. — ISBN: 978-1-84800-069-8. This expanded and updated second edition of a classic bestseller continues to take the "mystery" out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm...
Wayne,A-LIST LLC, 2005. — 337 p. These puzzles and mind-benders serve as a way to train logic and help developers, hackers, and system administrators discover unconventional solutions to common IT problems. Users will learn to find bugs in source code, write exploits, and solve nonstandard coding tasks and hacker puzzles. Cryptographic puzzles, puzzles for Linux and Windows...
Madison: Jaxson Media, 2019. — 122 p. Computer Science Fundamentals Asymptotic Runtime Data Structures Classes of problems Graphs and Graph Algorithms Introduction to Graph Theory Data Structures on Graphs Well - Known Graph Algorithms Common Graph Classes Non - Graph Algorithms Sorting Algorithms Problem - Solving Techniques Brute Force or No? Dynamic Programming Greedy...
New York: Addison-Wesley, 1995. — 778 p. Using C, this book develops the concepts and theory of data structures and algorithm analysis step by step, proceeding from concrete examples to abstract principles. The material is unified by the use of recurring themes such as efficiency, recursion, representation and trade-offs. Important software engineering concepts are also covered,...
Mentor Graphics Corporation, 2007. 7 p. На англ. языке. Статья сотрудника фирмы Mentor Graphics об отслеживании требований к функциям и зависимостям в программных продуктах. Приведены графические схемы и диаграммы. Описанные приёмы проверены в течение нескольких лет.
Pfeiffer, 2008. – 190 p. – ISBN: 0787987182, 9780787987183 Data Collection is the second of six books in the Measurement and Evaluation Series from Pfeiffer. The proven ROI Methodology—developed by the ROI Institute—provides a practical system for evaluation planning, data collection, data analysis, and reporting. All six books in the series offer the latest tools, most current...
Издательство World Scientific, 1994. — 252 p. A number of important string-searching algorithms have been collected together and presented in this volume in a uniform format and notation. The topics covered include exact and approximate string-matching, edit-distance related problems, and problems involving repeated patterns. The text is intended for computer scientists,...
John Wiley, 2013. — 759 p. Algorithms are the recipes that make efficient programming possible. They explain how to sort records, search for items, calculate numeric values such as prime factors, find the shortest path between two points in a street network, and determine the maximum flow of information possible through a communications network. The difference between using a...
2nd Edition. — Wiley, 2019. — 800 p. — ISBN: 1119575990. A friendly introduction to the most useful algorithms written in simple, intuitive English The revised and updated second edition of Essential Algorithms, offers an accessible introduction to computer algorithms. The book contains a description of important classical algorithms and explains when each is appropriate. The...
Apress, 2020. — 143 p. — ISBN13: 978-1-4842-5724-1. Codeless Data Structures and Algorithms provides you with the knowledge about DSAs that you will need in the professional programming world, without using any complex mathematics or irrelevant information. Whether you are a new developer seeking a basic understanding of the subject or a decision-maker wanting a grasp of...
Mark Boulton Design Ltd, 2010. – 225 p. – ISBN: 0956174086, 9780956174086
In recent years, the terms Visualization, Infographic and others have been bantered around with almost no regard to their use or meaning. There is a new vernacular emerging in the realms of data representations, but that doesn’t mean we can ignore the much simpler origins and best practices of charts and...
Bentham Science Publishers, 2022. — 217 p. — (Algorithms for Construction of Reality in Physics - Volume 2). — eBook ISBN 978-981-5049-66-4. The book presents a multidisciplinary analysis of the context of quantum physics experiments and the function of the human mind that makes it possible to demonstrate that an object-based model of reality formed at the level of the...
Springer Cham, 2023. — 287 p. — (Graduate Texts in Operations Research). — eBook ISBN 978-3-031-13714-3. This book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed. This problem is ideal for introducing readers to the...
Springer, 2019. — 119 p. — (High-Performance Computing Series, 2). — ISBN: 9811399646. Following an introduction to the basis of the fast Fourier transform (FFT) , this book focuses on the implementation details on FFT for parallel computers. FFT is an efficient implementation of the discrete Fourier transform (DFT) , and is widely used for many applications in engineering,...
Routledge, 2006. — 176 p. — ISBN: 0750667257, 9780750667258
Why does the word design owe its origin to Latin and not Greek roots? Where do the limits of the human mind lie? How does ambiguity enter the deterministic world of computation? Who was Parmenides and why is his philosophy still puzzling today? This unique volume challenges the reader to tackle all these complex...
2nd ed. — New Delhi: Oxford University Press, 2014. — 557 p. — (Oxford Higher Education). — ISBN-13 978-0-19-809930-7, ISBN-10 0-19-809930-4. This second edition of Data Structures Using C has been developed to provide a comprehensive and consistent coverage of both the abstract concepts of data structures as well as the implementation of these concepts using C language. It...
Berlin: Springer, 1984. — 254 p. Instructions and models of algorithm implementation The synthesis of algorithms The formulation of algorithms synthesis in terms of P-functions The synthesis of (or)-interpreted matrix-instructions with disjoint colums The synthesis of (or)-interpreted matrix-instructions The synthesis of (and)-interpreted matrix-instructions A summary and the...
NY: InfoQ, 2021. — 43p. Data architecture is being disrupted, echoing the evolution of software architecture over the past decade. The changes coming to data engineering will look and sound familiar to those who have watched monoliths be broken up into microservices: DevOps to DataOps; API Gateway to Data Gateway; Service Mesh to Data Mesh. While this will have benefits in...
Independently published, 2022. — 122 p. Computers store and process data with an extra ordinary speed and accuracy. So, it is highly essential that the data is stored efficiently and can be accessed fast. Also, the processing of data should happen in the smallest possible time, but without losing the accuracy. Data structures deal with how the data is organized and held in the...
New York: Springer, 2022. — 1511 p. The aim of this handbook is to summarize the recent rapidly developed real-time computing technologies, from theories to applications. This handbook benefits the readers as a full and quick technical reference with a high-level historic review of technology, detailed technical descriptions and the latest practical applications. In general,...
New York: McGraw-Hill, 1984. — 462 p. Preface to the Second Edition. Preface to the First Edition. Information and its Storage Representation. The Representation and Manipulation of Strings. Linear Data Structures and Their Sequential Storage Representation. Linear Data Structures and Their Linked Storage Representation. Nonlinear Data Structures. Sorting and Searching.
Morgan Kaufmann, 2011. — 422 p. — ISBN-10 0123851262, ISBN-13 978-0123851260. First, note that I have used Zen in the title of this book. I have been asked many times why I used such an esoteric term. After all, what is the meaning of Zen? To clarify the meaning of Zen, we must examine the philosophical environment that gave rise to Zen: Indian and Chinese philosophies. In...
Independently published, 2023. — 230 p. Схема алгоритма Гроккинга: Расширенное руководство, которое поможет вам преуспеть в использовании алгоритмов Гроккинга Grokking Algorithms is a book that aims to help readers understand the fundamental concepts of Computer Science algorithms. It covers various algorithms and data structures, including searching, sorting, graph algorithms,...
Independently published, October 30, 2023. — 230 р. Grokking Algorithms is a book that aims to help readers understand the fundamental concepts of Computer Science algorithms. It covers various algorithms and data structures, including searching, sorting, graph algorithms, dynamic programming, and more. The book presents the concepts clearly and concisely, with plenty of...
New York: Springer, 2010. — 308 p.
This volume contains the papers presented at the 8th International Symposium on Experimental Algorithms (SEA 2009). The symposium was held at the Technische Universit¨at Dortmund, Germany, during June 4–6, 2009. The main theme of the SEA series is the role of experimentation and of
algorithm engineering techniques in the design and evaluation...
Springer, 2021 — 392 p. — ISBN : 3030818845. Graph algorithms is a well-established subject in mathematics and computer science. Beyond classical application fields, like approximation, combinatorial optimization, graphics, and operations research, graph algorithms have recently attracted increased attention from computational biology, bioinformatics, and computational...
Atlantis Press, 2013. — 131 p. — ISBN: 9462390320
Data compression is mandatory to manage massive datasets, indexing is fundamental to query them. However, their goals appear as counterposed: the former aims at minimizing data redundancies, whereas the latter augments the dataset with auxiliary information to speed up the query resolution. In this monograph we introduce...
Singapore: World Scientific, 2019. — 534 p. In computer science, an algorithm is an unambiguous specification of how to solve a class of problems. Algorithms can perform calculation, data processing and automated reasoning tasks. As an effective method, an algorithm can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a...
Independently published, 2021. — 475 p. If you want the computer to complete any task, you must write a program. Using this program, you can tell the computer exactly what it needs to do, so you receive the required output. Ensure the steps are defined clearly. The computer will follow these steps and will accomplish the end result. Ensure you choose the right input variables...
Independently published, 2021. — 203 p. re you interested in furthering your knowledge of algorithms ? Do you want to learn how they work for real-world problems ? Then you've come to the right place. This guide will walk you through algorithm design before digging into some of the top design techniques. Algorithms are sequences of steps used to help solve specific problems...
Independently published, 2021. — 179 р. Have you ever wondered how a programmer develops games and writes code without having to think too much? Do you want to know what makes a programmer confident about the code they write? Do you want to learn how programmers use algorithms to determine how to structure their programs before they develop it? If you did, this is the book for...
NOWPress, 2009. — 74 p. — (Foundations and Trends in Theoretical Computer Science). In this monograph we discuss selected topics on small-depth computation, presenting a few unpublished proofs along the way. The four sections contain: A unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over {0,1}. An...
NOWPress, 2008. — 171 p. — (Foundations and Trends in Theoretical Computer Science). Data sets in large applications are often too massive to fit completely inside the computer’s internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. In this manuscript, we...
Technics Publications, 2017. — 62 p. — ISBN10: 1634622561, 13 978-1634622561, ASIN B074R7HL2W. From the author of the bestsellers, Data Scientist and Julia for Data Science, this book covers four foundational areas of data science. The first area is the data science pipeline including methodologies and the data scientist's toolbox. The second are essential practices needed in...
Springer Science & Business Media, 2012. — 356 p. "Geometric Structure of High-Dimensional Data and Dimensionality Reduction" adopts data geometry as a framework to address various methods of dimensionality reduction. In addition to the introduction to well-known linear methods, the book moreover stresses the recently developed nonlinear methods and introduces the applications...
N.-Y.: Kluwer, 2002. — 164 p.
Data Quality provides an exposé of research and practice in the data quality field for technically oriented readers. It is based on the research conducted at the MIT Total Data Quality Management (TDQM) program and work from other leading research institutions.
Addison-Wesley Professional, 2003. — 306 p. These are the timesaving techniques relished by computer hackers--those devoted and persistent code developers who seek elegant and efficient ways to build better software. The truth is that much of the computer programmer's job involves a healthy mix of arithmetic and logic. In "Hacker's Delight," veteran programmer Hank Warren...
Second Edition. — Pearson Education, 2013. — 470 p. — ISBN: 0-321-84268-5. In Hacker’s Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warren’s hacks are...
Morgan Kaufman, 1999. — 252 p. Символы "fi" отображаются как ^ The science of compressing data is the art of creating shorthand representations for the data—that is, automatically finding abbreviations; i.e. yadda yadda yadda, etc. All of the algorithms can be described with a simple phrase: Look for repetition, and replace the repetition with a shorter representation. This...
Springer, 2013. — 53 p. Once upon a time, the most difficult aspect of signal processing was acquiring enough data. Nowadays, one can sample at very high rates and collect huge data sets, but processing the data in a timely manner, without exceeding available memory, is challenging, despite continuing advances in computer technology. Meeting this challenge requires the full...
Pearson Education, Inc., 2013. — 656 p. — ISBN: 013284737X.
На англ. языке.
Data Structures and Algorithm Analysis in C++ is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses.
As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills...
3rd Edition. — Pearson Education, Inc., 2011-11-28. — 648 p. — ISBN-13: 978-0-13-257627-7. Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. This text is for readers who want to learn good programming and algorithm...
The Pragmatic Bookshelf, 2023. - 481 p. - ISBN 9798888650356. If you thought data structures and algorithms were all just theory, you're missing out on what they can do for your Python code. Learn to use Big O notation to make your code run faster by orders of magnitude . Choose from data structures such as hash tables, trees, and graphs to increase your code's efficiency...
2nd Edition. — Pragmatic Bookshelf, 2020. — 499 p. — ISBN: 978-1-68050722-5. If you thought that data structures and algorithms were all just theory, you’re missing out on what they can do for your code. Learn to use Big O Notation to make your code run faster by orders of magnitude. Choose from data structures such as hash tables, trees, and graphs to increase your code’s...
Pragmatic Bookshelf, 2017. — 213 p. — ISBN10: 1680502441, 13 978-1680502442. True PDF Algorithms and data structures are much more than abstract concepts. Mastering them enables you to write code that runs faster and more efficiently, which is particularly important for today's web and mobile apps. This book takes a practical approach to data structures and algorithms, with...
Basel, Switzerland: MDPI, 2018. — 210 p. — ISBN: 978-3-03897-119-1. This edited book presents new results in the area of algorithm development for different types of scheduling problems. In eleven chapters, algorithms for single machine problems, flow-shop and job-shop scheduling problems (including their hybrid (flexible) variants), the resource-constrained project scheduling...
Andy Wickler, 2021. — 231 p. Are you studying data science and want to take your learning further ? Data structures are an integral part of data science, machine learning, and algorithms, all aimed at solving programming challenges that might seem insurmountable at the outset.Advanced Data Structures for Algorithms builds on your current knowledge, taking your learning much...
Packt Publishing, 2017. — 385 p. — ISBN13: 978-1787121041. True PDF If you want to learn different data structures and their real-world applications quickly through practical examples, then Everyday Data Structures is for you. This book can introduce you to new data structures and their potential applications through examples in languages common to mobile software development...
Kluwer, 1991. — 403 p. The class of Markov data compression algorithms provides the best known compression for ordinary symbol data. Of these, the PPM (Prediction by Partial Matching) algorithm by Cleary and Witten (1984) is the most successful. This thesis reviews the class of Markov algorithms and introduces algorithms similar to PPM which are used as a vehicle for examining...
Cambridge University Press, 2011. — 516 p. — ISBN: 0521195276, 9780521195270 Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP,...
Wolfram Media, Inc., 2021. — 356 p. — ISBN 978-1-57955-043-1. Combinators have inspired ideas about computation ever since they were first invented in 1920, and in this innovative book, Stephen Wolfram provides a modern view of combinators and their significance. Informed by his work on the computational universe of possible programs and on computational language design,...
Elsevier, 1983. — 378 p. Statistical Methods and the Improvement of Data Quality contains the proceedings of The Small Conference on the Improvement of the Quality of Data Collected by Data Collection Systems, held on November 11-12, 1982, in Oak Ridge, Tennessee. The conference provided a forum for discussing the use of statistical methods to improve data quality, with...
Springer, Cham, 2014. — 451 p. — ISBN 978-3-319-03404-1. The present book Innovative Computational Intelligence: A Rough Guide to 134 Clever Algorithms is compilation of recent trends in computational intelligence (CI) research using inspiration from various sources such as biology, physics, chemistry, and mathematics. Innovative CI, unlike its counterparts, i.e., highly...
Independently published, 2021. — 208 p. — ASIN : B093DXQRVG. This book is about how to work smart to avoid unnecessary work. Algorithmic thinking is about identifying the most efficient steps to solve a seemingly complex problem without detouring. It is a necessary skill for future jobs. Through a magical lens, CalliLens, you will observe abstraction and recognize patterns in...
Arcler Press, 2019. — 332 p. — ISBN: 978-1-77361-658-2. Data Structures with C Programming examines various concepts related to structuring of data giving brief overview about them. It starts with explanation data structures that are utilized to store data in a computer in an organized form. It includes different types of data structure using C language. Provides the reader...
Michael Young, 2015. — 191 p. The Computer Science handbook is a handbook designed to explain algorithms and data structures in a way that anyone can understand. Many websites (eg Wikipedia) contain lengthy and wordy explanations that are full of technical jargon. We have tried our hardest to simplify all language to make it easy to read without any math or computer science...
Springer, 2002. — 159 p. Many new applications, such as multimedia databases, employ the so-called feature transformation which transforms important features or properties of data objects into high-dimensional points. Searching for ‘similar’ objects based on these features is thus a search of points in this feature space. Another high-dimensional database example is stock price...
New York: Springer, 2015. — 418 p. This Festschrift volume is published in honor of Professor Paul G. Spirakis on the occasion of his 60th birthday. It celebrates his significant contributions to computer science as an eminent, talented, and influential researcher and most visionary thought leader, with a great talent in inspiring and guiding young researchers. The book is a...
AlgoDaily.com. — 732 p. The only technical interview resource you need: your favorite AlgoDaily.com premium content packaged into an 800-page book that you'll love and keep forever. Over 500 illustrations and visualizations; 50 long-form, interactive tutorials and lessons on data structures, algorithms, and interview patterns; and 100 in-depth, illustrated, and well explained...
InTech, 2010. — 224 p. Fault diagnosis technology is a synthetic technology, which relates to several subjects, such as modern control theory, reliability theory, mathematical statistics, fussy set theory, information handling, pattern recognition and artificial intelligence. The United States is the first study to carry out fault diagnosis countries. Since 1961, the United...
2nd. ed. - San Francisco: No Starch Press, 2024. - 473 p. - ISBN 1718503229. Get in the game and learn essential computer algorithms by solving competitive programming problems, in the fully revised second edition of the bestselling original. (Still no math required !). Are you hitting a wall with data structures and algorithms? Whether you’re a student prepping for coding...
No Starch Press, Inc., 2021. — 410 p. — ISBN13: 978-1-7185-0080-8. A hands-on, problem-based introduction to building algorithms and data structures to solve problems with a computer. Programming is about using a computer to solve problems, and algorithms and data structures are the building blocks of computer programs. For each problem that a programmer wants to solve, they...
Москва: Наука, 1975. — 119 с. Задача о максимальном потоке. Комбинаторные потоковые задачи. Многополюсные и многопродуктивное задачи. Задачи на минимизацию стоимости порока.
СПб.: Питер, 2024. — 256 с., ил. — (Серия "библиотека программиста") — ISBN 978-5-4461-4076-3. Погрузитесь в мир алгоритмов! Разберитесь в их принципах, особенностях проектирования и практического применения. Вы познакомитесь с различными видами алгоритмов, узнаете их сильные и слабые стороны и поймете, в каких контекстах они лучше всего работают. На практических примерах...
Пер. с англ. Д. Брайт. — СПб.: Питер, 2023. — 736 с.: ил. — (Для профессионалов). — ISBN:978-5-4461-1982-0. В проектах обработки и анализа данных много движущихся частей, и требуются практика и знания, чтобы создать гармоничную комбинацию кода, алгоритмов, наборов данных, форматов и визуальных представлений. Эта уникальная книга содержит описание пяти практических проектов,...
Алматы: Қазақ университеті, 2014. — 210 б. Оқу құралы Teaching competency and infrastructure for e-Learning and retraining (CANDI), 158918-TEMPUS-1-2009-AT-JPCR атты TEMPUS еуропалық грант бағдарламасы аясында құрастырылған. Осы грант бойынша жұмысқа Вена университетінің және Вена техникалық университетінің (Австрия), Ұлыбритания ашық университетінің (Ұлыбритания), Мюнхен...
Диалектика, 2019. — 402 c. В этой книге описаны структуры данных и алгоритмы, которые являются фундаментом современного компьютерного программирования. Основу данной книги составляют первые шесть глав нашей ранее изданной книги The Design and Analysis of Computer Algorithms. Мы расширили ее содержание, включив материал по алгоритмам внешнего хранения и управлению памятью. Как и...
М.: Вильямс, 2000. — 384 с. — ISBN: 5-8459-0122-7. В этой книге подробно рассмотрены структуры данных и алгоритмы, которые являются фундаментом современной методологии разработки программ. Показаны разнообразные реализации абстрактных типов данных, начиная от стандартных списков, стеков, очередей и заканчивая множествами и отображениями, которые используются для неформального...
Пер. с англ. : Учебное пособие — М. : Вильямс, 2000. — 384 с. : ил. В этой книге подробно рассмотрены структуры данных и алгоритмы, которые являются фундаментом современной методологии разработки программ. Показаны разнообразные реализации абстрактных типов данных, начиная от стандартных списков, стеков, очередей и заканчивая множествами и отображениями, которые используются...
Для систем автоматизированного проектирования технологии изготовления сварных конструкций предложен новый подход к решению задачи построения технологического маршрута изготовления изделия. Решение основано на применении бинарных отношений между технологическими операциями, матричном и графовом представлении отношений. Приведены примеры применения разработанного алгоритма для...
М.: Радио и связь, 1990. — 224 с. — ISBN: 5-256-00704-1. Наряду с конкретными примерами даны общие рекомендации по составлению оптимальных алгоритмов и программ. Рассмотрение построено по следующему принципу; постановка задачи, пример традиционного решения и объяснение его недостатков, углубленный анализ задачи н найденное в результате этого лучшее решение, изложение ряда...
2-е изд. — Пер. с англ. Д. Солнышков. — СПб.: Питер, 2002. — 272 с: ил. — (Библиотека программиста). — ISBN 978-5-318-00715-5. Эта книга написана для программистов. Хороший программист должен знать все, что написано до него, только тогда он будет писать хорошие программы, главы этой книги посвящены наиболее привлекательному аспекту профессии программиста: жемчужинам...
М.: ДМК Пресс, 2023. — 426 с.: ил. — ISBN 978-5-97060-873-9. В книге приводится всесторонний анализ идей и деталей реализации структур данных как важнейшей составляющей прикладных алгоритмов. Обсуждаются не только эффективные способы реализации операций над множествами чисел, интервалов или строк, представленных в виде различных поисковых структур данных – деревьев, множеств...
2-е изд. — СПб.: Питер, 2024. — 352 с. — (Библиотека программиста). — ISBN 978-5-4461-4172-2. Алгоритмы — это пошаговые инструкции решения задач, большинство из которых уже были кем-то решены, протестированы и доказали свою эффективность. Второе издание «Грокаем алгоритмы» упрощает изучение, понимание и использование алгоритмов. В этой книге вы найдете простые и внятные...
СПб.: Питер, 2022. — 288 с. — (Библиотека программиста). — ISBN 978-5-4461-0923-4. Алгоритмы - это всего лишь пошаговые алгоритмы решения задач, и большинство таких задач уже были кем-то решены, протестированы и проверены. Можно, конечно, погрузится в глубокую философию гениального Кнута, изучить многостраничные фолианты с доказательствами и обоснованиями, но хотите ли вы...
СПб.: Питер, 2017. — 288 с. — (Библиотека программиста). — ISBN: 978-5-496-02541-6. Алгоритмы - это всего лишь пошаговые алгоритмы решения задач, и большинство таких задач уже были кем-то решены, протестированы и проверены. Можно, конечно, погрузится в глубокую философию гениального Кнута, изучить многостраничные фолианты с доказательствами и обоснованиями, но хотите ли вы...
Пер. с англ. Е. Матвеев. — СПб.: Питер, 2022. — 288 с.: ил. — (Библиотека программиста). — ISBN 978-5-4461-0923-4. Алгоритмы — это всего лишь пошаговые алгоритмы решения задач, и большинство таких задач уже были кем-то решены, протестированы и проверены. Можно, конечно, погрузится в глубокую философию гениального Кнута, изучить многостраничные фолианты с доказательствами и...
Красноярск: СФУ, 2011. — 180 с. — Библиогр.: с. 166-176. — ISBN: 978-5-7638-2488-9. Книга посвящена анализу параметризированных алгоритмов – современному на-правлению теории сложности вычислений. Параметризированные алгоритмы направлены на поиск точных решений NP-полных задач, когда параметр решаемой задачи мал по сравнению с длиной входа алгоритма. Роль этого параметра –...
Выходные данные отсутствуют. В архиве подробно разобранные алгоритмы реализации быстрого преобразования Фурье, и дискретного преобразования Хартли, к объяснению прилагается исходный код на C++ с объяснениями. Примечание. Преобразование Хартли — это ещё один способ анализа заданной функции посредством синусоид. Отличие между ним и преобразованием Фурье довольно простое. В то...
2-е изд. — Пер. с англ. С. Черников. — СПб.: Питер, 2024. — 512 с.: ил. — (Библиотека программиста). — ISBN: 978-5-4461-2068-0. Структуры данных и алгоритмы — это не абстрактные концепции, а турбина, способная превратить ваш софт в болид формулы 1. Научитесь использовать нотацию «О большое», выбирайте наиболее подходящие структуры данных, такие как хеш-таблицы, деревья и графы,...
М.: Мир, 1985, 406 c., ил. Серия "Математическое обеспечение ЭВМ". Перевод с английского Л.Ю. Иоффе под редакцией Д.Б. Подшивалова Монография известного швейцарского специалиста по системному программированию, знакомого советским читателям по переводу его книги «Систематическое программирование. Введение» (М.: Мир. 1977). Она содержит описание и анализ основных алгоритмов,...
М.: Мир, 1985. — 361 с. Книга известного швейцарского специалиста посвящена изложению фундаментальных принципов построения эффективных и надежных программ. В ней содержится также описание и анализ основных алгоритмов. Изложение ведется с использованием языка Модула-2, что, однако, не снижает ценность излагаемого материала для пользователей других языков программирования.
М.: Мир, 1985. — 406 c., ил. — (Серия "Математическое обеспечение ЭВМ"). Перевод с английского Л.Ю. Иоффе под редакцией Д.Б. Подшивалова. Монография известного швейцарского специалиста по системному программированию, знакомого советским читателям по переводу его книги «Систематическое программирование. Введение» (М.: Мир. 1977). Она содержит описание и анализ основных...
М.: Финансы и статистика; Инфра-М, 2009. — 304 с. — ISBN: 978-5-279-03351-5; ISBN: 978-5-16-003682-3. Приведены основные понятия алгоритмизации, свойства алгоритмов, общие принципы их построения, основные алгоритмические конструкции, представлена эволюция языков программирования. Рассмотрен широкий круг методов обработки линейных и нелинейных структур данных. Описана технология...
2-е изд. стер. — Санкт-Петербург: Лань, 2021. — 356 с.— ISBN 9785811479658. Книга посвящена описанию структур и алгоритмов для индексирования и обработки многомерных данных. В ней систематизированы наиболее важные подходы, описаны их математические и логические принципы построения, проанализированы достоинства и недостатки. Содержится большое число примеров листинга,...
Пер. с англ. — М.: Эксмо, 2015. — 400 с. — ISBN: 978-5-699-85806-4. Большие данные — один из важнейших технологических трендов, который кардинально меняет возможности использования информации в бизнесе. Многим понятие Big Data пока в новинку, поэтому, прежде чем с ним работать, необходимо уяснить суть как технических, так и бизнес-требований к применению этих технологий. Вы...
В данной книге представлена реализация длинной целочисленной арифметики на языке C++, приведено теоретическое обоснование алгоритмов для основных арифметических операций. Взято с сайта algolist.manual.ru
Пер. с англ. Д. Брайт. — СПб.: Питер, 2023. — 432 с.: ил. — (Библиотека программиста). — ISBN: 978-5-4461-1853-3. «Алгоритмы на практике» научат решать самые трудные и интересные программистские задачи, а также разрабатывать собственные алгоритмы. В качестве примеров для обучения взяты реальные задания с международных соревнований по программированию. Вы узнаете, как...
4-е изд. — М. : Лаборатория знаний, 2020. — 226 с. — ISBN: 978-5-00101-789-9. Эта книга для тех, кто хочет научиться программировать. В ней представлена методика решения типовых задач программирования, не привязанная к конкретному языку. Разъяснения по методике решения задач и программы приведены на школьном алгоритмическом языке. Русский синтаксис делает программы понятными и...
М. : БИНОМ. Лаборатория знаний, 2012.— 223 с.
Это ознакомительный фрагмент 23стр., (полный вариант имеет 223 страницы).
Эта книга для тех, кто хочет научиться программировать. В ней представлена методика решения типовых задач программирования, не привязанная к конкретному языку. Разъяснения по методике решения задач и программы приведены на школьном алгоритмическом языке....
М.: Филинъ, 1999. — 256 с. — ISBN: 5-89568-135-2. В книге рассматриваются распространенные структуры данных и оригинальные композиции для сортировки и решения графовых задач. Более 90 примеров и ответов к заданиям иллюстрируют методы и технологию программирования. В книгу включены наиболее быстродействующие алгоритмы, минимальные по затратам памяти и дискового пространства. Для...
СПб.: БХВ-Петербург, 2003. — 1104 c. — ISBN: 5-94157-184-4. Книга содержит изложение фундаментальных основ современных компьютерных технологий, связанных с применением теории графов. Приведены основные модели, методы и алгоритмы прикладной теории графов. Рассмотрены задачи рисования графов и визуальной обработки графовых моделей. Описаны области приложения, такие как хранение и...
В 4-х томах. Пер. с англ. — 3-е изд. — М.: Вильямс, 2006. — 682 с.
Первый том посвящен основам понятий и методов программирования. Для последующего описания алгоритмов автором вводится гипотетический компьютер MIX с языком ассемблера MIXAL. В книге рассматриваются представлениие информации внутри компьютера, структурные связи между элементами данных и способах эффективной...
В 4-х томах. Пер. с англ. — 3-е изд. — М.: Вильямс, 2007. — 788 с. Во втором томе дано полное введение в теорию получисленных алгоритмов, причем случайным числам и арифметике посвящены отдельные главы. Путем рассмотрения основ теории получисленных алгоритмов и примеров этих алгоритмов установлена связь между компьютерным программированием и численным анализом. Особого...
В 4-х томах. Пер. с англ. — 2-е изд. — М.: Вильямс, 2007. — 824 с. — ISBN 978-5-8459-0082-1.
Во втором издании третьего тома содержится полный обзор классических алгоритмов сортировки и поиска. Представленная в нем информация дополняет приведенное в первом томе обсуждение структур данных. Автор рассматривает принципы построения больших и малых баз данных, а также внутренней и...
Пер. с англ. — М.: Вильямс, 2013. — 960 с.: ил. — ISBN: 978-5-8459-1744-7. OCR Эта книга представляет собой том 4А, поскольку сам том 4 является многотомником. Комбинаторный поиск — богатая и важная тема, и Кнут приводит слишком много нового, интересного и полезного материала, чтобы его можно было разместить в одном или двух (а может быть, даже в трех) томах. Одна эта книга...
3-е изд., испр. и доп. — Учебное пособие. — Перевод с английского С.Г. Тригуб, Ю.И. Гордиенко, И.В. Красиков. — М.: Вильямс, 2018. — 720 с.: ил. — ISBN 978-5-8459-1987-8, 978-5-8459-1984-7. Первый том серии книг «Искусство программирования» начинается с описания основных понятий и методов программирования. Затем автор сосредоточивается на рассмотрении информационных структур -...
3-е изд., испр. и доп. — Учебное пособие. — Перевод с английского. — М.: Вильямс, 2018. — 832 с.: ил. — ISBN 978-5-8459-0081-4. В третьем издании второго тома представлено полное введение в теорию получисленных алгоритмов, причем случайным числам и арифметике посвящены отдельные главы. В книге даны основы теории полу численных алгоритмов, а также примеры этих алгоритмов. Тем...
2-е изд., испр. и доп. — Учебное пособие. — Перевод с английского. — М.: Вильямс, 2018. — 832 с.: ил. — ISBN 978-5-8459-0082-1. Во втором издании третьего тома содержится полный обзор классических алгоритмов сортировки и поиска. Представленная в нем информация дополняет приведенное в первом томе обсуждение структур данных. Автор рассматривает принципы построения больших и малых...
Новое издание. — Учебное пособие. — Перевод с английского. — М.: Вильямс, 2018. — 960 с.: ил. — ISBN 978-5-8459-1980-9. Эта книга представляет собой том 4А, поскольку сам том 4 является многотомником. Комбинаторный поиск — богатая и важная тема, и Кнут приводит слишком много нового, интересного и полезного материала, чтобы его можно было разместить в одном или двух (а может...
Пер. с англ. — М.: Вильямс, 2007. — 160 с.: ил. ISBN: 978-5-8459-1163-6. Эта книга представляет собой один из выпусков очередных томов всемирно известного труда Искусство программирования, не нуждающейся ни в представлении, ни в рекламе. В данный выпуск вошли разделы первого тома, посвященные RISC- компьютеру MMIX, который заменит прежний компьютер MIX, и языка ассемблера MMIX....
Пер. с англ. — М.: Вильямс, 2008. — 160 с.: ил. ISBN: 978-5-8459-1164-3. Этот выпуск представляет собой продолжение главы о комбинаторных алгоритмах, которая будет включена в четвертый том Искусство программирования. Поскольку часть этого тома составит большая глава о комбинаторном поиске, то этот выпуск начинается с рассмотрения генерации всех возможных объектов. Особое...
Пер. с англ. — М.: Вильямс, 2007. — 208 с.: ил. ISBN: 978-5-8459-1132-2. Эта книга представляет собой один из выпусков очередных томов всемирно известной работы Искусство программирования, не нуждающейся ни в представлении, ни в рекламе. В данный выпуск вошли разделы четвертного тома, посвященные вопросам генерации всех сочетаний и разбиений. Материалы выпуска в будущем войдут...
Пер. с англ. — М.: Вильямс, 2007. — 160 с.: ил. ISBN: 978-5-8459-1158-2. Эта книга представляет собой один из выпусков очередных томов всемирно известной работы Искусство программирования, не нуждающейся ни в представлении, ни в рекламе. В данный выпуск вошли разделы четвертого тома, посвященные вопросам генерации всех деревьев, а также обзор истории генерации различных...
Пер. с англ. — 2-е изд. —М. : Лаборатория знаний, 2017. — 114 с. — ISBN: 978-5-00101-462-1 Захватывающая приключенческо-математическая история от известного и блестящего автора Дональда Кнута. Двое героев случайнонаходят камень с древними письменами и открывают для себя новые математические структуры. Для студентов, преподавателей и всех любителей математики
Энгельс 16.08.2011. Преобразование Фурье имеет огромное значение для различных математических приложений и широко применяется в науке и технике. Очень часто приходится иметь дело с дискретным набором данных f(xi), вследствие чего был разработан так называемый спектральный анализ при помощи дискретного преобразования Фурье (ДПФ). Но в большинстве случаев скорость расчета ДПФ,...
М.: ИД «ФОРУМ»: Инфра-М, 2006. - 416 с. Рассмотрен широкий круг алгоритмов обработки линейных и нелинейных структур данных. Приведены основные понятия алгоритмизации, свойств алгоритмов, общие принципы построения алгоритмов, основные алгоритмические конструкции. Рассмотрены эволюция языков программирования, технология работы и фрагменты программ, а также основные принципы...
М.: Вильямс, 2014. — 208 c. — ISBN: 9785845918680. Эта книга написана признанным авторитетом в области компьютерных алгоритмов - профессором информатики Томасом Корменом, чей труд "Алгоритмы: построение и анализ", написанный в соавторстве с такими выдающимися учеными, как Чарльз Лейзерсон, Рональд Ривест и Клиффорд Штайн, выдержав три издания, давно стал общепризнанным...
2-е издание. Пер. с англ. — М.: Вильямс, 2005. — 1296 с.: илл. Фундаментальный труд известных специалистов в области кибернетики достоин занять место на полке любого человека, чья деятельность так или иначе связана с информатикой и алгоритмами. Для профессионала эта книга может служить настольным справочником, для преподавателя — пособием для подготовки к лекциям и источником...
М.: Ай Пи Эр Медиа, 2023. — 111 с. — ISBN 978-5-4497-1855-6. В учебном пособии излагаются некоторые аспекты вычислительной сложности при работе с целыми числами и графами, а также описаны основные понятия теории алгоритмов и некоторые классы сложности алгоритмов. Приводятся алгоритмы работы с «длинными» целыми числами, которые не помещаются в одну ячейку компьютера,...
М.: Эксмо, 2007. — 256 с. — ISBN: 978-5-699-21047-3. Данную книгу можно рассматривать как краткий справочник по наиболее распространенным компьютерным алгоритмам. Она рассчитана в первую очередь на начинающих программистов, но может служить справочником для более опытных специалистов. Алгоритм описывается с помощью слов, псевдокодов и, как правило реализации (или примера его...
М.: Эксмо, 2007. — 256 с. — ISBN: 978-5-699-21047-3. Данную книгу можно рассматривать как краткий справочник по наиболее распространенным компьютерным алгоритмам. Она рассчитана в первую очередь на начинающих программистов, но может служить справочником для более опытных специалистов. Алгоритм описывается с помощью слов, псевдокодов и, как правило реализации (или примера его...
СПб.: Питер, 2024. — 240 с. — (Библиотека программиста»). — ISBN 978-5-4461-2412-1. Зачем читать скучные описания алгоритмов и продираться через нагромождение формул? Практические примеры и забавные объяснения позволят моментально разобраться с самыми сложными задачами, а юмор и прекрасные иллюстрации не дадут вам «заснуть» над книгой. Вы словно читаете короткие истории или...
М.: Бомбора, 2022. — 195 с. Вам требуется понять, что такое алгоритмы и графы, как они работают и изучить их? Эта книга для вас. Для ее чтения требуется лишь базовое школьное образование — здесь вы найдете все ответы на вопросы по этой теме, а также краткие и понятные объяснения даже сложных понятий и чуть-чуть математики. Автор, Панос Луридас, много лет занимается изучением и...
М.: Эксмо, 2018. — 608 с. — (Мировой компьютерный бестселлер). — ISBN: 978-5-04-089834-3. Алгоритмы правят миром! Эта книга в простой и наглядной форме дает ответы на целый ряд важнейших для начинающего программиста вопросов, начиная с "Что лежит в основе всех современных языков программирования и по каким принципам они строятся и работают?" и заканчивая "Есть ли способ...
Простой в реализации и эффективный метод умножения длинных чисел, один из самых первых оптимальных методов быстрого умножения длинных чисел. В архиве описание метода Карацубы и сравнение его с обычным умножением + исходники на C/C++ и на Java. Коды найдены в интернете, автор статьи: С. Ю. Лопатин Институт кибернетики им. В. М. Глушкова НАН Украины, г. Киев,
Тут описан метод Шёнхаге-Штрассена для быстрого умножения длинных целых чисел,
это один из самых быстрых алгоритмов изобретенных на сегодняшний день.
Статья из интернета, являет собой скан из книжки А. Ахо, Построение и анализ вычислительных алгоритмов.
Алматы: Қыздар университеті, 2014. — 84 б. Бұл оқу құралы жоғары оқу орындарының «Информатика» мамандығы студенттері мен оқытушыларына және осы саладағы жалпы білім беретін мектеп мұғалімдеріне арналған. Ұсынылып отырған оқу құралы алгоритмдік машиналарда программа құрып дағдылану, жалпы компьютердің жұмыс істеу принциптерін терең түсінуге болашақ маман иелеріне септігін...
Даны пошаговые описания основных алгоритмов теории чисел. Проблема рассмотрена с математической точки зрения, с соответствующими теоремами и доказательствами.
Формат: PDF
Страниц: 28
М.: ДМК Пресс, 2020. — 259 c. — ISBN: 978-5-97060-799-2. Каждую секунду во всем мире собирается и динамически обновляется огромный объем информации. Графовые алгоритмы, которые основаны на математике, специально разработанной для изучения взаимосвязей между данными, помогают разобраться в этих гигантских объемах. И, что особенно важно в наши дни, они улучшают контекстную...
ДМК Пресс, 2016. — 252 c. — ISBN: 978-5-97060-233-1. Большинство книг по структурам данных предполагают использование императивного языка программирования, например, C/C++ или Java. Однако реализации структур данных на таких языках далеко не всегда хорошо переносятся на функциональные языки программирования, такие как Стандартный ML, Haskell или Scheme. В этой книге структуры...
М.: Лаборатория знаний, 2020. — 253 с. Абстракция, абстрагирование – одна из составляющих мыслительного процесса творческой личности. Для развития этого компонента мышления в процессе обучения информатике есть дополнительные возможности, так как знание абстрактных типов данных, умение оперировать ими – необходимый элемент профессиональной культуры специалиста, связанного с...
М.: Бином. ЛЗ, 2015. — 288 с. В книге речь идет о традиционных алгоритмах, которые кажутся очевидными, — об алгоритмах выполнения арифметических операций: о том, сколько тайного смысла и усилий интеллекта многих специалистов по информатике заложено в эти алгоритмы. Материал книги формирует содержательную основу деятельностного изучения алгоритмов компьютерной арифметики, чему...
М.: ДМК Пресс, 2011. — 320 с. Введение. Парадигма структурного программирования . Зачем нужны общие принципы? Нисходящее проектирование. Три базовых элемента структурного программирования. Пример разработки. Вычислительные алгоритмы . Моделирование непрерывных процессов дискретными. Метод половинного деления. Общая задача поиска величины. Метод касательных. Метод хорд. Метод...
М.: ДМК Пресс, 2011. — 320 с. (OCR)
Это книга для тех, кто, хорошо владея языком программирования и устойчивыми навыками решения задач, желает наработать свой программистский инструментарий. В книге, неформально и довольно детально, разобран значительный набор алгоритмов и методов.
Большая часть представленных алгоритмов доведена до реализации на языке Компонентный Паскаль....
М.: ДМК Пресс, 2018. — 218 с. — ISBN: 9785970606063. Скан. Эта насыщенная идеями книга научит вас думать об эффективном взаимодействии с быстрыми потоками данных. В ней выдержан идеальный баланс между широкой картиной и деталями реализации. На содержательных примерах и практических задачах вы узнаете о проектировании приложений, которые читают, анализируют, разделяют и...
СПб.: Питер, 2021. — 304 с. — (Библиотека программиста). — ISBN 978-5-4461-1799-4. Алгоритмы — это сердце и душа computer science. Без них не обойтись, они есть везде — от сетевой маршрутизации и расчетов по геномике до криптографии и машинного обучения. «Совершенный алгоритм» превратит вас в настоящего профи, который будет ставить задачи и мастерски их решать как в жизни, так...
СПб.: Питер, 2019. — 256 с.: ил. — (Библиотека программиста). — ISBN: 978-5-4461-1272-2. Алгоритмы - это сердце и душа computeг science. Без них не обойтись, они есть везде - от сетевой маршрутизации и расчетов по геномике до криптографии и машинного обучения. «Совершенный алгоритм» превратит вас в настоящего профи, который будет ставить задачи и мастерски их решать как в...
Пер. с англ. А. Логунов. — СПб.: Питер, 2020. — 256 с.: ил. — (Библиотека программиста). — ISBN: 978-5-4461-1445-0. Это третья книга из серии в четырех частях, основанной на моих онлайн-курсах по алгоритмам, регулярно проводимых с 2012 года и которые, в свою очередь, основаны на курсе бакалавриата, многократно преподававшемся мною в Стэнфордском университете. Для читателей этой...
СПб.: Питер, 2019. — 256 с. — (Библиотека программиста). — ISBN: 978-5-4461-0907-4. Алгоритмы - это сердце и душа computer science. Без них не обойтись, они есть везде - от сетевой маршрутизации и расчетов по геномике до криптографии и машинного обучения. "Совершенный алгоритм" превратит вас в настоящего профи, который будет ставить задачи и мастерски их решать как в жизни, так...
2-е изд.: Пер. с англ. — СПб.: БХВ-Петербург, 2011. — 720 с.: ил. — ISBN: 978-5-9775-0560-4. Второе издание популярного бестселлера "Алгоритмы. Руководство по разработке" раскрывает тайны проектирования алгоритмов, анализа их действенности и эффективности. Развивая успешную концепцию первого издания, книга является отличным практическим руководством по разработке эффективных...
М.: Вильямс, 2006. — 496 с. — ISBN: 5-8459-1081-1. Книга "Методы и алгоритмы вычислений на строках" описывает фундаментальные алгоритмы, лежащие в основе построения эффективных вычислительных паттернов (шаблонов) над строковыми последовательностями. Это общие алгоритмы и методы, которые находят применение во многих областях науки и информационных технологий: сжатие данных,...
Москва: ДМК Пресс, 2019. — 279 с. — ISBN: 978-5-97060-696. Как доказать, что заданный алгоритм делает то, что он должен делать? Ключевые идеи индукции и инвариантности Стандартные методы проектирования: жадные алгоритмы, динамическое программирование и парадигма "разделяй и властвуй" Математическая основа алгоритмов Расширенные алгоритмы Задания с предельными срокам Онлайновые...
М.: Эксмо, 2016. — 544 с. — (Мировой компьютерный бестселлер). — ISBN: 978-5-699-81729-0. Алгоритмы – это рецепты, которые делают возможным эффективное программирование. Их изучение позволяет усвоить общие подходы к решению задач и накапливать полезные методики для их решения. В этой книге представлено множество классических алгоритмов, вы узнаете, где они применяются и как их...
СПб.: Питер, 2022. — 272 c.: ил. — (Серия «Библиотека программиста»). — ISBN 978-5-4461-1919-6. Алгоритмы это не только задачи поиска, сортировки или оптимизации, они помогут вам поймать бейсбольный мяч, проникнуть в «механику» машинного обучения и искусственного интеллекта и выйти за границы возможного. Вы узнаете нюансы реализации многих самых популярных алгоритмов...
2-е изд.: Пер. с англ. — М .: Вильямс, 2014. — 512 с. : ил. — ISBN: 978-5-8459-1838-3. Предисловие Введение Введение Основы Округление к степени 2 Арифметические границы Подсчет битов Поиск в слове Перестановка битов и байтов Умножение Целочисленное деление Целое деление на константы Некоторые элементарные функции Системы счисления с необычными основаниями Код Грея циклический...
2004. — 382 с. В этой книге слову "хакер" возвращено его первозданное значение — человека увлеченного, талантливого программиста, способного к созданию чрезвычайно эффективного и элегантного кода. В книге воплощен сорокалетний стаж ее автора в области разработки компиляторов и архитектуры компьютеров. Здесь вы найдете множество приемов для работы с отдельными битами, байтами,...
Исправленное издание. — М.: Вильямс, 2007. — 289 с. В этой книге слову "хакер" возвращено его первозданное значение — человека увлеченного, талантливого программиста, способного к созданию чрезвычайно эффективного и элегантного кода. В книге воплощен сорокалетний стаж ее автора в области разработки компиляторов и архитектуры компьютеров. Здесь вы найдете множество приемов для...
М.: Мир, 1982. — 288 с. Книга американского специалиста по системному программированию - уникальный сборник задач по программированию из разных областей: моделирования, точности вычислений, обработки текстов, искусственного интеллекта, конструирования компиляторов. Большинство задач базируется на реальных и игровых ситуациях. Для всех, кто преподает и изучает программирование.
М.: ДМК Пресс, 2022. — 442 с. В книге представлены полезные методы программирования, имеющие практическую ценность. Опираясь на свой многолетний опыт, авторы показывают, как написать надежный код, который смогут читать другие разработчики. Основной принцип обучения - составление плана решения: от определения структур данных по условиям поставленной задачи через примеры и тесты...
Москва: Мир, 1975. — 72 с. Книга посвящена систематическому рассмотрению методов синтаксического анализа, применяемых при компиляции программ для ЭВМ. Она написана на высоком научном уровне, однако от читателя не требуется предварительных знаний о формальных грамматиках и работе компиляторов, а предполагается только знакомство с основами программирования. Описываемые алгоритмы...
М.: МИР, 1974. 72 с. Книга содержит систематическое описание методов обработки списков, необходимых каждому программисту при работе с задачами со сложными данными. Краткое содержание: Представление списков; Операции над списками; Более сложные свойства; Пример обработки списков; Сборка мусора; Некоторые типичные языки обработки списков; Будущее обработки списков.
2-е изд. — СпБ.: ООО “Альфа-книга”, 2017. — 432 с. — ISBN: 978-5-9908910-7-4. В новом издании описано множество алгоритмов для решения задач из самых разных областей, и вы сможете выбрать и реализовать наиболее подходящий для ваших задач алгоритм. Здесь даже совершенно незнакомый с математикой читатель найдет все, что нужно для понимания и анализа производительности алгоритма....
Пер. с англ. Г. Курячий. — СПб.: Питер, 2023. — 304 с.: ил. — (Бестселлеры O’Reilly). — ISBN 978-5-4461-1963-9. Когда нужно, чтобы программа работала быстро и занимала поменьше памяти, профессионального программиста выручают знание алгоритмов и практика их применения. Эта книга - как раз про практику. Ее автор, Джордж Хайнеман, предлагает краткое, но четкое и последовательное...
М.: Издательство "Финансы и статистика", 2004. - 464 с. - ISBN: 5-279-02775-8
Рассмотрены структуры данных, их представление и алгоритмы обработки, без знания которых невозможно современное компьютерное программирование. Приведены различные алгоритмы для работы с очередями, стеками, списками, деревьями, таблицами, графами. Подробно описаны алгоритмы внутренней и внешней...
М.: Радио и связь, 1984. — 155 с. Показана возможность построения алгоритмов, решения широкого класса логических задач с использованием алгебры высказываний. Рассмотрены вопросы диагностики, анализа и синтеза релейно-контактных схем, задачи о расписании, задачи о счетчиках, автоматах и др. Для интересующихся проблемами кибернетики и вычислительной техники.
СПб.: Диалектика, 2019. — 353 с. Вы всегда считали, что алгоритм — это что-то из мира неопрятных хакеров, освещенных экранами в полутемных помещениях, забитых компьютерами? Что это нечто "не от мира сего", для обычного человека находящееся за гранью понимания? Вы непростительно ошибаетесь. Вероятно, это одно из наибольших заблуждений нашего времени — особенно непонятное в свете...
М.: ДМК Пресс, 2023. — 526 с. В этом руководстве содержатся основные сведения об алгоритмах: анализируются различные типы алгоритмов, рассматриваются мето-ды их построения (рекурсия, динамическое программирование и др.), приводятся практические примеры. В конце каждой главы приводятся упражнения, направленные на закрепление пройденного.Для изучения материала требуется знание...
Комментарии