Table of Contents

• Frontmatter, Table of Contents, Preface, Conference Organization, External ReviewersSupratik Chakraborty, Amit Kumar. [doi]
• Author Index [doi]
• Energy-Efficient Algorithms (Invited Talk)Susanne Albers. 1-2 [doi]
• Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk)Moshe Y. Vardi. 3-3 [doi]
• Physical limits of Communication (Invited Talk)Madhu Sudan. 4-5 [doi]
• A Domain-Specific Language for Computing on Encrypted Data (Invited Talk)Alex Bain, John C. Mitchell, Rahul Sharma 0001, Deian Stefan, Joe Zimmerman. 6-24 [doi]
• Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk)Phokion G. Kolaitis. 25-25 [doi]
• Quantum State Description Complexity (Invited Talk)Umesh V. Vazirani. 26-27 [doi]
• Approximation Algorithms for Union and Intersection Covering ProblemsMarek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski. 28-40 [doi]
• Tight Gaps for Vertex Cover in the Sherali-Adams SDP HierarchySiavosh Benabbas, Siu On Chan, Konstantinos Georgiou, Avner Magen. 41-54 [doi]
• Applications of Discrepancy Theory in Multiobjective ApproximationChristian Glaßer, Christian Reitwießner, Maximilian Witek. 55-65 [doi]
• Quasi-Weak Cost Automata: A New Variant of WeaknessDenis Kuperberg, Michael Vanden Boom. 66-77 [doi]
• Using non-convex approximations for efficient analysis of timed automataFrédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz. 78-89 [doi]
• Shrinking Timed AutomataOcan Sankur, Patricia Bouyer, Nicolas Markey. 90-102 [doi]
• The Quantitative Linear-Time--Branching-Time SpectrumUli Fahrenberg, Axel Legay, Claus R. Thrane. 103-114 [doi]
• Isomorphism testing of read-once functions and polynomialsB. V. Raghavendra Rao, Jayalal M. N. Sarma. 115-126 [doi]
• The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the PermanentBruno Grenet, Pascal Koiran, Natacha Portier, Yann Strozecki. 127-139 [doi]
• Petri Net Reachability Graphs: Decidability Status of FO PropertiesPhilippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan. 140-151 [doi]
• Approximating Petri Net Reachability Along Context-free TracesMohamed Faouzi Atig, Pierre Ganty. 152-163 [doi]
• Minimum Fill-in of Sparse Graphs: Kernelization and ApproximationFedor V. Fomin, Geevarghese Philip, Yngve Villanger. 164-175 [doi]
• Cubicity, Degeneracy, and Crossing NumberAbhijin Adiga, L. Sunil Chandran, Rogers Mathew. 176-190 [doi]
• Conditional Reactive SystemsHarrie Jan Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, Barbara König. 191-203 [doi]
• Transforming Password Protocols to ComposeCéline Chevalier, Stéphanie Delaune, Steve Kremer. 204-216 [doi]
• Obtaining a Bipartite Graph by Contracting Few EdgesPinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Christophe Paul. 217-228 [doi]
• Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above AverageRobert Crowston, Michael R. Fellows, Gregory Gutin, Mark Jones, Frances A. Rosamond, Stéphan Thomassé, Anders Yeo. 229-240 [doi]
• Rainbow Connectivity: Hardness and TractabilityPrabhanjan Ananth, Meghana Nasre, Kanthi K. Sarpatwar. 241-251 [doi]
• Dependence logic with a majority quantifierArnaud Durand, Johannes Ebbing, Juha Kontinen, Heribert Vollmer. 252-263 [doi]
• Modal Logics Definable by Universal Three-Variable FormulasEmanuel Kieronski, Jakub Michaliszyn, Jan Otop. 264-275 [doi]
• The First-Order Theory of Ground Tree Rewrite GraphsStefan Göller, Markus Lohrey. 276-287 [doi]
• Layer Systems for Proving ConfluenceBertram Felgenhauer, Harald Zankl, Aart Middeldorp. 288-299 [doi]
• The Semi-stochastic Ski-rental ProblemAleksander Madry, Debmalya Panigrahi. 300-311 [doi]
• Streamability of Nested Word TransductionsEmmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais. 312-324 [doi]
• The update complexity of selection and related problemsManoj Gupta, Yogish Sabharwal, Sandeep Sen. 325-338 [doi]
• A Tight Lower Bound for Streett ComplementationYang Cai, Ting Zhang. 339-350 [doi]
• Parameterized Regular Expressions and Their LanguagesPablo Barceló, Leonid Libkin, Juan L. Reutter. 351-362 [doi]
• Definable Operations On Weakly Recognizable Sets of TreesJacques Duparc, Alessandro Facchini, Filip Murlak. 363-374 [doi]
• Nash Equilibria in Concurrent Games with Büchi ObjectivesPatricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels. 375-386 [doi]
• A Perfect-Information Construction for Coordination in GamesDietmar Berwanger, Lukasz Kaiser, Bernd Puchala. 387-398 [doi]
• Efficient Approximation of Optimal Control for Continuous-Time Markov GamesJohn Fearnley, Markus Rabe 0002, Sven Schewe, Lijun Zhang 0001. 399-410 [doi]
• Minimal Disclosure in Partially Observable Markov Decision ProcessesNathalie Bertrand, Blaise Genest. 411-422 [doi]
• Optimal Packed String MatchingOren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann. 423-432 [doi]
• Dynamic programming in faulty memory hierarchies (cache-obliviously)Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, Francesco Silvestri. 433-444 [doi]
• Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State SystemsHongfei Fu, Joost-Pieter Katoen. 445-456 [doi]
• Parameterised Pushdown Systems with Non-Atomic WritesMatthew Hague. 457-468 [doi]
• Higher order indexed monadic systemsDidier Caucal, Teodor Knapik. 469-480 [doi]