[Copyright notice]

The following topics are dealt with: learning topic models; learning parities; learning juntas; leakage presence; concurrently secure computation; 3-colorable graph combinatorial coloring; traveling salesman problem; universal Steiner trees; decision trees; two-party bounded-round public-coin communication complexity; optimal local graph clustering; learning-graph-based quantum algorithm; d-regular graphs; q-colorable graphs; analyst privacy; differential privacy preservation; satisfiability; cutting plane method; bipartite graph min-cost imperfect matching; planar digraph; geometric complexity theory; privacy amplification; randomized greedy algorithm; everywhere-sparse spanners and dense subgraphs.