LIPIcs, Volume 13, FSTTCS 2011

Supratik Chakraborty and Amit Kumar LIPIcs, Volume 13, FSTTCS'11, Complete Volume 10.4230/LIPIcs.FSTTCS.2011
Supratik Chakraborty and Amit Kumar Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers 10.4230/LIPIcs.FSTTCS.2011.i
Supratik Chakraborty and Amit Kumar Author Index 10.4230/LIPIcs.FSTTCS.2011.xvi
Susanne Albers Energy-Efficient Algorithms (Invited Talk) 10.4230/LIPIcs.FSTTCS.2011.1
Moshe Y. Vardi Constraints, Graphs, Algebra, Logic, and Complexity (Invited Talk) 10.4230/LIPIcs.FSTTCS.2011.3
Madhu Sudan Physical limits of Communication (Invited Talk) 10.4230/LIPIcs.FSTTCS.2011.4
Alex Bain, John Mitchell, Rahul Sharma, Deian Stefan, and Joe Zimmerman A Domain-Specific Language for Computing on Encrypted Data (Invited Talk) 10.4230/LIPIcs.FSTTCS.2011.6
Phokion G. Kolaitis Schema Mappings and Data Examples: Deriving Syntax from Semantics (Invited Talk) 10.4230/LIPIcs.FSTTCS.2011.25
Umesh V. Vazirani Quantum State Description Complexity (Invited Talk) 10.4230/LIPIcs.FSTTCS.2011.26
Marek Cygan, Fabrizio Grandoni, Stefano Leonardi, Marcin Mucha, Marcin Pilipczuk, and Piotr Sankowski Approximation Algorithms for Union and Intersection Covering Problems 10.4230/LIPIcs.FSTTCS.2011.28
Siavosh Benabbas, Siu On Chan, Konstantinos Georgiou, and Avner Magen Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy 10.4230/LIPIcs.FSTTCS.2011.41
Christian Glaßer, Christian Reitwießner, and Maximilian Witek Applications of Discrepancy Theory in Multiobjective Approximation 10.4230/LIPIcs.FSTTCS.2011.55
Denis Kuperberg and Michael Vanden Boom Quasi-Weak Cost Automata: A New Variant of Weakness 10.4230/LIPIcs.FSTTCS.2011.66
Frédéric Herbreteau, Dileep Kini, B. Srivathsan, and Igor Walukiewicz Using non-convex approximations for efficient analysis of timed automata 10.4230/LIPIcs.FSTTCS.2011.78
Ocan Sankur, Patricia Bouyer, and Nicolas Markey Shrinking Timed Automata 10.4230/LIPIcs.FSTTCS.2011.90
Uli Fahrenberg, Axel Legay, and Claus Thrane The Quantitative Linear-Time--Branching-Time Spectrum 10.4230/LIPIcs.FSTTCS.2011.103
Raghavendra Rao B .V. and Jayalal Sarma M. N. Isomorphism testing of read-once functions and polynomials 10.4230/LIPIcs.FSTTCS.2011.115
Bruno Grenet, Pascal Koiran, Natacha Portier, and Yann Strozecki The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent 10.4230/LIPIcs.FSTTCS.2011.127
Philippe Darondeau, Stéphane Demri, Roland Meyer, and Christophe Morvan Petri Net Reachability Graphs: Decidability Status of FO Properties 10.4230/LIPIcs.FSTTCS.2011.140
Mohamed Faouzi Atig and Pierre Ganty Approximating Petri Net Reachability Along Context-free Traces 10.4230/LIPIcs.FSTTCS.2011.152
Fedor V. Fomin, Geevarghese Philip, and Yngve Villanger Minimum Fill-in of Sparse Graphs: Kernelization and Approximation 10.4230/LIPIcs.FSTTCS.2011.164
Abhijin Adiga, L. Sunil Chandran, and Rogers Mathew Cubicity, Degeneracy, and Crossing Number 10.4230/LIPIcs.FSTTCS.2011.176
H. J. Sander Bruggink, Raphaël Cauderlier, Mathias Hülsbusch, and Barbara König Conditional Reactive Systems 10.4230/LIPIcs.FSTTCS.2011.191
Céline Chevalier, Stéphanie Delaune, and Steve Kremer Transforming Password Protocols to Compose 10.4230/LIPIcs.FSTTCS.2011.204
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, and Christophe Paul Obtaining a Bipartite Graph by Contracting Few Edges 10.4230/LIPIcs.FSTTCS.2011.217
Robert Crowston, Michael Fellows, Gregory Gutin, Mark Jones, Frances Rosamond, Stéphan Thomassé, and Anders Yeo Simultaneously Satisfying Linear Equations Over F_2: MaxLin2 and Max-r-Lin2 Parameterized Above Average 10.4230/LIPIcs.FSTTCS.2011.229
Prabhanjan Ananth, Meghana Nasre, and Kanthi K. Sarpatwar Rainbow Connectivity: Hardness and Tractability 10.4230/LIPIcs.FSTTCS.2011.241
Arnaud Durand, Johannes Ebbing, Juha Kontinen, and Heribert Vollmer Dependence logic with a majority quantifier 10.4230/LIPIcs.FSTTCS.2011.252
Emanuel Kieronski, Jakub Michaliszyn, and Jan Otop Modal Logics Definable by Universal Three-Variable Formulas 10.4230/LIPIcs.FSTTCS.2011.264
Stefan Göller and Markus Lohrey The First-Order Theory of Ground Tree Rewrite Graphs 10.4230/LIPIcs.FSTTCS.2011.276
Bertram Felgenhauer, Harald Zankl, and Aart Middeldorp Layer Systems for Proving Confluence 10.4230/LIPIcs.FSTTCS.2011.288
Aleksander Madry and Debmalya Panigrahi The Semi-stochastic Ski-rental Problem 10.4230/LIPIcs.FSTTCS.2011.300
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais Streamability of Nested Word Transductions 10.4230/LIPIcs.FSTTCS.2011.312
Manoj Gupta, Yogish Sabharwal, and Sandeep Sen The update complexity of selection and related problems 10.4230/LIPIcs.FSTTCS.2011.325
Yang Cai and Ting Zhang A Tight Lower Bound for Streett Complementation 10.4230/LIPIcs.FSTTCS.2011.339
Pablo Barceló, Leonid Libkin, and Juan L. Reutter Parameterized Regular Expressions and Their Languages 10.4230/LIPIcs.FSTTCS.2011.351
Jacques Duparc, Alessandro Facchini, and Filip Murlak Definable Operations On Weakly Recognizable Sets of Trees 10.4230/LIPIcs.FSTTCS.2011.363
Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels Nash Equilibria in Concurrent Games with Büchi Objectives 10.4230/LIPIcs.FSTTCS.2011.375
Dietmar Berwanger, Lukasz Kaiser, and Bernd Puchala A Perfect-Information Construction for Coordination in Games 10.4230/LIPIcs.FSTTCS.2011.387
John Fearnley, Markus Rabe, Sven Schewe, and Lijun Zhang Efficient Approximation of Optimal Control for Continuous-Time Markov Games 10.4230/LIPIcs.FSTTCS.2011.399
Nathalie Bertrand and Blaise Genest Minimal Disclosure in Partially Observable Markov Decision Processes 10.4230/LIPIcs.FSTTCS.2011.411
Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, and Oren Weimann Optimal Packed String Matching 10.4230/LIPIcs.FSTTCS.2011.423
Saverio Caminiti, Irene Finocchi, Emanuele G. Fusco, and Francesco Silvestri Dynamic programming in faulty memory hierarchies (cache-obliviously) 10.4230/LIPIcs.FSTTCS.2011.433
Hongfei Fu and Joost-Pieter Katoen Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems 10.4230/LIPIcs.FSTTCS.2011.445
Matthew Hague Parameterised Pushdown Systems with Non-Atomic Writes 10.4230/LIPIcs.FSTTCS.2011.457
Didier Caucal and Teodor Knapik Higher order indexed monadic systems 10.4230/LIPIcs.FSTTCS.2011.469