Table of contents

The following topics are dealt with: network routing games; automatic inequality prover; instance optimal identity testing; bi-Lipschitz bijection; circuit complexity; proof complexity; polynomial identity testing; local Hamiltonian problems; counting subgraphs; constructive discrepancy minimization; decremental single-source shortest paths; undirected graphs; digital morphogenesis; hypergraph coloring; capacitated facility location; crowdsourcing; Steiner problems; planar graphs; bounded-genus graphs; monotonicity testing; noisy interactive quantum communication; Reed-Solomon erasure codes; matroid secretary problem; subgraph isomorphism; online bipartite matching; interactive coding; private RAM computation; linear programming; interactive data analysis; private empirical risk minimization; satisfiability; nonclairvoyantly scheduling heterogeneous processors; De Morgan formulae; single pass spectral sparsification; nearest neighbor search; distributed epsilon-approximation communication complexity; higher domain Holant problems; and Dyck language edit distance problem.