Abstract is missing.
- Front Matter, Table of Contents, Preface, Conference Organization [doi]
- Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk)Moses Samson Charikar. 1 [doi]
- Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk)Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza. 2-4 [doi]
- Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk)James Worrell. 5-6 [doi]
- Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk)Boaz Barak. 7-7 [doi]
- Beyond Matrix Completion (Invited Talk)Ankur Moitra. 8-8 [doi]
- Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk)Suresh Jagannathan. 9-9 [doi]
- Robust Reoptimization of Steiner TreesKeshav Goyal, Tobias Mömke. 10-24 [doi]
- Minimizing Weighted lp-Norm of Flow-Time in the Rejection ModelAnamitra Roy Choudhury, Syamantak Das, Amit Kumar 0001. 25-37 [doi]
- On Correcting Inputs: Inverse Optimization for Online Structured PredictionHal Daumé III, Samir Khuller, Manish Purohit, Gregory Sanders. 38-51 [doi]
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving SketchesSepehr Assadi, Sanjeev Khanna, Yang Li, Val Tannen. 52-68 [doi]
- Weighted Strategy Logic with Boolean Goals Over One-Counter GamesPatricia Bouyer, Patrick Gardy, Nicolas Markey. 69-83 [doi]
- Decidability in the Logic of Subsequences and SupersequencesPrateek Karandikar, Philippe Schnoebelen. 84-97 [doi]
- Fragments of Fixpoint Logic on Data WordsThomas Colcombet, Amaldev Manuel. 98-111 [doi]
- Efficient Algorithms for Morphisms over Omega-Regular LanguagesLukas Fleischer, Manfred Kufleitner. 112-124 [doi]
- Approximating the Regular Graphic TSP in Near Linear TimeAshish Chiplunkar, Sundar Vishwanathan. 125-135 [doi]
- On Weighted Bipartite Edge ColoringArindam Khan, Mohit Singh. 136-150 [doi]
- Deciding Orthogonality in Construction-A LatticesKarthekeyan Chandrasekaran, Venkata Gandikota, Elena Grigorescu. 151-162 [doi]
- Ordered Tree-Pushdown SystemsLorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz. 163-177 [doi]
- One-way Definability of Sweeping TransducerFélix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. 178-191 [doi]
- What's Decidable about Availability Languages?Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, Mehdi Seyed Salehi. 192-205 [doi]
- Towards Better Separation between Deterministic and Randomized Query ComplexitySagnik Mukhopadhyay, Swagato Sanyal. 206-220 [doi]
- Dimension, Pseudorandomness and Extraction of PseudorandomnessManindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar. 221-235 [doi]
- On the NP-Completeness of the Minimum Circuit Size ProblemJohn M. Hitchcock, Aduri Pavan. 236-245 [doi]
- Counting Euler Tours in Undirected Bounded Treewidth GraphsNikhil Balaji, Samir Datta, Venkatesh Ganesan. 246-260 [doi]
- Revisiting Robustness in Priced Timed GamesShibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi. 261-277 [doi]
- Simple Priced Timed Games are not That SimpleThomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege. 278-292 [doi]
- Quantitative Games under FailuresThomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, Gabriel Renault. 293-306 [doi]
- Games with Delays - A Frankenstein ApproachDietmar Berwanger, Marie van den Bogaard. 307-319 [doi]
- Forbidden Extension QueriesSudip Biswas, Arnab Ganguly 0002, Rahul Shah, Sharma V. Thankachan. 320-335 [doi]
- On Density, Threshold and Emptiness Queries for Intervals in the Streaming ModelArijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, Sandeep Sen. 336-349 [doi]
- Clustering on Sliding Windows in Polylogarithmic SpaceVladimir Braverman, Harry Lang, Keith Levin, Morteza Monemizadeh. 350-364 [doi]
- Congestion Games with Multisets of Resources and Applications in SynthesisGuy Avni, Orna Kupferman, Tami Tamir. 365-379 [doi]
- The Sensing Cost of Monitoring and SynthesisShaull Almagor, Denis Kuperberg, Orna Kupferman. 380-393 [doi]
- An omega-Algebra for Real-Time Energy ProblemsDavid Cachera, Uli Fahrenberg, Axel Legay. 394-407 [doi]
- Parameterized Complexity of Secluded Connectivity ProblemsFedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov. 408-419 [doi]
- Parameterized Algorithms for Deletion to (r, ell)-GraphsSudeshna Kolay, Fahad Panolan. 420-433 [doi]
- Finding Even Subgraphs Even FasterPrachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh. 434-447 [doi]
- The Parameterized Complexity of the Minimum Shared Edges ProblemTill Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge. 448-462 [doi]
- Control ImprovisationDaniel J. Fremont, Alexandre Donzé, Sanjit A. Seshia, David Wessel. 463-474 [doi]
- A Provably Correct Sampler for Probabilistic ProgramsChung-Kil Hur, Aditya V. Nori, Sriram K. Rajamani, Selva Samuel. 475-488 [doi]
- On the Problem of Computing the Probability of Regular Sets of TreesHenryk Michalewski, Matteo Mio. 489-502 [doi]
- Probabilistic Regular Expressions and MSO Logic on Finite TreesThomas Weidner. 503-516 [doi]
- Rumors Across Radio, Wireless, TelephoneJennifer Iglesias, Rajmohan Rajaraman, R. Ravi 0001, Ravi Sundaram. 517-528 [doi]
- The Price of Local Power Control in Wireless SchedulingMagnús M. Halldórsson, Tigran Tonoyan. 529-542 [doi]
- Allocation of Divisible Goods Under Lexicographic PreferencesLeonard J. Schulman, Vijay V. Vazirani. 543-559 [doi]
- On the Expressiveness of Multiparty SessionsRomain Demangeon, Nobuko Yoshida. 560-574 [doi]
- Secure Refinements of Communication ChannelsVincent Cheval, Véronique Cortier, Eric le Morvan. 575-589 [doi]
- Failure-aware Runtime Verification of Distributed SystemsDavid A. Basin, Felix Klaedtke, Eugen Zalinescu. 590-603 [doi]