Table of Contents

• Synthesizing Safe Coalition StrategiesNathalie Bertrand 0001, Patricia Bouyer, Anirban Majumdar 0002. [doi]
• Convex Optimization and Dynamic Data Structure (Invited Talk)Yin Tat Lee. [doi]
• Dynamic Network Congestion GamesNathalie Bertrand 0001, Nicolas Markey, Suman Sadhukhan, Ocan Sankur. [doi]
• Constructing Large Matchings via Query Access to a Maximal Matching OracleLidiya Khalidah binti Khalil, Christian Konrad. [doi]
• Weighted Tiling Systems for Graphs: Evaluation ComplexityC. Aiswarya, Paul Gastin. [doi]
• Algorithmic Improvisation for Dependable Intelligent Autonomy (Invited Talk)Sanjit A. Seshia. [doi]
• On the (Parameterized) Complexity of Almost Stable MarriageSushmita Gupta, Pallavi Jain 0001, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Synchronization Under Dynamic ConstraintsPetra Wolf 0002. [doi]
• Equivalence of Hidden Markov Models with Continuous ObservationsOscar Darwin, Stefan Kiefer. [doi]
• Locally Decodable/Correctable Codes for Insertions and DeletionsAlexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu. [doi]
• Synthesis from Weighted Specifications with Partial Domains over Finite WordsEmmanuel Filiot, Christof Löding, Sarah Winter. [doi]
• Maximum Clique in Disk-Like Intersection GraphsÉdouard Bonnet, Nicolas Grelier, Tillmann Miltzow. [doi]
• Randomness Efficient Noise Stability and Generalized Small Bias SetsDana Moshkovitz, Justin Oh, David Zuckerman. [doi]
• Active Prediction for Discrete Event SystemsStefan Haar, Serge Haddad, Stefan Schwoon, Lina Ye. [doi]
• On the Succinctness of Alternating Parity Good-For-Games AutomataUdi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak. [doi]
• Size Bounds on Low Depth Circuits for Promise MajorityJoshua Cook. [doi]
• Holonomic Techniques, Periods, and Decision Problems (Invited Talk)Joël Ouaknine. [doi]
• Comparing Labelled Markov Decision ProcessesStefan Kiefer, Qiyi Tang 0001. [doi]
• Min-Cost Popular MatchingsTelikepalli Kavitha. [doi]
• What You Must Remember When Transforming DatawordsM. Praveen. [doi]
• Parameterized Complexity of Safety of Threshold AutomataA. R. Balasubramanian. [doi]
• Width Notions for Ordering-Related ProblemsEmmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf 0002. [doi]
• Fair Tree Connection Games with Topology-Dependent Edge CostDavide Bilò, Tobias Friedrich 0001, Pascal Lenzner, Anna Melnichenko, Louise Molitor. [doi]
• Proofs of Soundness and Proof Search (Invited Talk)Albert Atserias. [doi]
• Parameterized Complexity of Feedback Vertex Sets on HypergraphsPratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001. [doi]
• Process Symmetry in Probabilistic TransducersShaull Almagor. [doi]
• Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two RoundsKarthik Gajulapalli, James A. Liu, Tung Mai, Vijay V. Vazirani. [doi]
• Perspective Games with NotificationsOrna Kupferman, Noam Shenwald. [doi]
• Fully Dynamic Sequential and Distributed Algorithms for MAX-CUTOmer Wasim, Valerie King. [doi]
• Minimising Good-For-Games Automata Is NP-CompleteSven Schewe. [doi]
• Synchronization of Deterministic Visibly Push-Down AutomataHenning Fernau, Petra Wolf 0002. [doi]
• Higher-Order Nonemptiness Step by StepPawel Parys. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• Online Carpooling Using Expander DecompositionsAnupam Gupta, Ravishankar Krishnaswamy, Amit Kumar 0001, Sahil Singla 0001. [doi]
• Reachability for Updatable Timed Automata Made Faster and More EffectivePaul Gastin, Sayan Mukherjee 0002, B. Srivathsan. [doi]
• Reachability in Dynamical Systems with RoundingChristel Baier, Florian Funke 0002, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland. [doi]
• On Some Recent Advances in Algebraic Complexity (Invited Talk)Amir Shpilka. [doi]
• On Parity Decision Trees for Fourier-Sparse Boolean FunctionsNikhil S. Mande, Swagato Sanyal. [doi]
• Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC ModelKishore Kothapalli, Shreyas Pai, Sriram V. Pemmaraju. [doi]
• Connectivity Lower Bounds in Broadcast Congested CliqueShreyas Pai, Sriram V. Pemmaraju. [doi]
• Lower Bounds for Semi-adaptive Data Structures via CorruptionPavel Dvorák, Bruno Loff. [doi]
• Online Matching with Recourse: Random Edge ArrivalsAaron Bernstein, Aditi Dudeja. [doi]
• Faster Property Testers in a Variation of the Bounded Degree ModelIsolde Adler, Polly Fahey. [doi]
• Static Race Detection for RTOS ApplicationsRishi Tulsyan, Rekha Pai, Deepak D'Souza. [doi]
• Planted Models for the Densest k-Subgraph ProblemYash Khanna, Anand Louis. [doi]
• A Framework for Consistency AlgorithmsPeter Chini, Prakash Saivasan. [doi]
• On the Complexity of Multi-Pushdown GamesRoland Meyer 0001, Sören van der Wall. [doi]
• The Quest for Mathematical Understanding of Deep Learning (Invited Talk)Sanjeev Arora. [doi]
• Computable Analysis for Verified Exact Real ComputationMichal Konecný, Florian Steinberg 0001, Holger Thies. [doi]
• Colored Cut GamesNils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer. [doi]
• Optimal Output Sensitive Fault Tolerant CutsNiranka Banerjee, Venkatesh Raman 0001, Saket Saurabh 0001. [doi]
• Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian NetworksRebecca Bernemann, Benjamin Cabrera, Reiko Heckel, Barbara König 0001. [doi]
• Hard QBFs for Merge ResolutionOlaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood. [doi]
• The Degree of a Finite Set of WordsDominique Perrin, Andrew Ryzhikov. [doi]
• Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite WordsManfred Droste, Sven Dziadek, Werner Kuich. [doi]
• String Indexing for Top-k Close Consecutive OccurrencesPhilip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner. [doi]
• New Verification Schemes for Frequency-Based Functions on Data StreamsPrantar Ghosh. [doi]
• Clustering Under Perturbation Stability in Near-Linear TimePankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor 0002, Emo Welzl. [doi]
• On Sampling Based Algorithms for k-MeansAnup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar 0001. [doi]