Abstract is missing.
- Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)Ravi Kannan, K. Narayan Kumar. [doi]
- Mediating for Reduction (on Minimizing Alternating Büchi Automata)Parosh Aziz Abdulla, Yu-Fang Chen, Lukás HolÃk, Tomás Vojnar. 1-12 [doi]
- Algorithms for Message Ferrying on Mobile ad hoc NetworksMostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton. 13-24 [doi]
- Arithmetic Circuits and the Hadamard Product of PolynomialsVikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan. 25-36 [doi]
- Kernels for Feedback Arc Set In TournamentsStéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé. 37-47 [doi]
- On the Memory Consumption of Probabilistic Pushdown AutomataTomás Brázdil, Javier Esparza, Stefan Kiefer. 49-60 [doi]
- Continuous-Time Stochastic Games with Time-Bounded ReachabilityTomás Brázdil, Vojtech Forejt, Jan Krcal, Jan KretÃnský, AntonÃn Kucera. 61-72 [doi]
- Deterministic Automata and Extensions of Weak MSOMikolaj Bojanczyk, Szymon Torunczyk. 73-84 [doi]
- On Timed Alternating Simulation for Concurrent Timed GamesLaura Bozzelli, Axel Legay, Sophie Pinchinat. 85-96 [doi]
- Covering of ordinalsLaurent Braud. 97-108 [doi]
- Fractional Pebbling and Thrifty Branching ProgramsMark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam, Dustin Wehr. 109-120 [doi]
- The Wadge Hierarchy of Max-Regular LanguagesJérémie Cabessa, Jacques Duparc, Alessandro Facchini, Filip Murlak. 121-132 [doi]
- Automata and temporal logic over arbitrary linear timeJulien Cristau. 133-144 [doi]
- Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-spaceSamir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner. 145-156 [doi]
- Domination Problems in Nowhere-Dense ClassesAnuj Dawar, Stephan Kreutzer. 157-168 [doi]
- Simulation based security in the applied pi calculusStéphanie Delaune, Steve Kremer, Olivier Pereira. 169-180 [doi]
- The Covering and Boundedness Problems for Branching Vector Addition SystemsStéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic. 181-192 [doi]
- Subexponential Algorithms for Partial Cover ProblemsFedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh. 193-201 [doi]
- On the Tightening of the Standard SDP for Vertex Cover with ell_1 InequalitiesKonstantinos Georgiou, Avner Magen, Iannis Tourlakis. 203-214 [doi]
- Kolmogorov Complexity in Randomness ExtractionJohn M. Hitchcock, Aduri Pavan, N. V. Vinodchandran. 215-226 [doi]
- Donation Center Location ProblemChien-Chung Huang, Zoya Svitkina. 227-238 [doi]
- Non-Local Box Complexity and Secure Function EvaluationMarc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland. 239-250 [doi]
- Verification and Refutation of Probabilistic Specifications via GamesMark Kattenbelt, Michael Huth. 251-262 [doi]
- Approximating Fault-Tolerant Group-Steiner ProblemsRohit Khandekar, Guy Kortsarz, Zeev Nutov. 263-274 [doi]
- Bounded Size Graph Clustering with Applications to Stream ProcessingRohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf. 275-286 [doi]
- A Fine-grained Analysis of a Simple Independent Set AlgorithmJoachim Kneis, Alexander Langer, Peter Rossmanith. 287-298 [doi]
- Using Elimination Theory to construct Rigid MatricesKumar Abhinav, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal M. N. Sarma. 299-310 [doi]
- On Nondeterministic Unranked Tree Automata with Sibling ConstraintsChristof Löding, Karianto Wong. 311-322 [doi]
- Functionally Private Approximations of Negligibly-Biased EstimatorsAndré Madeira, S. Muthukrishnan. 323-334 [doi]
- Nash Equilibrium in Generalised Muller GamesSoumya Paul, Sunil Easaw Simon. 335-346 [doi]
- Modelchecking counting properties of 1-safe nets with buffers in paraPSPACEM. Praveen, Kamal Lodaya. 347-358 [doi]
- Synthesis of Finite-state and Definable Winning StrategiesAlexander Rabinovich. 359-370 [doi]
- The Power of Depth 2 Circuits over AlgebrasChandan Saha, Ramprasad Saptharishi, Nitin Saxena. 371-382 [doi]
- Deductive Verification of Continuous Dynamical SystemsAnkur Taly, Ashish Tiwari. 383-394 [doi]
- Recurrence and Transience for Probabilistic AutomataMathieu Tracol, Christel Baier, Marcus Größer. 395-406 [doi]
- Structure and Specification as Sources of ComplexityAnuj Dawar. 407-416 [doi]
- Priced Timed Automata: Theory and ToolsKim G. Larsen. 417-425 [doi]
- Fighting bit Rot with Types (Experience Report: Scala Collections)Martin Odersky, Adriaan Moors. 427-451 [doi]
- Iterative Methods in Combinatorial OptimizationR. Ravi. 453-469 [doi]
- Randomness extractors -- applications and constructionsAvi Wigderson. 471-473 [doi]