Abstract is missing.
- 2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer ScienceRamesh Hariharan, Madhavan Mukund, V. Vinay. [doi]
- Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)Omid Amini, Fedor V. Fomin, Saket Saurabh. 1-12 [doi]
- 2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer ScienceRamesh Hariharan, Madhavan Mukund, V. Vinay. 10 [doi]
- Sound Lemma Generation for Proving Inductive Validity of EquationsTakahito Aoto. 13-24 [doi]
- Some Sieving Algorithms for Lattice ProblemsV. Arvind, Pushkar S. Joglekar. 25-36 [doi]
- Analyzing Asynchronous Programs with PreemptionMohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili. 37-48 [doi]
- Runtime Monitoring of Metric First-order Temporal PropertiesDavid A. Basin, Felix Klaedtke, Samuel Müller, Birgit Pfitzmann. 49-60 [doi]
- Solvency GamesNoam Berger, Nevin Kapur, Leonard J. Schulman, Vijay V. Vazirani. 61-72 [doi]
- On the Power of Imperfect InformationDietmar Berwanger, Laurent Doyen. 73-82 [doi]
- Boolean algebras of unambiguous context-free languagesDidier Caucal. 83-94 [doi]
- Increasing the power of the verifier in Quantum Zero KnowledgeAndré Chailloux, Iordanis Kerenidis. 95-106 [doi]
- Algorithms for Game MetricsKrishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, Vishwanath Raman. 107-118 [doi]
- Pruning 2-Connected GraphsChandra Chekuri, Nitish Korula. 119-130 [doi]
- Single-Sink Network Design with Vertex Connectivity RequirementsChandra Chekuri, Nitish Korula. 131-142 [doi]
- Graph Games on OrdinalsJulien Cristau, Florian Horn. 143-154 [doi]
- 3-connected Planar Graph Isomorphism is in Log-spaceSamir Datta, Nutan Limaye, Prajakta Nimbhorkar. 155-162 [doi]
- A new upper bound for 3-SATJosep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez. 163-174 [doi]
- Abstraction Refinement for Games with Incomplete InformationRayna Dimitrova, Bernd Finkbeiner. 175-186 [doi]
- A new approach to the planted clique problemAlan M. Frieze, Ravi Kannan. 187-198 [doi]
- All-Norms and All-L_p-Norms Approximation AlgorithmsDaniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan. 199-210 [doi]
- An Optimal Construction of Finite Automata from Regular ExpressionsStefan Gulan, Henning Fernau. 211-222 [doi]
- The unfolding of general Petri netsJonathan Hayman, Glynn Winskel. 223-234 [doi]
- Explicit Muller Games are PTIMEFlorian Horn. 235-243 [doi]
- The Complexity of Tree Transducer Output LanguagesKazuhiro Inaba, Sebastian Maneth. 244-255 [doi]
- STCON in Directed Unique-Path GraphsSampath Kannan, Sanjeev Khanna, Sudeepa Roy. 256-267 [doi]
- Dynamic matrix rank with partial lookaheadTelikepalli Kavitha. 268-279 [doi]
- A Cubic-Vertex Kernel for Flip Consensus TreeChristian Komusiewicz, Johannes Uhlmann. 280-291 [doi]
- Leaf languages and string compressionMarkus Lohrey. 292-303 [doi]
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent InterpretationsGeorg Moser, Andreas Schnabl, Johannes Waldmann. 304-315 [doi]
- Analyzing the Implicit Computational Complexity of object-oriented programsJean-Yves Marion, Romain Péchoux. 316-327 [doi]
- A Hierarchy of Semantics for Non-deterministic Term Rewriting SystemsJuan Rodríguez-Hortalá. 328-339 [doi]
- Average-Time GamesMarcin Jurdzinski, Ashutosh Trivedi. 340-351 [doi]
- About models of security protocolsHubert Comon-Lundh. 352-356 [doi]
- On Estimation Algorithms vs Approximation AlgorithmsUriel Feige. 357-363 [doi]
- Banach-Mazur Games on GraphsErich Grädel. 364-382 [doi]
- Harnessing the Multicores: Nested Data Parallelism in HaskellSimon L. Peyton Jones, Roman Leshchinskiy, Gabriele Keller, Manuel M. T. Chakravarty. 383-414 [doi]
- Knowledge Infusion: In Pursuit of Robustness in Artificial IntelligenceLeslie G. Valiant. 415-422 [doi]