LIPIcs, Volume 8, FSTTCS 2010

• Kamal Lodaya and Meena Mahajan LIPIcs, Volume 8, FSTTCS'10, Complete Volume 10.4230/LIPIcs.FSTTCS.2010
• Kamal Lodaya and Meena Mahajan Frontmatter, Table of Contents, Preface, Conference Organization, Author Index 10.4230/LIPIcs.FSTTCS.2010.i
• Rajeev Alur and Pavol Černý Expressiveness of streaming string transducers 10.4230/LIPIcs.FSTTCS.2010.1
• Bruno Courcelle Special tree-width and the verification of monadic second-order graph pr operties 10.4230/LIPIcs.FSTTCS.2010.13
• Pavel Pudlák On extracting computations from propositional proofs (a survey) 10.4230/LIPIcs.FSTTCS.2010.30
• Santosh S. Vempala Recent Progress and Open Problems in Algorithmic Convex Geometry 10.4230/LIPIcs.FSTTCS.2010.42
• Wieslaw Zielonka Playing in stochastic environment: from multi-armed bandits to two-player games 10.4230/LIPIcs.FSTTCS.2010.65
• Robert Ganian, Petr Hlinený, and Jan Obdrzálek Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width 10.4230/LIPIcs.FSTTCS.2010.73
• Sebastian Ordyniak, Daniel Paulusma, and Stefan Szeider Satisfiability of Acyclic and Almost Acyclic CNF Formulas 10.4230/LIPIcs.FSTTCS.2010.84
• Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, and Saket Saurabh The effect of girth on the kernelization complexity of Connected Dominating Set 10.4230/LIPIcs.FSTTCS.2010.96
• Tomás Brázdil, Václav Brozek, and Kousha Etessami One-Counter Stochastic Games 10.4230/LIPIcs.FSTTCS.2010.108
• Arnaud Da Costa, François Laroussinie, and Nicolas Markey ATL with Strategy Contexts: Expressiveness and Model Checking 10.4230/LIPIcs.FSTTCS.2010.120
• Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi Reasoning About Strategies 10.4230/LIPIcs.FSTTCS.2010.133
• Sourav Chakraborty, Eldar Fischer, Arie Matsliah, and Ronald de Wolf New Results on Quantum Property Testing 10.4230/LIPIcs.FSTTCS.2010.145
• André Chailloux, Iordanis Kerenidis, and Jamie Sikora Lower bounds for Quantum Oblivious Transfer 10.4230/LIPIcs.FSTTCS.2010.157
• Rohit Khandekar, Baruch Schieber, Hadas Shachnai, and Tami Tamir Minimizing Busy Time in Multiple Machine Real-time Scheduling 10.4230/LIPIcs.FSTTCS.2010.169
• Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, and Yogish Sabharwal A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints 10.4230/LIPIcs.FSTTCS.2010.181
• Rémi Bonnet, Alain Finkel, Jérôme Leroux, and Marc Zeitoun Place-Boundedness for Vector Addition Systems with one zero-test 10.4230/LIPIcs.FSTTCS.2010.192
• S. Akshay, Paul Gastin, Madhavan Mukund, and K. Narayan Kumar Model checking time-constrained scenario-based specifications 10.4230/LIPIcs.FSTTCS.2010.204
• Mohamed Faouzi Atig Global Model Checking of Ordered Multi-Pushdown Systems 10.4230/LIPIcs.FSTTCS.2010.216
• Matthew Hague and Anthony Widjaja To The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems 10.4230/LIPIcs.FSTTCS.2010.228
• Qi Ge and Daniel Stefankovic A graph polynomial for independent sets of bipartite graphs 10.4230/LIPIcs.FSTTCS.2010.240
• Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, and Yogish Sabharwal Finding Independent Sets in Unions of Perfect Graphs 10.4230/LIPIcs.FSTTCS.2010.251
• Wojciech Czerwinski and Slawomir Lasota Fast equivalence-checking for normed context-free processes 10.4230/LIPIcs.FSTTCS.2010.260
• Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, and Jan J. M. M. Rutten Generalizing the powerset construction, coalgebraically 10.4230/LIPIcs.FSTTCS.2010.272
• Nicholas Radcliffe and Rakesh M. Verma Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems 10.4230/LIPIcs.FSTTCS.2010.284
• Maurice Jansen, Youming Qiao, and Jayalal Sarma M.N. Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs 10.4230/LIPIcs.FSTTCS.2010.296
• Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, and James Worrell Computing Rational Radical Sums in Uniform TC^0 10.4230/LIPIcs.FSTTCS.2010.308
• Arkadev Chattopadhyay, Jacobo Torán, and Fabian Wagner Graph Isomorphism is not AC^0 reducible to Group Isomorphism 10.4230/LIPIcs.FSTTCS.2010.317
• V. Arvind, Bireswar Das, Johannes Köbler, and Seinosuke Toda Colored Hypergraph Isomorphism is Fixed Parameter Tractable 10.4230/LIPIcs.FSTTCS.2010.327
• Sara Capecchi, Elena Giachino, and Nobuko Yoshida Global Escape in Multiparty Sessions 10.4230/LIPIcs.FSTTCS.2010.338
• Michael Backes, Matteo Maffei, and Esfandiar Mohammadi Computationally Sound Abstraction and Verification of Secure Multi-Party Computations 10.4230/LIPIcs.FSTTCS.2010.352
• Rohit Chadha, A. Prasad Sistla, and Mahesh Viswanathan Model Checking Concurrent Programs with Nondeterminism and Randomization 10.4230/LIPIcs.FSTTCS.2010.364
• Eugene Asarin and Aldric Degorre Two Size Measures for Timed Languages 10.4230/LIPIcs.FSTTCS.2010.376
• Cyril Nicaud, Carine Pivoteau, and Benoît Razet Average Analysis of Glushkov Automata under a BST-Like Model 10.4230/LIPIcs.FSTTCS.2010.388
• Sven Schewe Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete 10.4230/LIPIcs.FSTTCS.2010.400
• Udi Boker, Orna Kupferman, and Avital Steinitz Parityizing Rabin and Streett 10.4230/LIPIcs.FSTTCS.2010.412
• Piotr Berman, Sofya Raskhodnikova, and Ge Ruan Finding Sparser Directed Spanners 10.4230/LIPIcs.FSTTCS.2010.424
• Gagan Goel, Pushkar Tripathi, and Lei Wang Combinatorial Problems with Discounted Price Functions in Multi-agent Systems 10.4230/LIPIcs.FSTTCS.2010.436
• Rishi Saket Quasi-Random PCP and Hardness of 2-Catalog Segmentation 10.4230/LIPIcs.FSTTCS.2010.447
• Michael Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, and Saket Saurabh Determining the Winner of a Dodgson Election is Hard 10.4230/LIPIcs.FSTTCS.2010.459
• Blaise Genest, Anca Muscholl, and Zhilin Wu Verifying Recursive Active Documents with Positive Data Tree Rewriting 10.4230/LIPIcs.FSTTCS.2010.469
• Ahmet Kara, Thomas Schwentick, and Thomas Zeume Temporal Logics on Words with Multiple Data Values 10.4230/LIPIcs.FSTTCS.2010.481
• Stefan Schulz First-Order Logic with Reachability Predicates on Infinite Systems 10.4230/LIPIcs.FSTTCS.2010.493
• Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin Generalized Mean-payoff and Energy Games 10.4230/LIPIcs.FSTTCS.2010.505