Gems of Theoretical Computer Science


Book Description

This book assembles some of the most important problems and solutions in theoretical computer science-from computability, logic, circuit theory, and complexity. The book presents these important results with complete proofs in an understandable form. It also presents previously open problems that have found (perhaps unexpected) solutions, and challenges the reader to pursue further active research in computer science.







Gems of Combinatorial Optimization and Graph Algorithms


Book Description

Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.




Mathematics and Computation


Book Description

From the winner of the Turing Award and the Abel Prize, an introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography




STEM Gems


Book Description

Tired of seeing the same careers foisted upon women in TV, movies and magazines? Chemical engineer Stephanie Espy, a graduate of MIT, UC Berkeley and Emory University, tells the stories of 44 inspiring women in STEM to show girls and young women around the world a new set of women heroes to look up to.The statistics for women in Science, Technology, Engineering and Mathematics (STEM) careers are just plain sad. In recent years, fewer than 20% of college graduates in engineering and computer science were women. While stereotypes pervade about women in these fields, the truth is that most girls have never even heard of these careers and are not aware of the wide range of options that exist.In STEM Gems, you and your daughter, niece, neighbor, friend or student will discover: The stories of 44 inspiring women in diverse STEM fields and how they made it; The challenges these incredible women faced in pursuit of their dreams; The tremendous accomplishments these Gems have achieved in their respective STEM fields; Advice on how to pursue science, technology, engineering and mathematics careers; Actionable steps girls and young women can take right now to set themselves up for success; What girls and young women can expect in a promising STEM career, and much, much more!Through the powerful stories of the STEM Gems in this book, girls and young women will have their pick of current role models of various ages, ethnicities and job types. And through the eight chapters that outline actionable steps, girls and young women will learn what they can do right now, today, to set themselves up for success and to create their own unique paths. STEM Gems is relatable, encouraging and inspiring, demonstrating the limitless possibilities for the next generation of women.




Theoretical Computer Science


Book Description

This volume commemorates Shimon Even, one of founding fathers of Computer Science in Israel, who passed away on May 1, 2004. This Festschrift contains research contributions, surveys and educational essays in theoretical computer science, written by former students and close collaborators of Shimon. The essays address natural computational problems and are accessible to most researchers in theoretical computer science.




The Complexity Theory Companion


Book Description

Here is an accessible, algorithmically oriented guide to some of the most interesting techniques of complexity theory. The book shows that simple algorithms are at the heart of complexity theory. The book is organized by technique rather than by topic. Each chapter focuses on one technique: what it is, and what results and applications it yields.




Twenty Lectures on Algorithmic Game Theory


Book Description

Computer science and economics have engaged in a lively interaction over the past fifteen years, resulting in the new field of algorithmic game theory. Many problems that are central to modern computer science, ranging from resource allocation in large networks to online advertising, involve interactions between multiple self-interested parties. Economics and game theory offer a host of useful models and definitions to reason about such problems. The flow of ideas also travels in the other direction, and concepts from computer science are increasingly important in economics. This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.




Extremal Combinatorics


Book Description

This is a concise, up-to-date introduction to extremal combinatorics for non-specialists. Strong emphasis is made on theorems with particularly elegant and informative proofs which may be called the gems of the theory. A wide spectrum of the most powerful combinatorial tools is presented, including methods of extremal set theory, the linear algebra method, the probabilistic method and fragments of Ramsey theory. A thorough discussion of recent applications to computer science illustrates the inherent usefulness of these methods.




Euler's Gem


Book Description

How a simple equation reshaped mathematics Leonhard Euler’s polyhedron formula describes the structure of many objects—from soccer balls and gemstones to Buckminster Fuller’s buildings and giant all-carbon molecules. Yet Euler’s theorem is so simple it can be explained to a child. From ancient Greek geometry to today’s cutting-edge research, Euler’s Gem celebrates the discovery of Euler’s beloved polyhedron formula and its far-reaching impact on topology, the study of shapes. Using wonderful examples and numerous illustrations, David Richeson presents this mathematical idea’s many elegant and unexpected applications, such as showing why there is always some windless spot on earth, how to measure the acreage of a tree farm by counting trees, and how many crayons are needed to color any map. Filled with a who’s who of brilliant mathematicians who questioned, refined, and contributed to a remarkable theorem’s development, Euler’s Gem will fascinate every mathematics enthusiast. This paperback edition contains a new preface by the author.