• Title: The Everyday Life of an Algorithm
• Author(s) Daniel Neyland
• Publisher: Palgrave Pivot; 1st ed. (January 3, 2019); eBook (Creative Commons Licensed)
• License(s): CC BY 4.0
• Hardcover/Paperback: 160 pages
• eBook: PDF (154 pages) and ePub
• Language: English
• ISBN-10: 3030005771
• ISBN-13: 978-3030005771
• Share This:  

Book Description

This open access book begins with an algorithm - a set of IF...THEN rules used in the development of a new, ethical, video surveillance architecture for transport hubs. Readers are invited to follow the algorithm over three years, charting its everyday life.

Questions of ethics, transparency, accountability and market value must be grasped by the algorithm in a series of ever more demanding forms of experimentation. Here the algorithm must prove its ability to get a grip on everyday life if it is to become an ordinary feature of the settings where it is being put to work.

Through investigating the everyday life of the algorithm, the book opens a conversation with existing social science research that tends to focus on the power and opacity of algorithms. In this book we have unique access to the algorithm's design, development and testing, but can also bear witness to its fragility and dependency on others.

• Daniel Neyland is Professor of Sociology at Goldsmiths, the University of London, UK. His research engages with issues of governance, accountability and ethics in forms of science, technology and organization. He has published books on privacy and surveillance, organizational ethnography, mundane governance, etc.

• Amazon

• Data Structures and Algorithms
• Computational Complexity

• The Everyday Life of an Algorithm (Daniel Neyland)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• The Mirror Site (3) - PDF
• The Mirror Site (4) - PDF

• Algorithms for Optimization (Mykel J. Kochenderfer, et al.)

  A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems. Readers will learn about computational approaches for a range of challenges.

• Design of Heuristic Algorithms for Hard Optimization

  This open access 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.

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.

• The Constitution of Algorithms (Florian Jaton)

  A provocative and skillful study of how algorithms come into the world - and inevitably shape it. Jaton performs the daring feat of offering an empirically rich analysis of algorithms without taking them for granted.

• Lecture Notes for the Algorithms (Jeff Erickson)

  This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

• Algorithms: Fundamental Techniques (Macneil Shonle, et al)

  The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

• Think Data Structures: Algorithms and Information Retrieval

  This practical book will help you learn and review some of the most important ideas in software engineering - data structures and algorithms - in a way that's clearer, more concise, and more engaging than other materials. Useful in technical interviews too.

• Elementary Algorithms (Xinyu Liu)

  This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

• Algorithm Design (Jon Kleinberg, et al)

  This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

• Problems on Algorithms, 2nd Edition (Ian Parberry)

  This book provides an extensive and varied collection of useful, practical problems on the design, analysis, and verification of algorithms. By the end of this book, you will have mastered widely applicable algorithms as well as how and when to use them.