New Books by Dartmouth Authors: Computer Science

What constitutes the study of philosophy or physics? What exactly does an anthropologist do, or a geologist or historian? In short, what are the arts and sciences? While many of us have been to college and many aspire to go, we may still wonder just what the various disciplines represent and how they interact. What are their origins, methods, applications, and unique challenges? What kind of people elect to go into each of these fields, and what are the big issues that motivate them? Curious to explore these questions himself, Dartmouth College professor and mathematician Dan Rockmore asked his colleagues to explain their fields and what it is that they do. The result is an accessible, entertaining, and enlightening survey of the ideas and subjects that contribute to a liberal education. The book offers a doorway to the arts and sciences for anyone intrigued by the vast world of ideas.

For anyone who has ever wondered how computers solve problems, an engagingly written guide for nonexperts to the basics of computer algorithms.

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 rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, with self-contained chapters and algorithms in pseudocode. Since the publication of the first edition, Introduction to Algorithms has become the leading algorithms text in universities worldwide as well as the standard reference for professionals. This fourth edition has been updated throughout. New for the fourth edition New chapters on matchings in bipartite graphs, online algorithms, and machine learningNew material on topics including solving recurrence equations, hash tables, potential functions, and suffix arrays140 new exercises and 22 new problemsReader feedback-informed improvements to old problemsClearer, more personal, and gender-neutral writing styleColor added to improve visual presentationNotes, bibliography, and index updated to reflect developments in the fieldWebsite with new supplementary material Warning- Avoid counterfeit copies of Introduction to Algorithms by buying only from reputable retailers. Counterfeit and pirated copies are incomplete and contain errors.