The fields of computer science and game theory both trace their
roots to the first half of the 20th century, with the work of
Turing, von Neumann, Nash, and others. The 21st century has seen
many fruitful points of contact between these two fields...
The goal of these lectures is to present the fundamentals of
Simpson’s correspondence, generalizing classical Hodge theory,
between complex local systems and semistable Higgs bundles with
vanishing Chern classes on smooth projective varieties.
The interstellar medium (ISM) is a turbulent, multi-phase,
magnetic environment. It is home to vastly different gas phases,
from cold, dense clouds to hot, tenuous plasma. Magnetic fields
thread this interstellar environment, helping to sculpt...
One of the primary goals of the mathematical analysis of
algorithms is to provide guidance about which algorithm is the
“best” for solving a given computational problem. Worst-case
analysis summarizes the performance profile of an algorithm by
its...
Over 40 years ago, Karp, Upfal, and Wigderson posed a central
open question in parallel computation: how many adaptive rounds are
needed to find a basis of a matroid using only independence
queries? Their pioneering work gave an upper bound of O(n‾√...
Analog Superpowers explores the early history of computing,
intellectual property law, government secrecy, and Anglo-American
relations to draw out surprising connections with today’s world of
digital devices and great-power competition. It follows...