Table of Contents

• Recent trends in decentralized cryptocurrencies (invited talk)Aviv Zohar. 1 [doi]
• Why prices need algorithms (invited talk)Tim Roughgarden, Inbal Talgam-Cohen. 2 [doi]
• Optimizing tree pattern queries: why cutting is not enough (invited talk)Wim Martens. 3 [doi]
• Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk)Atri Rudra. 4 [doi]
• Fast convergence of learning in games (invited talk)Vasilis Syrgkanis. 5 [doi]
• Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk)Orna Kupferman. 6 [doi]
• The next 700 network programming languages (invited talk)Nate Foster. 7 [doi]
• Practical post-quantum key agreement from generic lattices (invited talk)Valeria Nikolaenko. 8 [doi]
• Twenty (simple) questionsYuval Dagan, Yuval Filmus, Ariel Gabizon, Shay Moran. 9-21 [doi]
• Kolmogorov complexity version of Slepian-Wolf codingMarius Zimand. 22-32 [doi]
• Synchronization strings: codes for insertions and deletions approaching the Singleton boundBernhard Haeupler, Amirbehshad Shahrasbi. 33-46 [doi]
• Learning from untrusted dataMoses Charikar, Jacob Steinhardt, Gregory Valiant. 47-60 [doi]
• Beating 1-1/e for ordered prophetsMelika Abolhassani, Soheil Ehsani, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Robert D. Kleinberg, Brendan Lucier. 61-71 [doi]
• Kernel-based methods for bandit convex optimizationSébastien Bubeck, Yin Tat Lee, Ronen Eldan. 72-85 [doi]
• New hardness results for routing on disjoint pathsJulia Chuzhoy, David H. K. Kim, Rachit Nimavat. 86-99 [doi]
• A simpler and faster strongly polynomial algorithm for generalized flow maximizationNeil Olver, László A. Végh. 100-111 [doi]
• Finding even cycles faster via capped k-walksSøren Dahlgaard, Mathias Bæk Tejs Knudsen, Morten Stöckel. 112-120 [doi]
• Strongly refuting random CSPs below the spectral thresholdPrasad Raghavendra, Satish Rao, Tselil Schramm. 121-131 [doi]
• Sum of squares lower bounds for refuting any CSPPravesh K. Kothari, Ryuhei Mori, Ryan O'Donnell, David Witmer. 132-145 [doi]
• Information-theoretic thresholds from the cavity methodAmin Coja-Oghlan, Florent Krzakala, Will Perkins, Lenka Zdeborová. 146-157 [doi]
• Bernoulli factories and black-box reductions in mechanism designShaddin Dughmi, Jason D. Hartline, Robert Kleinberg, Rad Niazadeh. 158-169 [doi]
• Simple mechanisms for subadditive buyers via dualityYang Cai, Mingfei Zhao. 170-183 [doi]
• Stability of service under time-of-use pricingShuchi Chawla, Nikhil R. Devanur, Alexander E. Holroyd, Anna R. Karlin, James B. Martin, Balasubramanian Sivan. 184-197 [doi]
• Faster space-efficient algorithms for subset sum and k-sumNikhil Bansal, Shashwat Garg, Jesper Nederlof, Nikhil Vyas. 198-209 [doi]
• Homomorphisms are a good basis for counting small subgraphsRadu Curticapean, Holger Dell, Dániel Marx. 210-223 [doi]
• Lossy kernelizationDaniel Lokshtanov, Fahad Panolan, M. S. Ramanujan, Saket Saurabh. 224-237 [doi]
• Explicit, almost optimal, epsilon-balanced codesAmnon Ta-Shma. 238-251 [doi]
• Deciding parity games in quasipolynomial timeCristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan 0001. 252-263 [doi]
• A weighted linear matroid parity algorithmSatoru Iwata, Yusuke Kobayashi 0001. 264-276 [doi]
• Exponential separation of quantum communication and classical informationAnurag Anshu, Dave Touchette, Penghui Yao, Nengkun Yu. 277-288 [doi]
• Compression of quantum multi-prover interactive proofsZhengfeng Ji. 289-302 [doi]
• Hardness amplification for entangled games via anchoringMohammad Bavarian, Thomas Vidick, Henry Yuen. 303-316 [doi]
• The computational complexity of ball permutationsScott Aaronson, Adam Bouland, Greg Kuperberg, Saeed Mehraban. 317-327 [doi]
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulationPierre-Étienne Meunier, Damien Woods. 328-341 [doi]
• Uniform sampling through the Lovasz local lemmaHeng Guo, Mark Jerrum, Jingcheng Liu 0001. 342-355 [doi]
• Approximate counting, the Lovasz local lemma, and inference in graphical modelsAnkur Moitra. 356-369 [doi]
• Real stable polynomials and matroids: optimization and countingDamian Straszak, Nisheeth K. Vishnoi. 370-383 [doi]
• A generalization of permanent inequalities and applications in counting and optimizationNima Anari, Shayan Oveis Gharan. 384-396 [doi]
• Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scalingAnkit Garg, Leonid Gurvits, Rafael Oliveira, Avi Wigderson. 397-409 [doi]
• Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphsMichael B. Cohen, Jonathan A. Kelner, John Peebles, Richard Peng, Anup B. Rao, Aaron Sidford, Adrian Vladu. 410-419 [doi]
• Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner treeFabrizio Grandoni, Bundit Laekhanukit. 420-428 [doi]
• Local max-cut in smoothed polynomial timeOmer Angel, Sébastien Bubeck, Yuval Peres, Fan Wei. 429-437 [doi]
• Algorithms for stable and perturbation-resilient problemsHaris Angelidakis, Konstantin Makarychev, Yury Makarychev. 438-451 [doi]
• ∞ regularization, and undirected multicommodity flowJonah Sherman. 452-460 [doi]
• Pseudorandomness of ring-LWE for any ring and modulusChris Peikert, Oded Regev 0001, Noah Stephens-Davidowitz. 461-473 [doi]
• Non-interactive delegation and batch NP verification from standard computational assumptionsZvika Brakerski, Justin Holmgren, Yael Tauman Kalai. 474-482 [doi]
• Average-case fine-grained hardnessMarshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan. 483-496 [doi]
• Equivocating Yao: constant-round adaptively secure multiparty computation in the plain modelRan Canetti, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam. 497-509 [doi]
• Removal lemmas with polynomial boundsLior Gishboliner, Asaf Shapira. 510-522 [doi]
• Beyond Talagrand functions: new lower bounds for testing monotonicity and unatenessXi Chen, Erik Waingarten, Jinyu Xie. 523-536 [doi]
• Online and dynamic algorithms for set coverAnupam Gupta, Ravishankar Krishnaswamy, Amit Kumar 0001, Debmalya Panigrahi. 537-550 [doi]
• Online service with delayYossi Azar, Arun Ganesh, Rong Ge, Debmalya Panigrahi. 551-563 [doi]
• The integrality gap of the Goemans-Linial SDP relaxation for sparsest cut is at least a constant multiple of √log nAssaf Naor, Robert Young. 564-575 [doi]
• On independent sets, 2-to-2 games, and Grassmann graphsSubhash Khot, Dor Minzer, Muli Safra. 576-589 [doi]
• Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPsPravesh K. Kothari, Raghu Meka, Prasad Raghavendra. 590-603 [doi]
• How well do local algorithms solve semidefinite programs?Zhou Fan, Andrea Montanari. 604-614 [doi]
• A polynomial restriction lemma with applicationsValentine Kabanets, Daniel M. Kane, Zhenjian Lu. 615-628 [doi]
• Targeted pseudorandom generators, simulation advice generators, and derandomizing logspaceWilliam M. Hoza, Chris Umans. 629-640 [doi]
• Probabilistic rank and matrix rigidityJosh Alman, R. Ryan Williams. 641-652 [doi]
• Succinct hitting sets and barriers to proving algebraic circuits lower boundsMichael A. Forbes, Amir Shpilka, Ben lee Volk. 653-664 [doi]
• Pseudodeterministic constructions in subexponential timeIgor Carboni Oliveira, Rahul Santhanam. 665-677 [doi]
• An SDP-based algorithm for linear-sized spectral sparsificationYin Tat Lee, He Sun 0001. 678-687 [doi]
• 1-norm errorZhao Song, David P. Woodruff, Peilin Zhong. 688-701 [doi]
• An adaptive sublinear-time block sparse fourier transformVolkan Cevher, Michael Kapralov, Jonathan Scarlett, Amir Zandieh. 702-715 [doi]
• Streaming symmetric norms via measure concentrationJaroslaw Blasiok, Vladimir Braverman, Stephen R. Chestnut, Robert Krauthgamer, Lin F. Yang. 716-729 [doi]
• Sampling random spanning trees faster than matrix multiplicationDavid Durfee, Rasmus Kyng, John Peebles, Anup B. Rao, Sushant Sachdeva. 730-742 [doi]
• A time- and message-optimal distributed algorithm for minimum spanning treesGopal Pandurangan, Peter Robinson 0002, Michele Scquizzato. 743-756 [doi]
• Distributed exact shortest paths in sublinear timeMichael Elkin. 757-770 [doi]
• Exponential separations in the energy complexity of leader electionYi-Jun Chang, Tsvi Kopelowitz, Seth Pettie, Ruosong Wang, Wei Zhan. 771-783 [doi]
• On the complexity of local distributed graph problemsMohsen Ghaffari, Fabian Kuhn, Yannic Maus. 784-797 [doi]
• Efficient massively parallel methods for dynamic programmingSungjin Im, Benjamin Moseley, Xiaorui Sun. 798-811 [doi]
• Complexity of short Presburger arithmeticDanny Nguyen, Igor Pak. 812-820 [doi]
• Linear matroid intersection is in quasi-NCRohit Gurjar, Thomas Thierauf. 821-830 [doi]
• Randomized polynomial time identity testing for noncommutative circuitsVikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja. 831-841 [doi]
• Holographic algorithm with matchgates is universal for planar #CSP over boolean domainJin-yi Cai, Zhiguo Fu. 842-855 [doi]
• Efficient empirical revenue maximization in single-parameter auction environmentsYannai A. Gonczarowski, Noam Nisan. 856-868 [doi]
• The menu-size complexity of revenue approximationMoshe Babaioff, Yannai A. Gonczarowski, Noam Nisan. 869-877 [doi]
• Communication complexity of approximate Nash equilibriaYakov Babichenko, Aviad Rubinstein. 878-889 [doi]
• Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibriaJugal Garg, Ruta Mehta, Vijay V. Vazirani, Sadra Yazdanbod. 890-901 [doi]
• Approximate near neighbors for general symmetric normsAlexandr Andoni, Huy L. Nguyen, Aleksandar Nikolov, Ilya P. Razenshteyn, Erik Waingarten. 902-913 [doi]
• Algorithmic discrepancy beyond partial coloringNikhil Bansal, Shashwat Garg. 914-926 [doi]
• Geodesic walks in polytopesYin Tat Lee, Santosh Srinivas Vempala. 927-940 [doi]
• A reverse Minkowski theoremOded Regev 0001, Noah Stephens-Davidowitz. 941-953 [doi]
• Almost-polynomial ratio ETH-hardness of approximating densest k-subgraphPasin Manurangsi. 954-961 [doi]
• Efficient quantum tomography IIRyan O'Donnell, John Wright. 962-974 [doi]
• Quantum entanglement, sum of squares, and the log rank conjectureBoaz Barak, Pravesh K. Kothari, David Steurer. 975-988 [doi]
• Quantum algorithm for tree size estimation, with applications to backtracking and 2-player gamesAndris Ambainis, Martins Kokainis. 989-1002 [doi]
• A quantum linearity test for robustly verifying entanglementAnand Natarajan, Thomas Vidick. 1003-1015 [doi]
• The limitations of optimization from samplesEric Balkanski, Aviad Rubinstein, Yaron Singer. 1016-1027 [doi]
• Approximate modularity revisitedUriel Feige, Michal Feldman, Inbal Talgam-Cohen. 1028-1041 [doi]
• 1/3)) samplesFedor Nazarov, Yuval Peres. 1042-1046 [doi]
• Optimal mean-based algorithms for trace reconstructionAnindya De, Ryan O'Donnell, Rocco A. Servedio. 1047-1056 [doi]
• Provable learning of noisy-OR networksSanjeev Arora, Rong Ge 0001, Tengyu Ma, Andrej Risteski. 1057-1066 [doi]
• Time-space hardness of learning sparse paritiesGillat Kol, Ran Raz, Avishay Tal. 1067-1080 [doi]
• DecreaseKeys are expensive for external memory priority queuesKasper Eenberg, Kasper Green Larsen, Huacheng Yu. 1081-1093 [doi]
• Set similarity search beyond MinHashTobias Christiani, Rasmus Pagh. 1094-1107 [doi]
• Decremental single-source reachability in planar digraphsGiuseppe F. Italiano, Adam Karczmarz, Jakub Lacki, Piotr Sankowski. 1108-1121 [doi]
• 1/2 - ε)-timeDanupon Nanongkai, Thatchaphol Saranurak. 1122-1129 [doi]
• Fully-dynamic minimum spanning forest with improved worst-case update timeChristian Wulff-Nilsen. 1130-1143 [doi]
• Improved non-malleable extractors, non-malleable codes and independent source extractorsXin Li. 1144-1156 [doi]
• Towards optimal two-source extractors and Ramsey graphsGil Cohen. 1157-1170 [doi]
• Non-malleable codes and extractors for small-depth circuits, and affine functionsEshan Chattopadhyay, Xin Li 0006. 1171-1184 [doi]
• An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropyAvraham Ben-Aroya, Dean Doron, Amnon Ta-Shma. 1185-1194 [doi]
• Finding approximate local minima faster than gradient descentNaman Agarwal, Zeyuan Allen Zhu, Brian Bullins, Elad Hazan, Tengyu Ma. 1195-1199 [doi]
• Katyusha: the first direct acceleration of stochastic gradient methodsZeyuan Allen Zhu. 1200-1205 [doi]
• A strongly polynomial algorithm for bimodular integer linear programmingStephan Artmann, Robert Weismantel, Rico Zenklusen. 1206-1219 [doi]
• Subquadratic submodular function minimizationDeeparnab Chakrabarty, Yin Tat Lee, Aaron Sidford, Sam Chiu-wai Wong. 1220-1231 [doi]
• Addition is exponentially harder than counting for shallow monotone circuitsXi Chen, Igor Carboni Oliveira, Rocco A. Servedio. 1232-1245 [doi]
• Strongly exponential lower bounds for monotone computationToniann Pitassi, Robert Robere. 1246-1255 [doi]
• Formula lower bounds via the quantum methodAvishay Tal. 1256-1268 [doi]