Introduction to Algorithms

Author: Thomas H. Cormen
Publisher: MIT Press
ISBN: 9780262533058
Release Date: 2009-07-31
Genre: Computers

A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.

Algorithms

Author: Robert Sedgewick
Publisher: Addison-Wesley Professional
ISBN: 0132762560
Release Date: 2011-02-21
Genre: Computers

This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing--including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu, contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

Algorithms to Live By

Author: Brian Christian
Publisher: Macmillan
ISBN: 9781627790369
Release Date: 2016-04-19
Genre: Business & Economics

A fascinating exploration of how insights from computer algorithms can be applied to our everyday lives, helping to solve common decision-making problems and illuminate the workings of the human mind All our lives are constrained by limited space and time, limits that give rise to a particular set of problems. What should we do, or leave undone, in a day or a lifetime? How much messiness should we accept? What balance of new activities and familiar favorites is the most fulfilling? These may seem like uniquely human quandaries, but they are not: computers, too, face the same constraints, so computer scientists have been grappling with their version of such issues for decades. And the solutions they've found have much to teach us. In a dazzlingly interdisciplinary work, acclaimed author Brian Christian and cognitive scientist Tom Griffiths show how the algorithms used by computers can also untangle very human questions. They explain how to have better hunches and when to leave things to chance, how to deal with overwhelming choices and how best to connect with others. From finding a spouse to finding a parking spot, from organizing one's inbox to understanding the workings of memory, Algorithms to Live By transforms the wisdom of computer science into strategies for human living.

Algorithms on Strings Trees and Sequences

Author: Dan Gusfield
Publisher: Cambridge University Press
ISBN: 0521585198
Release Date: 1997-05-28
Genre: Computers

String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This 1997 book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.

Algorithms of Oppression

Author: Safiya Umoja Noble
Publisher: NYU Press
ISBN: 9781479837243
Release Date: 2018-02-20
Genre: Computers

A revealing look at how negative biases against women of color are embedded in search engine results and algorithms Run a Google search for “black girls”—what will you find? “Big Booty” and other sexually explicit terms are likely to come up as top search terms. But, if you type in “white girls,” the results are radically different. The suggested porn sites and un-moderated discussions about “why black women are so sassy” or “why black women are so angry” presents a disturbing portrait of black womanhood in modern society. In Algorithms of Oppression, Safiya Umoja Noble challenges the idea that search engines like Google offer an equal playing field for all forms of ideas, identities, and activities. Data discrimination is a real social problem; Noble argues that the combination of private interests in promoting certain sites, along with the monopoly status of a relatively small number of Internet search engines, leads to a biased set of search algorithms that privilege whiteness and discriminate against people of color, specifically women of color. Through an analysis of textual and media searches as well as extensive research on paid online advertising, Noble exposes a culture of racism and sexism in the way discoverability is created online. As search engines and their related companies grow in importance—operating as a source for email, a major vehicle for primary and secondary school learning, and beyond—understanding and reversing these disquieting trends and discriminatory practices is of utmost importance. An original, surprising and, at times, disturbing account of bias on the internet, Algorithms of Oppression contributes to our understanding of how racism is created, maintained, and disseminated in the 21st century.

Approximation Algorithms

Author: Vijay V. Vazirani
Publisher: Springer Science & Business Media
ISBN: 3540653678
Release Date: 2002-12-05
Genre: Computers

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

Design and Analysis of Algorithms

Author: Parag Himanshu Dave
Publisher: Pearson Education India
ISBN: 8177585959
Release Date: 2009-08-10
Genre: Algorithms

"All aspects pertaining to algorithm design and algorithm analysis have been discussed over the chapters in this book-- Design and Analysis of Algorithms"--Resource description p.

DESIGN AND ANALYSIS OF ALGORITHMS

Author: R. PANNEERSELVAM
Publisher: PHI Learning Pvt. Ltd.
ISBN: 8120332784
Release Date: 2007-12-18
Genre: Computers

This highly structured text provides comprehensive coverage of design techniques of algorithms. It traces the complete development of various algorithms in a stepwise approach followed by their pseudo-codes to build an understanding of their application in practice. With clear explanations, the book analyzes different kinds of algorithms such as distance-based network algorithms, search algorithms, sorting algorithms, probabilistic algorithms, and single as well as parallel processor scheduling algorithms. Besides, it discusses the importance of heuristics, benchmarking of algorithms, cryptography, and dynamic programming. Key Features : Offers in-depth treatment of basic and advanced topics. Includes numerous worked examples covering varied real-world situations to help students grasp the concepts easily. Provides chapter-end exercises to enable students to check their mastery of content. This text is especially designed for students of B.Tech and M.Tech (Computer Science and Engineering and Information Technology), MCA, and M.Sc. (Computer Science and Information Technology). It would also be useful to undergraduate students of electrical and electronics and other engineering disciplines where a course in algorithms is prescribed.

Analysis and Design of Algorithms for Combinatorial Problems

Author: G. Ausiello
Publisher: Elsevier
ISBN: 0080872204
Release Date: 1985-05-01
Genre: Mathematics

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in computing power and the availability of data and software. The availability of such basic tools has led to the feasibility of the exact or well approximate solution of large scale realistic combinatorial optimization problems and has created a number of new combinatorial problems.

DESIGN METHODS AND ANALYSIS OF ALGORITHMS

Author: S. K. BASU
Publisher: PHI Learning Pvt. Ltd.
ISBN: 9788120347465
Release Date: 2013-04-17
Genre: Computers

The design of correct and efficient algorithms for problem solving lies at the heart of computer science. This concise text, without being highly specialized, teaches the skills needed to master the essentials of this subject. With clear explanations and engaging writing style, the book places increased emphasis on algorithm design techniques rather than programming in order to develop in the reader the problem-solving skills. The treatment throughout the book is primarily tailored to the curriculum needs of B.Tech. students in computer science and engineering, B.Sc. (Hons.) and M.Sc. students in computer science, and MCA students. The book focuses on the standard algorithm design methods and the concepts are illustrated through representative examples to offer a reader-friendly text. Elementary analysis of time complexities is provided for each example-algorithm. A varied collection of exercises at the end of each chapter serves to reinforce the principles/methods involved. New To This Edition • Additional problems • A new Chapter 14 on Bioinformatics Algorithms • The following new sections: » BSP model (Chapter 0) » Some examples of average complexity calculation (Chapter 1) » Amortization (Chapter 1) » Some more data structures (Chapter 1) » Polynomial multiplication (Chapter 2) » Better-fit heuristic (Chapter 7) » Graph matching (Chapter 9) » Function optimization, neighbourhood annealing and implicit elitism (Chapter 12) • Additional matter in Chapter 15 • Appendix

Algorithms For Dummies

Author: John Paul Mueller
Publisher: John Wiley & Sons
ISBN: 9781119330493
Release Date: 2017-02-21
Genre: Computers

Algorithms For Dummies addresses people who are interested in algorithms without requiring them to pursue a PhD on the subject. The idea is that we already live in a world where algorithms are behind most of the technology we use, so we need to understand them better. In order to make this happen, the book would present the major areas comprising algorithms (optimization, sort, graph, hash, string, dynamic programming) telling the history behind algorithms, presenting actual applications, simply explaining the nuts and bolts of the algorithm. For readers who are interested, the book presents an implementation in Python and some experiments with them, so they can get hands on experience developing an algorithm from start to finish. The goal is to create an accessible introduction to algorithms, so that the reader can understand how the key algorithms work and how to benefit from algorithms when working on projects and implementing them in business strategy.