LIPIcs, Volume 18, FSTTCS 2012

• Deepak D'Souza, Telikepalli Kavitha, and Jaikumar Radhakrishnan LIPIcs, Volume 18, FSTTCS'12, Complete Volume 10.4230/LIPIcs.FSTTCS.2012
• Deepak D'Souza, Jaikumar Radhakrishnan, and Kavitha Telikepalli Frontmatter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2012.i
• Yuval Rabani Learning Mixtures of Distributions over Large Discrete Domains 10.4230/LIPIcs.FSTTCS.2012.1
• Mikolaj Bojanczyk and Szymon Torunczyk Imperative Programming in Sets with Atoms 10.4230/LIPIcs.FSTTCS.2012.4
• Dimitris Achlioptas and Themis Gouleakis Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion 10.4230/LIPIcs.FSTTCS.2012.16
• Patrice Godefroid Test Generation Using Symbolic Execution 10.4230/LIPIcs.FSTTCS.2012.24
• Madhusudan Parthasarathy Automated Reasoning and Natural Proofs for Programs Manipulating Data Structures 10.4230/LIPIcs.FSTTCS.2012.34
• Swastik Kopparty and Srikanth Srinivasan Certifying polynomials for AC^0(parity) circuits, with applications 10.4230/LIPIcs.FSTTCS.2012.36
• Santosh S. Vempala Randomly-oriented k-d Trees Adapt to Intrinsic Dimension 10.4230/LIPIcs.FSTTCS.2012.48
• Navin Goyal and Luis Rademacher Lower Bounds for the Average and Smoothed Number of Pareto Optima 10.4230/LIPIcs.FSTTCS.2012.58
• Guy Feigenblat, Ely Porat, and Ariel Shiftan Exponential Space Improvement for minwise Based Algorithms 10.4230/LIPIcs.FSTTCS.2012.70
• Andreas Krebs and Howard Straubing An effective characterization of the alternation hierarchy in two-variable logic 10.4230/LIPIcs.FSTTCS.2012.86
• Vince Bárány, Mikolaj Bojanczyk, Diego Figueira, and Pawel Parys Decidable classes of documents for XPath 10.4230/LIPIcs.FSTTCS.2012.99
• Jakub Gajarsky and Petr Hlineny Faster Deciding MSO Properties of Trees of Fixed Height, and Some Consequences 10.4230/LIPIcs.FSTTCS.2012.112
• Nathanael Fijalkow and Martin Zimmermann Cost-Parity and Cost-Streett Games 10.4230/LIPIcs.FSTTCS.2012.124
• Kishore Kothapalli and Sriram Pemmaraju Super-Fast 3-Ruling Sets 10.4230/LIPIcs.FSTTCS.2012.136
• Gábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, and Ronald de Wolf New bounds on the classical and quantum communication complexity of some graph properties 10.4230/LIPIcs.FSTTCS.2012.148
• Christopher Broadbent and Stefan Göller On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order Two 10.4230/LIPIcs.FSTTCS.2012.160
• Salvatore La Torre and Gennaro Parlato Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width 10.4230/LIPIcs.FSTTCS.2012.173
• Rohit Khandekar, Kirsten Hildrum, Deepak Rajan, and Joel Wolf Scheduling with Setup Costs and Monotone Penalties 10.4230/LIPIcs.FSTTCS.2012.185
• Venkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, and Yogish Sabharwal Scheduling Resources for Executing a Partial Set of Jobs 10.4230/LIPIcs.FSTTCS.2012.199
• Laura Bozzelli and César Sánchez Visibly Rational Expressions 10.4230/LIPIcs.FSTTCS.2012.211
• Alexander Heußner, Tristan Le Gall, and Grégoire Sutre Safety Verification of Communicating One-Counter Machines 10.4230/LIPIcs.FSTTCS.2012.224
• Venkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, and Yogish Sabharwal Density Functions subject to a Co-Matroid Constraint 10.4230/LIPIcs.FSTTCS.2012.236
• Amit Kumar, Preeti R. Panda, and Smruti Sarangi Efficient on-line algorithm for maintaining k-cover of sparse bit-strings 10.4230/LIPIcs.FSTTCS.2012.249
• Abhash Anand, Surender Baswana, Manoj Gupta, and Sandeep Sen Maintaining Approximate Maximum Weighted Matching in Fully Dynamic Graphs 10.4230/LIPIcs.FSTTCS.2012.257
• Khaled Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, and Arindam Pal Approximation Algorithms for the Unsplittable Flow Problem on Paths and Trees 10.4230/LIPIcs.FSTTCS.2012.267
• Vincent Danos, Jerome Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Chris Thompson-Walsh, and Glynn Winskel Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models 10.4230/LIPIcs.FSTTCS.2012.276
• Giorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, and Gianluigi Zavattaro On the Complexity of Parameterized Reachability in Reconfigurable Broadcast Networks 10.4230/LIPIcs.FSTTCS.2012.289
• Rémi Bonnet, Alain Finkel, and M. Praveen Extending the Rackoff technique to Affine nets 10.4230/LIPIcs.FSTTCS.2012.301
• Anthony Widjaja Lin Accelerating tree-automatic relations 10.4230/LIPIcs.FSTTCS.2012.313
• Binay Bhattacharya and Yuzhuang Hu k-delivery traveling salesman problem on tree networks 10.4230/LIPIcs.FSTTCS.2012.325
• Paul Bonsma Rerouting shortest paths in planar graphs 10.4230/LIPIcs.FSTTCS.2012.337
• Varun Rajan Space Efficient Edge-Fault Tolerant Routing 10.4230/LIPIcs.FSTTCS.2012.350
• Udi Boker and Thomas A. Henzinger Approximate Determinization of Quantitative Automata 10.4230/LIPIcs.FSTTCS.2012.362
• Parosh Aziz Abdulla, Mohamed Faouzi Atig, and Jonathan Cederberg Timed Lossy Channel Systems 10.4230/LIPIcs.FSTTCS.2012.374
• Johannes Köbler, Sebastian Kuhnert, and Oleg Verbitsky Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace 10.4230/LIPIcs.FSTTCS.2012.387
• Robert Crowston, Gregory Gutin, and Mark Jones Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik Bound 10.4230/LIPIcs.FSTTCS.2012.400
• Matthias Mnich, Geevarghese Philip, Saket Saurabh, and Ondrej Suchy Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik Bound 10.4230/LIPIcs.FSTTCS.2012.412
• Daniel Lokshtanov, Saket Saurabh, and Magnus Wahlström Subexponential Parameterized Odd Cycle Transversal on Planar Graphs 10.4230/LIPIcs.FSTTCS.2012.424
• Holger Hermanns and Andrea Turrini Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time 10.4230/LIPIcs.FSTTCS.2012.435
• Vojtech Forejt, Petr Jancar, Stefan Kiefer, and James Worrell Bisimilarity of Probabilistic Pushdown Automata 10.4230/LIPIcs.FSTTCS.2012.448
• Krishnendu Chatterjee, Manas Joglekar, and Nisarg Shah Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi Objectives 10.4230/LIPIcs.FSTTCS.2012.461
• Tomas Brazdil, Holger Hermanns, Jan Krcal, Jan Kretinsky, and Vojtech Rehak Verification of Open Interactive Markov Chains 10.4230/LIPIcs.FSTTCS.2012.474
• Kasturi Varadarajan and Xin Xiao On the Sensitivity of Shape Fitting Problems 10.4230/LIPIcs.FSTTCS.2012.486
• Hee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, and Juyoung Yon Overlap of Convex Polytopes under Rigid Motion 10.4230/LIPIcs.FSTTCS.2012.498
• Minati De, Subhas C. Nandy, and Sasanka Roy Minimum Enclosing Circle with Few Extra Variables 10.4230/LIPIcs.FSTTCS.2012.510
• Pranavadatta Devaki and Aditya Kanade Static Analysis for Checking Data Format Compatibility of Programs 10.4230/LIPIcs.FSTTCS.2012.522
• Rohit Chadha and Michael Ummels The Complexity of Quantitative Information Flow in Recursive Programs 10.4230/LIPIcs.FSTTCS.2012.534
• Gergei Bana, Pedro Adao, and Hideki Sakurada Computationally Complete Symbolic Attacker in Action 10.4230/LIPIcs.FSTTCS.2012.546