Table of Contents

• Non-Adaptive Data Structure Bounds for Dynamic PredecessorJoseph Boninger, Joshua Brody, Owen Kephart. [doi]
• A Lifting Theorem with Applications to Symmetric FunctionsArkadev Chattopadhyay, Nikhil S. Mande. [doi]
• Popular Matchings with Lower QuotasMeghana Nasre, Prajakta Nimbhorkar. [doi]
• Symmetric SynthesisRüdiger Ehlers, Bernd Finkbeiner. [doi]
• How Deterministic are Good-For-Games Automata?Udi Boker, Orna Kupferman, Michal Skrzypczak. [doi]
• Finding Pseudorandom Colorings of Pseudorandom GraphsAkash Kumar, Anand Louis, Madhur Tulsiani. [doi]
• Verification of Asynchronous Programs with Nested LocksMohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan. [doi]
• Some Open Problems in Information-Theoretic CryptographyVinod Vaikuntanathan. [doi]
• Flow GamesOrna Kupferman, Gal Vardi, Moshe Y. Vardi. [doi]
• On Hashing-Based Approaches to Approximate DNF-CountingKuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi. [doi]
• Backward Deterministic Büchi Automata on Infinite WordsThomas Wilke. [doi]
• A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)Prateek Jain 0002, Sham M. Kakade, Rahul Kidambi, Praneeth Netrapalli, Venkata Krishna Pillutla, Aaron Sidford. [doi]
• Approximation Algorithms for Stochastic k-TSPAlina Ene, Viswanath Nagarajan, Rishi Saket. [doi]
• Balanced Judicious Bipartition is Fixed-Parameter TractableDaniel Lokshtanov, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi. [doi]
• Modulo Counting on Words and TreesBartosz Bednarczyk, Witold Charatonik. [doi]
• A Unified Method for Placing Problems in Polylogarithmic DepthAndreas Krebs, Nutan Limaye, Michael Ludwig. [doi]
• VLDL Satisfiability and Model Checking via Tree AutomataAlexander Weinert. [doi]
• On the Parameterized Complexity of Simultaneous Deletion ProblemsAkanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad, M. S. Ramanujan. [doi]
• A Dichotomy Theorem for the Inverse Satisfiability ProblemVictor Lagerkvist, Biman Roy. [doi]
• Streaming for Aibohphobes: Longest Palindrome with MismatchesElena Grigorescu, Erfan Sadeqi Azer, Samson Zhou. [doi]
• Popular Matchings with Multiple PartnersFlorian Brandl, Telikepalli Kavitha. [doi]
• Synthesis in Distributed EnvironmentsBernd Finkbeiner, Paul Gölz. [doi]
• An Improved Dictatorship Test with Perfect CompletenessAmey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari. [doi]
• Network Construction with Ordered ConstraintsYi Huang, Mano Vikash Janardhanan, Lev Reyzin. [doi]
• Train Scheduling on a Unidirectional PathApoorv Garg, Abhiram G. Ranade. [doi]
• Hardness of Rainbow Coloring HypergraphsVenkatesan Guruswami, Rishi Saket. [doi]
• Local PatternsJoel D. Day, Pamela Fleischmann, Florin Manea, Dirk Nowotka. [doi]
• Querying Best Paths in Graph DatabasesJakub Michaliszyn, Jan Otop, Piotr Wieczorek. [doi]
• Average Stack Cost of Büchi Pushdown AutomataJakub Michaliszyn, Jan Otop. [doi]
• Maintaining Reeb Graphs of Triangulated 2-ManifoldsPankaj K. Agarwal, Kyle Fox, Abhinandan Nath. [doi]
• Complexity of Model Checking MDPs against LTL SpecificationsDileep Kini, Mahesh Viswanathan 0001. [doi]
• A Composition Theorem for Randomized Query ComplexityAnurag Anshu, Dmitry Gavinsky, Rahul Jain 0001, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal. [doi]
• The Complexity of the Diagonal Problem for Recursion SchemesPawel Parys. [doi]
• Monitoring for Silent ActionsLuca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir. [doi]
• Reasons for Hardness in QBF Proof SystemsOlaf Beyersdorff, Luke Hinde, Ján Pich. [doi]
• On Symbolic Heaps Modulo Permission TheoriesStéphane Demri, Étienne Lozes, Denis Lugiez. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• On the Control of Asynchronous AutomataHugo Gimbert. [doi]
• Vertex Deletion Problems on Chordal GraphsYixin Cao 0001, Yuping Ke, Yota Otachi, Jie You. [doi]
• Probabilistic Disclosure: Maximisation vs. MinimisationBéatrice Bérard, Serge Haddad, Engel Lefaucheux. [doi]
• Automated Synthesis: a Distributed ViewpointAnca Muscholl. [doi]
• On Colourability of Polygon Visibility GraphsOnur Cagirici, Petr Hlinený, Bodhayan Roy. [doi]
• Matrix Estimation, Latent Variable Model and Collaborative FilteringDevavrat Shah. [doi]
• Justified Representation in Multiwinner Voting: Axioms and AlgorithmsEdith Elkind. [doi]
• Forward Analysis for WSTS, Part III: Karp-Miller TreesMichael Blondin, Alain Finkel, Jean Goubault-Larrecq. [doi]
• A Combinatorial Proof of Ihara-Bass's Formula for the Zeta Function of Regular GraphsBharatram Rangarajan. [doi]
• Rabin vs. Streett AutomataUdi Boker. [doi]
• Understanding the Correlation Gap For MatchingsGuru Guruganesh, Euiwoong Lee. [doi]