Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. ACM, 2017. [doi]

Conference: stoc2017

Abstract is missing.

- Recent trends in decentralized cryptocurrencies (invited talk)1 [doi]
- Why prices need algorithms (invited talk)2 [doi]
- Optimizing tree pattern queries: why cutting is not enough (invited talk)3 [doi]
- Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk)4 [doi]
- Fast convergence of learning in games (invited talk)5 [doi]
- Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk)6 [doi]
- The next 700 network programming languages (invited talk)7 [doi]
- Practical post-quantum key agreement from generic lattices (invited talk)8 [doi]
- Twenty (simple) questions9-21 [doi]
- Kolmogorov complexity version of Slepian-Wolf coding22-32 [doi]
- Synchronization strings: codes for insertions and deletions approaching the Singleton bound33-46 [doi]
- Learning from untrusted data47-60 [doi]
- Beating 1-1/e for ordered prophets61-71 [doi]
- Kernel-based methods for bandit convex optimization72-85 [doi]
- New hardness results for routing on disjoint paths86-99 [doi]
- A simpler and faster strongly polynomial algorithm for generalized flow maximization100-111 [doi]
- Finding even cycles faster via capped k-walks112-120 [doi]
- Strongly refuting random CSPs below the spectral threshold121-131 [doi]
- Sum of squares lower bounds for refuting any CSP132-145 [doi]
- Information-theoretic thresholds from the cavity method146-157 [doi]
- Bernoulli factories and black-box reductions in mechanism design158-169 [doi]
- Simple mechanisms for subadditive buyers via duality170-183 [doi]
- Stability of service under time-of-use pricing184-197 [doi]
- Faster space-efficient algorithms for subset sum and k-sum198-209 [doi]
- Homomorphisms are a good basis for counting small subgraphs210-223 [doi]
- Lossy kernelization224-237 [doi]
- Explicit, almost optimal, epsilon-balanced codes238-251 [doi]
- Deciding parity games in quasipolynomial time252-263 [doi]
- A weighted linear matroid parity algorithm264-276 [doi]
- Exponential separation of quantum communication and classical information277-288 [doi]
- Compression of quantum multi-prover interactive proofs289-302 [doi]
- Hardness amplification for entangled games via anchoring303-316 [doi]
- The computational complexity of ball permutations317-327 [doi]
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation328-341 [doi]
- Uniform sampling through the Lovasz local lemma342-355 [doi]
- Approximate counting, the Lovasz local lemma, and inference in graphical models356-369 [doi]
- Real stable polynomials and matroids: optimization and counting370-383 [doi]
- A generalization of permanent inequalities and applications in counting and optimization384-396 [doi]
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling397-409 [doi]
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs410-419 [doi]
- Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree420-428 [doi]
- Local max-cut in smoothed polynomial time429-437 [doi]
- Algorithms for stable and perturbation-resilient problems438-451 [doi]
- ∞ regularization, and undirected multicommodity flow452-460 [doi]
- Pseudorandomness of ring-LWE for any ring and modulus461-473 [doi]
- Non-interactive delegation and batch NP verification from standard computational assumptions474-482 [doi]
- Average-case fine-grained hardness483-496 [doi]
- Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model497-509 [doi]
- Removal lemmas with polynomial bounds510-522 [doi]
- Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness523-536 [doi]
- Online and dynamic algorithms for set cover537-550 [doi]
- Online service with delay551-563 [doi]
- The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log n564-575 [doi]
- On independent sets, 2-to-2 games, and Grassmann graphs576-589 [doi]
- Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs590-603 [doi]
- How well do local algorithms solve semidefinite programs?604-614 [doi]
- A polynomial restriction lemma with applications615-628 [doi]
- Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace629-640 [doi]
- Probabilistic rank and matrix rigidity641-652 [doi]
- Succinct hitting sets and barriers to proving algebraic circuits lower bounds653-664 [doi]
- Pseudodeterministic constructions in subexponential time665-677 [doi]
- An SDP-based algorithm for linear-sized spectral sparsification678-687 [doi]
- 1-norm error688-701 [doi]
- An adaptive sublinear-time block sparse fourier transform702-715 [doi]
- Streaming symmetric norms via measure concentration716-729 [doi]
- Sampling random spanning trees faster than matrix multiplication730-742 [doi]
- A time- and message-optimal distributed algorithm for minimum spanning trees743-756 [doi]
- Distributed exact shortest paths in sublinear time757-770 [doi]
- Exponential separations in the energy complexity of leader election771-783 [doi]
- On the complexity of local distributed graph problems784-797 [doi]
- Efficient massively parallel methods for dynamic programming798-811 [doi]
- Complexity of short Presburger arithmetic812-820 [doi]
- Linear matroid intersection is in quasi-NC821-830 [doi]
- Randomized polynomial time identity testing for noncommutative circuits831-841 [doi]
- Holographic algorithm with matchgates is universal for planar #CSP over boolean domain842-855 [doi]
- Efficient empirical revenue maximization in single-parameter auction environments856-868 [doi]
- The menu-size complexity of revenue approximation869-877 [doi]
- Communication complexity of approximate Nash equilibria878-889 [doi]
- Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria890-901 [doi]
- Approximate near neighbors for general symmetric norms902-913 [doi]
- Algorithmic discrepancy beyond partial coloring914-926 [doi]
- Geodesic walks in polytopes927-940 [doi]
- A reverse Minkowski theorem941-953 [doi]
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph954-961 [doi]
- Efficient quantum tomography II962-974 [doi]
- Quantum entanglement, sum of squares, and the log rank conjecture975-988 [doi]
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games989-1002 [doi]
- A quantum linearity test for robustly verifying entanglement1003-1015 [doi]
- The limitations of optimization from samples1016-1027 [doi]
- Approximate modularity revisited1028-1041 [doi]
- 1/3)) samples1042-1046 [doi]
- Optimal mean-based algorithms for trace reconstruction1047-1056 [doi]
- Provable learning of noisy-OR networks1057-1066 [doi]
- Time-space hardness of learning sparse parities1067-1080 [doi]
- DecreaseKeys are expensive for external memory priority queues1081-1093 [doi]
- Set similarity search beyond MinHash1094-1107 [doi]
- Decremental single-source reachability in planar digraphs1108-1121 [doi]
- 1/2 - ε)-time1122-1129 [doi]
- Fully-dynamic minimum spanning forest with improved worst-case update time1130-1143 [doi]
- Improved non-malleable extractors, non-malleable codes and independent source extractors1144-1156 [doi]
- Towards optimal two-source extractors and Ramsey graphs1157-1170 [doi]
- Non-malleable codes and extractors for small-depth circuits, and affine functions1171-1184 [doi]
- An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy1185-1194 [doi]
- Finding approximate local minima faster than gradient descent1195-1199 [doi]
- Katyusha: the first direct acceleration of stochastic gradient methods1200-1205 [doi]
- A strongly polynomial algorithm for bimodular integer linear programming1206-1219 [doi]
- Subquadratic submodular function minimization1220-1231 [doi]
- Addition is exponentially harder than counting for shallow monotone circuits1232-1245 [doi]
- Strongly exponential lower bounds for monotone computation1246-1255 [doi]
- Formula lower bounds via the quantum method1256-1268 [doi]