Table of Contents

• Frontmatter, Table of Contents, Preface, Conference Organization [doi]
• Learning Mixtures of Distributions over Large Discrete DomainsYuval Rabani. 1-3 [doi]
• Imperative Programming in Sets with AtomsMikolaj Bojanczyk, Szymon Torunczyk. 4-15 [doi]
• Algorithmic Improvements of the Lovász Local Lemma via Cluster Expansion Dimitris Achlioptas, Themis Gouleakis. 16-23 [doi]
• Test Generation Using Symbolic ExecutionPatrice Godefroid. 24-33 [doi]
• Automated Reasoning and Natural Proofs for Programs Manipulating Data StructuresParthasarathy Madhusudan. 34-35 [doi]
• Certifying polynomials for AC^0(parity) circuits, with applicationsSwastik Kopparty, Srikanth Srinivasan. 36-47 [doi]
• Randomly-oriented k-d Trees Adapt to Intrinsic DimensionSantosh Vempala. 48-57 [doi]
• Lower Bounds for the Average and Smoothed Number of Pareto OptimaNavin Goyal, Luis Rademacher. 58-69 [doi]
• Exponential Space Improvement for minwise Based AlgorithmsGuy Feigenblat, Ely Porat, Ariel Shiftan. 70-85 [doi]
• An effective characterization of the alternation hierarchy in two-variable logicAndreas Krebs, Howard Straubing. 86-98 [doi]
• Decidable classes of documents for XPathVince Bárány, Mikolaj Bojanczyk, Diego Figueira, Pawel Parys. 99-111 [doi]
• Faster Deciding MSO Properties of Trees of Fixed Height, and Some ConsequencesJakub Gajarský, Petr Hlinený. 112-123 [doi]
• Cost-Parity and Cost-Streett GamesNathanaël Fijalkow, Martin Zimmermann 0002. 124-135 [doi]
• Super-Fast 3-Ruling SetsKishore Kothapalli, Sriram V. Pemmaraju. 136-147 [doi]
• New bounds on the classical and quantum communication complexity of some graph propertiesGábor Ivanyos, Hartmut Klauck, Troy Lee, Miklos Santha, Ronald de Wolf. 148-159 [doi]
• On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order TwoChristopher H. Broadbent, Stefan Göller. 160-172 [doi]
• Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-WidthSalvatore La Torre, Gennaro Parlato. 173-184 [doi]
• Scheduling with Setup Costs and Monotone PenaltiesRohit Khandekar, Kirsten Hildrum, Deepak Rajan, Joel L. Wolf. 185-198 [doi]
• Scheduling Resources for Executing a Partial Set of JobsVenkatesan T. Chakaravarthy, Arindam Pal, Sambuddha Roy, Yogish Sabharwal. 199-210 [doi]
• Visibly Rational ExpressionsLaura Bozzelli, César Sánchez. 211-223 [doi]
• Safety Verification of Communicating One-Counter MachinesAlexander Heußner, Tristan Le Gall, Grégoire Sutre. 224-235 [doi]
• Density Functions subject to a Co-Matroid ConstraintVenkatesan T. Chakaravarthy, Natwar Modani, Sivaramakrishnan R. Natarajan, Sambuddha Roy, Yogish Sabharwal. 236-248 [doi]
• Efficient on-line algorithm for maintaining k-cover of sparse bit-stringsAmit Kumar, Preeti Ranjan Panda, Smruti R. Sarangi. 249-256 [doi]
• Maintaining Approximate Maximum Weighted Matching in Fully Dynamic GraphsAbhash Anand, Surender Baswana, Manoj Gupta, Sandeep Sen. 257-266 [doi]
• Approximation Algorithms for the Unsplittable Flow Problem on Paths and TreesKhaled M. Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula, Arindam Pal. 267-275 [doi]
• Graphs, Rewriting and Pathway Reconstruction for Rule-Based ModelsVincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Christopher D. Thompson-Walsh, Glynn Winskel. 276-288 [doi]
• On the Complexity of Parameterized Reachability in Reconfigurable Broadcast NetworksGiorgio Delzanno, Arnaud Sangnier, Riccardo Traverso, Gianluigi Zavattaro. 289-300 [doi]
• Extending the Rackoff technique to Affine netsRémi Bonnet, Alain Finkel, M. Praveen. 301-312 [doi]
• Accelerating tree-automatic relationsAnthony Widjaja Lin. 313-324 [doi]
• k-delivery traveling salesman problem on tree networksBinay K. Bhattacharya, Yuzhuang Hu. 325-336 [doi]
• Rerouting shortest paths in planar graphsPaul Bonsma. 337-349 [doi]
• Space Efficient Edge-Fault Tolerant RoutingVarun Rajan. 350-361 [doi]
• Approximate Determinization of Quantitative AutomataUdi Boker, Thomas A. Henzinger. 362-373 [doi]
• Timed Lossy Channel SystemsParosh Aziz Abdulla, Mohamed Faouzi Atig, Jonathan Cederberg. 374-386 [doi]
• Solving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in LogspaceJohannes Köbler, Sebastian Kuhnert, Oleg Verbitsky. 387-399 [doi]
• Directed Acyclic Subgraph Problem Parameterized above the Poljak-Turzik BoundRobert Crowston, Gregory Gutin, Mark Jones. 400-411 [doi]
• Beyond Max-Cut: lambda-Extendible Properties Parameterized Above the Poljak-Turzik BoundMatthias Mnich, Geevarghese Philip, Saket Saurabh, Ondrej Suchý. 412-423 [doi]
• Subexponential Parameterized Odd Cycle Transversal on Planar GraphsDaniel Lokshtanov, Saket Saurabh, Magnus Wahlström. 424-434 [doi]
• Deciding Probabilistic Automata Weak Bisimulation in Polynomial TimeHolger Hermanns, Andrea Turrini. 435-447 [doi]
• Bisimilarity of Probabilistic Pushdown AutomataVojtech Forejt, Petr Jancar, Stefan Kiefer, James Worrell. 448-460 [doi]
• Average Case Analysis of the Classical Algorithm for Markov Decision Processes with Büchi ObjectivesKrishnendu Chatterjee, Manas Joglekar, Nisarg Shah. 461-473 [doi]
• Verification of Open Interactive Markov ChainsTomás Brázdil, Holger Hermanns, Jan Krcál, Jan Kretínský, Vojtech Rehák. 474-485 [doi]
• On the Sensitivity of Shape Fitting ProblemsKasturi Varadarajan, Xin Xiao. 486-497 [doi]
• Overlap of Convex Polytopes under Rigid MotionHee-Kap Ahn, Siu-Wing Cheng, Hyuk Jun Kweon, Juyoung Yon. 498-509 [doi]
• Minimum Enclosing Circle with Few Extra VariablesMinati De, Subhas C. Nandy, Sasanka Roy. 510-521 [doi]
• Static Analysis for Checking Data Format Compatibility of ProgramsPranavadatta Devaki, Aditya Kanade. 522-533 [doi]
• The Complexity of Quantitative Information Flow in Recursive ProgramsRohit Chadha, Michael Ummels. 534-545 [doi]
• Computationally Complete Symbolic Attacker in ActionGergei Bana, Pedro Adão, Hideki Sakurada. 546-560 [doi]