LIPIcs, Volume 45, FSTTCS 2015

• Prahladh Harsha and G. Ramalingam LIPIcs, Volume 45, FSTTCS'15, Complete Volume 10.4230/LIPIcs.FSTTCS.2015
• Prahladh Harsha and G. Ramalingam Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2015.i
• Moses S. Charikar Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk) 10.4230/LIPIcs.FSTTCS.2015.1
• Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk) 10.4230/LIPIcs.FSTTCS.2015.2
• James Worrell Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk) 10.4230/LIPIcs.FSTTCS.2015.5
• Boaz Barak Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk) 10.4230/LIPIcs.FSTTCS.2015.7
• Ankur Moitra Beyond Matrix Completion (Invited Talk) 10.4230/LIPIcs.FSTTCS.2015.8
• Suresh Jagannathan Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk) 10.4230/LIPIcs.FSTTCS.2015.9
• Keshav Goyal and Tobias Mömke Robust Reoptimization of Steiner Trees 10.4230/LIPIcs.FSTTCS.2015.10
• Anamitra Roy Choudhury, Syamantak Das, and Amit Kumar Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model 10.4230/LIPIcs.FSTTCS.2015.25
• Hal Daumé III, Samir Khuller, Manish Purohit, and Gregory Sanders On Correcting Inputs: Inverse Optimization for Online Structured Prediction 10.4230/LIPIcs.FSTTCS.2015.38
• Sepehr Assadi, Sanjeev Khanna, Yang Li, and Val Tannen Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches 10.4230/LIPIcs.FSTTCS.2015.52
• Patricia Bouyer, Patrick Gardy, and Nicolas Markey Weighted Strategy Logic with Boolean Goals Over One-Counter Games 10.4230/LIPIcs.FSTTCS.2015.69
• Prateek Karandikar and Philippe Schnoebelen Decidability in the Logic of Subsequences and Supersequences 10.4230/LIPIcs.FSTTCS.2015.84
• Thomas Colcombet and Amaldev Manuel Fragments of Fixpoint Logic on Data Words 10.4230/LIPIcs.FSTTCS.2015.98
• Lukas Fleischer and Manfred Kufleitner Efficient Algorithms for Morphisms over Omega-Regular Languages 10.4230/LIPIcs.FSTTCS.2015.112
• Ashish Chiplunkar and Sundar Vishwanathan Approximating the Regular Graphic TSP in Near Linear Time 10.4230/LIPIcs.FSTTCS.2015.125
• Arindam Khan and Mohit Singh On Weighted Bipartite Edge Coloring 10.4230/LIPIcs.FSTTCS.2015.136
• Karthekeyan Chandrasekaran, Venkata Gandikota, and Elena Grigorescu Deciding Orthogonality in Construction-A Lattices 10.4230/LIPIcs.FSTTCS.2015.151
• Lorenzo Clemente, Pawel Parys, Sylvain Salvati, and Igor Walukiewicz Ordered Tree-Pushdown Systems 10.4230/LIPIcs.FSTTCS.2015.163
• Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis One-way Definability of Sweeping Transducer 10.4230/LIPIcs.FSTTCS.2015.178
• Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, and Mehdi Seyed Salehi What's Decidable about Availability Languages? 10.4230/LIPIcs.FSTTCS.2015.192
• Sagnik Mukhopadhyay and Swagato Sanyal Towards Better Separation between Deterministic and Randomized Query Complexity 10.4230/LIPIcs.FSTTCS.2015.206
• Manindra Agrawal, Diptarka Chakraborty, Debarati Das, and Satyadev Nandakumar Dimension, Pseudorandomness and Extraction of Pseudorandomness 10.4230/LIPIcs.FSTTCS.2015.221
• John M. Hitchcock and A. Pavan On the NP-Completeness of the Minimum Circuit Size Problem 10.4230/LIPIcs.FSTTCS.2015.236
• Nikhil Balaji, Samir Datta, and Venkatesh Ganesan Counting Euler Tours in Undirected Bounded Treewidth Graphs 10.4230/LIPIcs.FSTTCS.2015.246
• Shibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, and Ashutosh Trivedi Revisiting Robustness in Priced Timed Games 10.4230/LIPIcs.FSTTCS.2015.261
• Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege Simple Priced Timed Games are not That Simple 10.4230/LIPIcs.FSTTCS.2015.278
• Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, and Gabriel Renault Quantitative Games under Failures 10.4230/LIPIcs.FSTTCS.2015.293
• Dietmar Berwanger and Marie van den Bogaard Games with Delays - A Frankenstein Approach 10.4230/LIPIcs.FSTTCS.2015.307
• Sudip Biswas, Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan Forbidden Extension Queries 10.4230/LIPIcs.FSTTCS.2015.320
• Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, and Sandeep Sen On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model 10.4230/LIPIcs.FSTTCS.2015.336
• Vladimir Braverman, Harry Lang, Keith Levin, and Morteza Monemizadeh Clustering on Sliding Windows in Polylogarithmic Space 10.4230/LIPIcs.FSTTCS.2015.350
• Guy Avni, Orna Kupferman, and Tami Tamir Congestion Games with Multisets of Resources and Applications in Synthesis 10.4230/LIPIcs.FSTTCS.2015.365
• Shaull Almagor, Denis Kuperberg, and Orna Kupferman The Sensing Cost of Monitoring and Synthesis 10.4230/LIPIcs.FSTTCS.2015.380
• David Cachera, Uli Fahrenberg, and Axel Legay An omega-Algebra for Real-Time Energy Problems 10.4230/LIPIcs.FSTTCS.2015.394
• Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, and Alexander S. Kulikov Parameterized Complexity of Secluded Connectivity Problems 10.4230/LIPIcs.FSTTCS.2015.408
• Sudeshna Kolay and Fahad Panolan Parameterized Algorithms for Deletion to (r,ell)-Graphs 10.4230/LIPIcs.FSTTCS.2015.420
• Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, and Saket Saurabh Finding Even Subgraphs Even Faster 10.4230/LIPIcs.FSTTCS.2015.434
• Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, and Manuel Sorge The Parameterized Complexity of the Minimum Shared Edges Problem 10.4230/LIPIcs.FSTTCS.2015.448
• Daniel J. Fremont, Alexandre Donzé, Sanjit A. Seshia, and David Wessel Control Improvisation 10.4230/LIPIcs.FSTTCS.2015.463
• Chung-Kil Hur, Aditya V. Nori, Sriram K. Rajamani, and Selva Samuel A Provably Correct Sampler for Probabilistic Programs 10.4230/LIPIcs.FSTTCS.2015.475
• Henryk Michalewski and Matteo Mio On the Problem of Computing the Probability of Regular Sets of Trees 10.4230/LIPIcs.FSTTCS.2015.489
• Thomas Weidner Probabilistic Regular Expressions and MSO Logic on Finite Trees 10.4230/LIPIcs.FSTTCS.2015.503
• Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, and Ravi Sundaram Rumors Across Radio, Wireless, Telephone 10.4230/LIPIcs.FSTTCS.2015.517
• Magnús M. Halldórsson and Tigran Tonoyan The Price of Local Power Control in Wireless Scheduling 10.4230/LIPIcs.FSTTCS.2015.529
• Leonard J. Schulman and Vijay V. Vazirani Allocation of Divisible Goods Under Lexicographic Preferences 10.4230/LIPIcs.FSTTCS.2015.543
• Romain Demangeon and Nobuko Yoshida On the Expressiveness of Multiparty Sessions 10.4230/LIPIcs.FSTTCS.2015.560
• Vincent Cheval, Véronique Cortier, and Eric le Morvan Secure Refinements of Communication Channels 10.4230/LIPIcs.FSTTCS.2015.575
• David Basin, Felix Klaedtke, and Eugen Zalinescu Failure-aware Runtime Verification of Distributed Systems 10.4230/LIPIcs.FSTTCS.2015.590