LIPIcs, Volume 4, FSTTCS 2009

• Ravi Kannan and K. Narayan Kumar LIPIcs, Volume 4, FSTTCS'09, Complete Volume 10.4230/LIPIcs.FSTTCS.2009
• Ravi Kannan and K. Narayan Kumar Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009) 10.4230/LIPIcs.FSTTCS.2009.2341
• Parosh A. Abdulla, Yu-Fang Chen, Lukas Holik, and Tomas Vojnar Mediating for Reduction (on Minimizing Alternating Büchi Automata) 10.4230/LIPIcs.FSTTCS.2009.2302
• Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, and Richard J. Lipton Algorithms for Message Ferrying on Mobile ad hoc Networks 10.4230/LIPIcs.FSTTCS.2009.2303
• Vikraman Arvind, Pushkar S. Joglekar, and Srikanth Srinivasan Arithmetic Circuits and the Hadamard Product of Polynomials 10.4230/LIPIcs.FSTTCS.2009.2304
• Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, and Stéphan Thomassé Kernels for Feedback Arc Set In Tournaments 10.4230/LIPIcs.FSTTCS.2009.2305
• Tomas Brazdil, Javier Esparza, and Stefan Kiefer On the Memory Consumption of Probabilistic Pushdown Automata 10.4230/LIPIcs.FSTTCS.2009.2306
• Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera Continuous-Time Stochastic Games with Time-Bounded Reachability 10.4230/LIPIcs.FSTTCS.2009.2307
• Mikolaj Bojanczyk and Szymon Torunczyk Deterministic Automata and Extensions of Weak MSO 10.4230/LIPIcs.FSTTCS.2009.2308
• Laura Bozzelli, Axel Legay, and Sophie Pinchinat On Timed Alternating Simulation for Concurrent Timed Games 10.4230/LIPIcs.FSTTCS.2009.2309
• Laurent Braud Covering of ordinals 10.4230/LIPIcs.FSTTCS.2009.2310
• Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, and Dustin Wehr Fractional Pebbling and Thrifty Branching Programs 10.4230/LIPIcs.FSTTCS.2009.2311
• Jérémie Cabessa, Jacques Duparc, Alessandro Facchini, and Filip Murlak The Wadge Hierarchy of Max-Regular Languages 10.4230/LIPIcs.FSTTCS.2009.2312
• Julien Cristau Automata and temporal logic over arbitrary linear time 10.4230/LIPIcs.FSTTCS.2009.2313
• Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space 10.4230/LIPIcs.FSTTCS.2009.2314
• Anuj Dawar and Stephan Kreutzer Domination Problems in Nowhere-Dense Classes 10.4230/LIPIcs.FSTTCS.2009.2315
• Stéphanie Delaune, Steve Kremer, and Olivier Pereira Simulation based security in the applied pi calculus 10.4230/LIPIcs.FSTTCS.2009.2316
• Stéphane Demri, Marcin Jurdzinski, Oded Lachish, and Ranko Lazic The Covering and Boundedness Problems for Branching Vector Addition Systems 10.4230/LIPIcs.FSTTCS.2009.2317
• Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh Subexponential Algorithms for Partial Cover Problems 10.4230/LIPIcs.FSTTCS.2009.2318
• Konstantinos Georgiou, Avner Magen, and Iannis Tourlakis On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities 10.4230/LIPIcs.FSTTCS.2009.2319
• John M. Hitchcock, Aduri Pavan, and N. V. Vinodchandran Kolmogorov Complexity in Randomness Extraction 10.4230/LIPIcs.FSTTCS.2009.2320
• Chien-Chung Huang and Zoya Svitkina Donation Center Location Problem 10.4230/LIPIcs.FSTTCS.2009.2321
• Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland Non-Local Box Complexity and Secure Function Evaluation 10.4230/LIPIcs.FSTTCS.2009.2322
• Mark Kattenbelt and Michael Huth Verification and Refutation of Probabilistic Specifications via Games 10.4230/LIPIcs.FSTTCS.2009.2323
• Rohit Khandekar, Guy Kortsarz, and Zeev Nutov Approximating Fault-Tolerant Group-Steiner Problems 10.4230/LIPIcs.FSTTCS.2009.2324
• Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, and Joel Wolf Bounded Size Graph Clustering with Applications to Stream Processing 10.4230/LIPIcs.FSTTCS.2009.2325
• Joachim Kneis, Alexander Langer, and Peter Rossmanith A Fine-grained Analysis of a Simple Independent Set Algorithm 10.4230/LIPIcs.FSTTCS.2009.2326
• Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, and Jayalal Sarma M. N. Using Elimination Theory to construct Rigid Matrices 10.4230/LIPIcs.FSTTCS.2009.2327
• Christof Löding and Karianto Wong On Nondeterministic Unranked Tree Automata with Sibling Constraints 10.4230/LIPIcs.FSTTCS.2009.2328
• André Madeira and S. Muthukrishnan Functionally Private Approximations of Negligibly-Biased Estimators 10.4230/LIPIcs.FSTTCS.2009.2329
• Soumya Paul and Sunil Simon Nash Equilibrium in Generalised Muller Games 10.4230/LIPIcs.FSTTCS.2009.2330
• M. Praveen and Kamal Lodaya Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE 10.4230/LIPIcs.FSTTCS.2009.2331
• Alexander Rabinovich Synthesis of Finite-state and Definable Winning Strategies 10.4230/LIPIcs.FSTTCS.2009.2332
• Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena The Power of Depth 2 Circuits over Algebras 10.4230/LIPIcs.FSTTCS.2009.2333
• Ankur Taly and Ashish Tiwari Deductive Verification of Continuous Dynamical Systems 10.4230/LIPIcs.FSTTCS.2009.2334
• Mathieu Tracol, Christel Baier, and Marcus Grösser Recurrence and Transience for Probabilistic Automata 10.4230/LIPIcs.FSTTCS.2009.2335
• Anuj Dawar Structure and Specification as Sources of Complexity 10.4230/LIPIcs.FSTTCS.2009.2336
• Kim G. Larsen Priced Timed Automata: Theory and Tools 10.4230/LIPIcs.FSTTCS.2009.2337
• Martin Odersky and Adriaan Moors Fighting bit Rot with Types (Experience Report: Scala Collections) 10.4230/LIPIcs.FSTTCS.2009.2338
• R. Ravi Iterative Methods in Combinatorial Optimization 10.4230/LIPIcs.FSTTCS.2009.2339
• Avi Wigderson Randomness extractors -- applications and constructions 10.4230/LIPIcs.FSTTCS.2009.2340