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...
Paris, Publications Universitaires de France. Second edition(2002). 129p. Le terme algorithme tire son origine du nom du mathématicien persan Al Khwarizmi qui vécut vers l'an 820. La paternité de la notion d'algorithme ne peut cependant lui être attribuée, puisque cette notion est connue depuis l'Antiquité, comme en témoignent les écrits de Dio- phante d'Alexandrie et d'Euclide...
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, a crucial computer science skill. Our goal is to develop an Intelligent Tutoring...
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...
World Scientific Publishing, 2023. — 611 p. 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 algorithms and their associated data...
Arcler Press, 2022. — 412 p. This book covers different topics from deep learning algorithms, methods and approaches for deep learning, deep learning applications in biology, deep learning applications in medicine, and deep learning applications in pattern recognition systems. Section 1 focuses on methods and approaches for deep learning, describing advancements in deep...
IGI Global, 2023. — 318 p. Data structures are essential principles applicable to any programming language in computer science. Data structures may be studied more easily with Python than with any other programming language because of their interpretability, interactivity, and object-oriented nature. Computers may store and process data at an extraordinary rate and with...
Springer, 2022. — 447 p. This book provides an introduction to modern topics in scientific computing and Machine Learning (ML), using JULIA to illustrate the efficient implementation of algorithms. In addition to covering fundamental topics, such as optimization and solving systems of equations, it adds to the usual canon of computational science by including more advanced...
Leanpub, 2022. — 405 p. Readers will learn discrete mathematical abstracts as well as their implementation in algorithms 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 abstracts as well...
No Starch Press, 2023. — 307 p. 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 component in any programming...
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 formulasands describes when each is appropriate. The writer shows how to evaluate algorithms...
Manning Publications, 2022. — 306 p. — ISBN: 978-1617298035. In Algorithms and Data Structures for Massive Datasets, you'll discover methods for reducing and sketching data so it fits in small memory without losing accuracy, and unlock the algorithms and data structures that form the backbone of a big data system. Data structures and algorithms that are great for traditional...
Boca Raton: CRC Press, 2022. — 189 p. 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 the secret behind...
Apress, 2021. — 661 p. Learn approaches of computational thinking and the art of designing algorithms. Most of the algorithms you will see in this book are used in almost all software that runs on your computer. 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....
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...
Soundlikeyourself Publishing, LLC, 2018. — 221 p. — ISBN: 978-0-9992829-2-2. 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. Algorithms...
New York: Apress, 2020. — 146 p. 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 algorithms to apply to...
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 essential...
New York: O’Reilly Media, 2019. — 120 p. Quantum computers are set to kick-start a second computing revolution in an exciting and intriguing way. Learning to program a Quantum Processing Unit (QPU) is not only fun and exciting, but it's a way to get your foot in the door. Like learning any kind of programming, the best way to proceed is by getting your hands dirty and diving...
AU Press, 2013. — 344 p. — ISBN: 978-1-92735638-8. 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,...
Cambridge University Press, 2010. — 291 p. — ISBN13: 978-0-521-51338-8. 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 and...
New York: Soundlikeyourself Publishing, 2017. — 216 p. — ISBN: 978-0-9992829-0-8. 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...
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...
Hoboken: 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...
Cambridge University Press, 2015. — 390 p. — 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 students...
New York: McGraw-Hill Higher Education, 2008. — 332 p. This text explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal. Include: The use of boxes to strengthen the...
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...
Boston: Addison Wesley, 1997. — 208 p. This book is of interest to mathematicians and computer scientists working in finite mathematics and combinatorics. It presents a breakthrough method for analyzing complex summations. Beautifully written, the book contains practical applications as well as conceptual developments that will have applications in other areas of mathematics....
New York: Springer, 2016. — 162 p. This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses...
Prentice Hall, 1978. — 200 p. — ISBN: 978-0-13-291807-7. A collection of problems for "learning by doing," similar to real-life programming work. What’s It All About, Alfie? The Game of LIFE Why Is the Ocean Blue, Daddy? Printer’s Devil Winning Is the Only Thing Strike It Rich Kriss-Kross Theseus Know Thyself Yielding Up Its Gold Ye Soule of Witte A Sense of Community Touring...
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...
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...
Springer, 1993. — 209. Historically, computer security is related to both cryptography and access control in operating systems. Cryptography, although mostly applied in the military and diplomacy, was used to protect communication channels and storage facilities (especially the backups). In the seventies there was a breakthrough in cryptography - the invention of public-key...
Addison-Wesley, 1985. — 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 & Sons, 2011. — 432 p. — ISBN: 0470684534. 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 guru Roland Backhouse shares his four decades of experience to teach the fundamental principles of...
Stanford: CLSI, 2010. — 469 p. Robert W Floyd, in Memoriam he Bose-Nelson Sorting Problem A One-Way, Stackless Quicksort Algorithm Optimum Binary Search Trees Dynamic Huffman Coding Inhomogeneous Sorting Lexicographic Permutations with Restrictions Nested Satisfiability Fast Pattern Matching in Strings Addition Machines A Simple Program Whose Proof Isn’t Verification of...
A K Peters, 2002. — 292 p. This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and...
Pws Pub Co., 1995. — 672 p. — ISBN: 0314045740, 9780314045744 This book is one of the worst text books I have ever used! It is not worth the space it takes up let alone the trees which were ruthlessly massacred to create its pages. In fact, I would like to see the book converted to pure energy in some giant nuclear explosion and fed slowly to a black hole. The following...
Berlin: Springer-Verlag, 1989. – 600 p. This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Data Structures, WADS 2005, held in Waterloo, Canada, in August 2005. The 37 revised full papers presented were carefully reviewed and selected from 90 submissions. A broad variety of topics in algorithmics and data structures is addressed...
Bell Telephone Laboratories, 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...
Computer Science Press, 1978. – 641 p. – ISBN: 0914894226, 9780914894223 If we try to identify those contributions of computer science which will be long lasting, surely one of these will be the refinement of the concept called algorithm. Ever since man invented the idea of a machine which could perform basic mathematical operations, the study of what can be computed and how it...
W.H.Freeman & Co Ltd, 1997. – 777 p. – ISBN: 0716783169, 9780716783169 If we try to identify those contributions of computer science which will be long lasting, surely one of these will be the refinement of the concept called algorithm. Ever since man invented the idea of a machine which could perform basic mathematical operations, the study of what can be computed and how it...
Addison-Wesley, 1991. – 524 p. – ISBN: 067339736X, 9780673397362 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...
China Machine Press, 2006 - 492 p.; ISBN ISBN 978-7-111-18606-0 Original edition: Addison-Wesley Professional, 1995; ISBN 978-0-201-40009-0 1st edition. This book is a thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. The first half of the book draws upon classical mathematical material from discrete mathematics, elementary...
John Wiley & Sons, 1995. - 464 p. ISBN: 0471009555 A practical, step-by-step exposition of the special features of C++ algorithms and how they fit in overall program design. All algorithms in the text and on the accompanying disk have been created from scratch in C++. Methods described in each example are backed up with complete source code and each chapter progresses from...
Kenneth A. Berman, Jerome L. Paul, Course Technology, 2005, pages: 996 Algorithms: Sequential, Parallel, and Distributed offers in-depth coverage of traditional and current topics in sequential algorithms, as well as a solid introduction to the theory of parallel and distributed algorithms. In light of the emergence of modern computing environments such as parallel computers,...
Second edition, 1991. Includes bibliographical references and index. ISBN: 0-201-41607-7 1) Introduction Structure of the chapters Naming of variables Probabilities Asymptotic notation About the programming languages On the code for the algorithms Complexity measures and real timings 2) Basic Concepts Data structure description Algorithm descriptions 3) Searching Algorithms...
CUP, 1998. - 544 p. Geometric data structures and their systematic analysis guided the layout of this text. We have dedicated a part to each of the fundamental geometric structures: polytopes, triangulations, arrangements, and Voronoi diagrams. Combinatorial geometry plays an essential role in this book and the first chapters of each part lay the mathematical grounds and prove...
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...
Society for Industrial and Applied Mathematics, 1983, -131 p. In the last fifteen years there has been an explosive growth in the field of combinatorial algorithms. Although much of the recent work is theoretical in nature, many newly discovered algorithms are quite practical. These algorithms depend not only on new results in combinatorics and especially in graph theory, but...
Springer, 2008, -305 p. 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 modeling, understanding, and solving...
Brooks/Cole, 2001, -665 p. The study of data structures, a fundamental component of a computer science education, serves as the foundation upon which many other computer science fields are built. Some knowledge of data structures is a must for students who wish to do work in design implementation, testing, or maintenance of virtually any software system. The scope and...
Springer, 1998, -455 p. A workshop on the competitive analysis of on-line algorithms was held at Schloss Dagstuhl (Germany) during the last week of June 1996. Many survey talks were presented at this workshop. We then asked the speakers to prepare survey chapters that covered and extended the contents of their talks. This volume now is the compilation of the survey chapters. We...
A K Peters, 2002, -292 p. This text explains the fundamental principles of algorithms available for performing arithmetic operations on digital computers. These include basic arithmetic operations like addition, subtraction, multiplication, and division in fixed-point and floating-point number systems as well as more complex operations such as square root extraction and...
Morgan Kaufmann, 2004. — 728 p. — ISBN: 9781558607989, 1558607986. Digital arithmetic plays an important role in the design of general-purpose digital processors and of embedded systems for signal processing, graphics, and communications. In spite of a mature body of knowledge in digital arithmetic, each new generation of processors or digital systems creates new arithmetic...
Academic Press, 1972. - 235 p. Up to the present dynamic programming has been regarded as a general type of approach to problem solving, essentially based on decomposition of the given problem into a sequence of smaller subproblems. It has permitted the solution of a remarkable number of problems (deterministic and stochastic, continuous and discrete, constrained and...
Comments