30. FSTTCS 2010: Chennai, India

• Kamal Lodaya, Meena Mahajan:
  Frontmatter, Table of Contents, Preface, Conference Organization, Author Index.
  
• Rajeev Alur, Pavol Cerný:
  Expressiveness of streaming string transducers. 1-12
  
• Bruno Courcelle:
  Special tree-width and the verification of monadic second-order graph pr operties. 13-29
  
• Pavel Pudlák:
  On extracting computations from propositional proofs (a survey). 30-41
  
• Santosh Vempala:
  Recent Progress and Open Problems in Algorithmic Convex Geometry. 42-64
  
• Wieslaw Zielonka:
  Playing in stochastic environment: from multi-armed bandits to two-player games. 65-72
  
• Robert Ganian, Petr Hlinený, Jan Obdrzálek:
  Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width. 73-83
  
• Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider:
  Satisfiability of Acyclic and Almost Acyclic CNF Formulas. 84-95
  
• Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh:
  The effect of girth on the kernelization complexity of Connected Dominating Set. 96-107
  
• Tomás Brázdil, Václav Brozek, Kousha Etessami:
  One-Counter Stochastic Games. 108-119
  
• Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey:
  ATL with Strategy Contexts: Expressiveness and Model Checking. 120-132
  
• Fabio Mogavero, Aniello Murano, Moshe Y. Vardi:
  Reasoning About Strategies. 133-144
  
• Sourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf:
  New Results on Quantum Property Testing. 145-156
  
• André Chailloux, Iordanis Kerenidis, Jamie Sikora:
  Lower bounds for Quantum Oblivious Transfer. 157-168
  
• Rohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir:
  Minimizing Busy Time in Multiple Machine Real-time Scheduling. 169-180
  
• Venkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal:
  A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints. 181-191
  
• Rémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun:
  Place-Boundedness for Vector Addition Systems with one zero-test. 192-203
  
• S. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
  Model checking time-constrained scenario-based specifications. 204-215
  
• Mohamed Faouzi Atig:
  Global Model Checking of Ordered Multi-Pushdown Systems. 216-227
  
• Matthew Hague, Anthony Widjaja To:
  The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems. 228-239
  
• Qi Ge, Daniel Stefankovic:
  A graph polynomial for independent sets of bipartite graphs. 240-250
  
• Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal:
  Finding Independent Sets in Unions of Perfect Graphs. 251-259
  
• Wojciech Czerwinski, Slawomir Lasota:
  Fast equivalence-checking for normed context-free processes. 260-271
  
• Alexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten:
  Generalizing the powerset construction, coalgebraically. 272-283
  
• Nicholas Radcliffe, Rakesh M. Verma:
  Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems. 284-295
  
• Maurice J. Jansen, Youming Qiao, Jayalal M. N. Sarma:
  Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs. 296-307
  
• Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell:
  Computing Rational Radical Sums in Uniform TC^0. 308-316
  
• Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner:
  Graph Isomorphism is not AC^0 reducible to Group Isomorphism. 317-326
  
• Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
  Colored Hypergraph Isomorphism is Fixed Parameter Tractable. 327-337
  
• Sara Capecchi, Elena Giachino, Nobuko Yoshida:
  Global Escape in Multiparty Sessions. 338-351
  
• Michael Backes, Matteo Maffei, Esfandiar Mohammadi:
  Computationally Sound Abstraction and Verification of Secure Multi-Party Computations. 352-363
  
• Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
  Model Checking Concurrent Programs with Nondeterminism and Randomization. 364-375
  
• Eugene Asarin, Aldric Degorre:
  Two Size Measures for Timed Languages. 376-387
  
• Cyril Nicaud, Carine Pivoteau, Benoît Razet:
  Average Analysis of Glushkov Automata under a BST-Like Model. 388-399
  
• Sven Schewe:
  Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete. 400-411
  
• Udi Boker, Orna Kupferman, Avital Steinitz:
  Parityizing Rabin and Streett. 412-423
  
• Piotr Berman, Sofya Raskhodnikova, Ge Ruan:
  Finding Sparser Directed Spanners. 424-435
  
• Gagan Goel, Pushkar Tripathi, Lei Wang:
  Combinatorial Problems with Discounted Price Functions in Multi-agent Systems. 436-446
  
• Rishi Saket:
  Quasi-Random PCP and Hardness of 2-Catalog Segmentation. 447-458
  
• Michael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh:
  Determining the Winner of a Dodgson Election is Hard. 459-468
  
• Blaise Genest, Anca Muscholl, Zhilin Wu:
  Verifying Recursive Active Documents with Positive Data Tree Rewriting. 469-480
  
• Ahmet Kara, Thomas Schwentick, Thomas Zeume:
  Temporal Logics on Words with Multiple Data Values. 481-492
  
• Stefan Schulz:
  First-Order Logic with Reachability Predicates on Infinite Systems. 493-504
  
• Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin:
  Generalized Mean-payoff and Energy Games. 505-516
  

Last update Wed May 23 00:47:23 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page