Algorithms (Panos Louridas)

 
0.0 (0)
Algorithms (Panos Louridas)

An approachable introduction to algorithms that explains how they function as well as what they are, using examples from many different application areas.

Algorithms, which are logical structures with detailed instructions, are the foundation of digital technology. Search engines, tournament scheduling, DNA sequencing, and machine learning are just a few examples of application domains.

In this volume of the MIT Press Essential Knowledge series, Panos Louridas argues that every educated person today has to have some understanding of algorithms and what they perform and provides a reader-friendly introduction to them. In addition to defining algorithms, Louridas also illustrates how they operate, using a variety of examples and little to no math.

Graphs, which describe networks from eighteenth-century problems to modern social networks, searching, and how to find the fastest way to search, as well as sorting, and the significance of selecting the best algorithm for particular tasks, are three of the most fundamental application areas covered by Louridas after discussing what an algorithm does and how its effectiveness can be measured.

Then he goes through larger-scale applications, including neural networks and deep learning as well as PageRank, the original algorithm used by Google. Finally, Louridas explains how all algorithms are nothing more than simple hand movements on paper, and how all of their amazing accomplishments stem from such a modest beginning.

Ebook Details

About the Authors
Athens University of Economics and Business' Department of Management Science and Technology is home to Associate Professor Panos Louridas. Real World Algorithms: A Beginner's Guide, written by him (MIT Press).
Publisher
Published
Published Date / Year
(August 18, 2020)
License(s)
MIT Open Access
Hardcover
312 pages
eBook Format
PDF files
Language
English
ISBN-10
0262539020
ISBN-13
978-0262539029

Similar Programming & Computer Books

Éléments d'algorithmique - Algorithmic elements (D. Beauquier, et al)
This free programming book differs from other treatises on algorithms in two ways: first, we give special attention to the new tree structures that have emerged recently (bicolor trees,...
Complexité algorithmique - Algorithmic complexity (Sylvain Perifel)
The foundational ideas of algorithmic complexity theory are first covered in this free programming book before moving on to a number of more sophisticated subjects. ...
Algorithmique du texte - Text Algorithms (Maxime Crochemore, et al)
This free programming book offers a broad overview of text-processing algorithms. As such, it is an algorithmic book, but one whose goal is to utilize computers to manipulate language....
Computer Arithmetic of Geometrical Figures: Algorithms and Hardware Design (S. I. Khmelnik)
This free programming book describes many iterations of processors made for affine transformations of planar and spatial many-dimensional figures. This processor is designed to perform affine transformations on geometrical...
Parallel Complexity Theory (Sanjeev Arora, et al.)
The focus of this free programming book is the research of Parallel Computing and Programming, which serves as an abstract indicator of the complexity of parallel computing problems. ...
Computational Complexity: A Conceptual Perspective (Oded Goldreich)
The study of the innate complexity of computer jobs is introduced conceptually in this free programming book. It is meant to be used as a textbook or for independent...
Computational Complexity (Wikibooks)
All computer science grads should read this free programming book since it offers information that is fundamental to their understanding of computation theory. ...
Learning Processing: A Beginner's Guide to Programming Images, Animation, and Interaction (Daniel Shiffman)
This free programming book shows you how to use Processing to build the fundamental programming building blocks required to develop cutting-edge graphics applications, such as interactive art, live video...
The Complexity of Boolean Functions (Ingo Wegener)
One of the most fascinating and crucial areas of theoretical computer science presently includes research on the difficulty of Boolean functions in non-uniform processing models. It directly relates to...
Applied Combinatorics on Words (M. Lothaire)
This volume's goal is to provide a comprehensive analysis of some of the main areas in which combinatorics is applied. Core algorithms for text processing, natural language processing, audio...

Others Programming Books by The MIT Press

Cellular: An Economic and Business History of the International Mobile-Phone Industry (Daniel D. Garcia-Swartz, et al)
From the late 1970s to the present, charts the development of the global cellular industry. It took exceptional collaboration between businesses, governments, and industrial sectors for the mobile phone...
The Ecology of Games: Connecting Youth, Games, and Learning (Katie Salen)
Little has been published on an overall "ecology" of gaming, game design, and play - mapping the ways that all the various elements, from code to social practices to...
Categories, Types, and Structures: An Introduction to Category Theory for the Working Computer Scientist (Andrea Asperti, et al)
This free programming book offers an accessible introduction to category theory for computer scientists as well as useful examples in the context of programming language design. In "Categories, Types...
Sheaf Theory through Examples (Daniel Rosiak)
This free programming book offers a clear introduction to elementary sheaf theory from the standpoint of applied category theory and explores several applications, such as n-colorings of graphs, satellite...
Wandering Games (Melissa Kagen)
Games may use wandering as a topic, formal style, metaphor for aesthetics, or player action. It can refer to moving forward, moving backward, traveling, meandering, or escaping. ...
Probabilistic Machine Learning: Advanced Topics (Kevin Patrick Murphy)
In this book, we broaden the use of machine learning to more difficult issues.
Introduction to Online Convex Optimization (Elad Hazan)
In this book, optimization is portrayed as a procedure. It is not realistic to draw out a thorough theoretical model and utilize traditional algorithmic theory and/or mathematical optimization in...
Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction (Sacha Friedli, et al)
Using a variety of specific models, such as the Curie-Weiss and Ising models, the Gaussian free field, O(n) models, and models with Ka interactions, this inspiring textbook provides a...
Software Design for Flexibility: How to Avoid Programming Yourself into a Corner (Chris Hanson, et al)
Techniques for designing huge systems that are easily reconfigurable for different scenarios with very modest programming changes.
Global Fintech: Financial Innovation in the Connected World (David L. Shrier, et al.)
The global financial services industry has been completely transformed by artificial intelligence, big data, blockchain, and other new technologies, opening up new prospects for business owners and corporate innovators....
Structure and Interpretation of Computer Programs, JavaScript Edition (Harold Abelson, et al.)
By building a number of mental models for computation, this book introduces the reader to the fundamental concepts of computation.
The New Hacker's Dictionary (The Jargon File) by Eric S. Raymond
This page includes a glossary of terminology used by various computer hacker subcultures. What we describe here is the language hackers use among themselves for amusement, social contact, and...
Algorithms for Decision Making (Mykel Kochenderfer, et al)
In this book, algorithms for making decisions in the face of uncertainty are introduced in great detail. It introduces the underlying mathematical problem formulations and the strategies for addressing...
Machine Learning: A Probabilistic Perspective (Kevin Patrick Murphy)
Automated data analysis techniques are necessary given the Web-enabled flood of electronic data we face today. These are provided by machine learning, which creates techniques that can automatically find...
Exploratory Programming for the Arts and Humanities (Nick Montfort)
There are no prerequisites or assuming prior programming experience in this book, which introduces programming to readers interested in the arts and humanities.
The Constitution of Algorithms: Ground-Truthing, Programming, Formulating (Florian Jaton)
The technologies we use every day are powered by algorithms, which are sometimes used interchangeably with words like "big data," "machine learning," and "artificial intelligence." Arguments concerning the real...
Linguistics for the Age of AI (Marjorie McShane, et al)
This book presents a model of language understanding for intelligent agent systems that is human-inspired and linguistically complex.
Probabilistic Machine Learning: An Introduction (Kevin Patrick Murphy)
Using probabilistic models and inference as a unifying strategy, this book provides a thorough introduction to machine learning.
How Humans Judge Machines (Cesar A. Hidalgo, et al)
A thorough analysis of how individuals respond to human activities versus machine actions. This book investigates when and why people differentiate between humans and machines through dozens of tests....
Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant (Adam Chlipala)
Many different computer science research endeavors can benefit from the use of mechanized program verification technologies, and the use of similar formal proof-checking tools in mathematics and engineering is...

User reviews

There are no user reviews for this listing.
Ratings
Rate this Book
Comments