LIPIcs, Volume 2, FSTTCS 2008

• Ramesh Hariharan, Madhavan Mukund, and V Vinay LIPIcs, Volume 2, FSTTCS'08, Complete Volume 10.4230/LIPIcs.FSTTCS.2008
• Ramesh Hariharan, Madhavan Mukund, and V Vinay 2008 Abstracts Collection -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 10.4230/LIPIcs.FSTTCS.2008.1772
• Ramesh Hariharan, Madhavan Mukund, and V Vinay 2008 Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 10.4230/LIPIcs.FSTTCS.2008.1771
• Samir Datta, Nutan Limaye, and Prajakta Nimbhorkar 3-connected Planar Graph Isomorphism is in Log-space 10.4230/LIPIcs.FSTTCS.2008.1749
• Christian Komusiewicz and Johannes Uhlmann A Cubic-Vertex Kernel for Flip Consensus Tree 10.4230/LIPIcs.FSTTCS.2008.1760
• Juan Rodriguez-Hortala A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems 10.4230/LIPIcs.FSTTCS.2008.1764
• Alan Frieze and Ravi Kannan A new approach to the planted clique problem 10.4230/LIPIcs.FSTTCS.2008.1752
• Josep Diaz, Lefteris Kirousis, Dieter Mitsche, and Xavier Perez-Gimenez A new upper bound for 3-SAT 10.4230/LIPIcs.FSTTCS.2008.1750
• Hubert Comon-Lundh About models of security protocols 10.4230/LIPIcs.FSTTCS.2008.1766
• Rayna Dimitrova and Bernd Finkbeiner Abstraction Refinement for Games with Incomplete Information 10.4230/LIPIcs.FSTTCS.2008.1751
• Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, and Vishwanath Raman Algorithms for Game Metrics 10.4230/LIPIcs.FSTTCS.2008.1745
• Daniel Golovin, Anupam Gupta, Amit Kumar, and Kanat Tangwongsan All-Norms and All-L_p-Norms Approximation Algorithms 10.4230/LIPIcs.FSTTCS.2008.1753
• Stefan Gulan and Henning Fernau An Optimal Construction of Finite Automata from Regular Expressions 10.4230/LIPIcs.FSTTCS.2008.1754
• Mohamed Faouzi Atig, Ahmed Bouajjani, and Tayssir Touili Analyzing Asynchronous Programs with Preemption 10.4230/LIPIcs.FSTTCS.2008.1739
• Jean-Yves Marion and Romain Pechoux Analyzing the Implicit Computational Complexity of object-oriented programs 10.4230/LIPIcs.FSTTCS.2008.1763
• Marcin Jurdzinski and Ashutosh Trivedi Average-Time Games 10.4230/LIPIcs.FSTTCS.2008.1765
• Erich Graedel Banach-Mazur Games on Graphs 10.4230/LIPIcs.FSTTCS.2008.1768
• Didier Caucal Boolean algebras of unambiguous context-free languages 10.4230/LIPIcs.FSTTCS.2008.1743
• Georg Moser, Andreas Schnabl, and Johannes Waldmann Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations 10.4230/LIPIcs.FSTTCS.2008.1762
• Telikepalli Kavitha Dynamic matrix rank with partial lookahead 10.4230/LIPIcs.FSTTCS.2008.1759
• Florian Horn Explicit Muller Games are PTIME 10.4230/LIPIcs.FSTTCS.2008.1756
• Julien Cristau and Florian Horn Graph Games on Ordinals 10.4230/LIPIcs.FSTTCS.2008.1748
• Simon Peyton Jones, Roman Leshchinskiy, Gabriele Keller, and Manuel M T Chakravarty Harnessing the Multicores: Nested Data Parallelism in Haskell 10.4230/LIPIcs.FSTTCS.2008.1769
• Omid Amini, Fedor Fomin, and Saket Saurabh Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract) 10.4230/LIPIcs.FSTTCS.2008.1736
• Andre Chailloux and Iordanis Kerenidis Increasing the power of the verifier in Quantum Zero Knowledge 10.4230/LIPIcs.FSTTCS.2008.1744
• Leslie G Valiant Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence 10.4230/LIPIcs.FSTTCS.2008.1770
• Markus Lohrey Leaf languages and string compression 10.4230/LIPIcs.FSTTCS.2008.1761
• Uriel Feige On Estimation Algorithms vs Approximation Algorithms 10.4230/LIPIcs.FSTTCS.2008.1767
• Dietmar Berwanger and Laurent Doyen On the Power of Imperfect Information 10.4230/LIPIcs.FSTTCS.2008.1742
• Chandra Chekuri and Nitish Korula Pruning 2-Connected Graphs 10.4230/LIPIcs.FSTTCS.2008.1746
• David Basin, Felix Klaedtke, Samuel Müller, and Birgit Pfitzmann Runtime Monitoring of Metric First-order Temporal Properties 10.4230/LIPIcs.FSTTCS.2008.1740
• Chandra Chekuri and Nitish Korula Single-Sink Network Design with Vertex Connectivity Requirements 10.4230/LIPIcs.FSTTCS.2008.1747
• Noam Berger, Nevin Kapur, Leonard Schulman, and Vijay Vazirani Solvency Games 10.4230/LIPIcs.FSTTCS.2008.1741
• V. Arvind and Pushkar S. Joglekar Some Sieving Algorithms for Lattice Problems 10.4230/LIPIcs.FSTTCS.2008.1738
• Takahito Aoto Sound Lemma Generation for Proving Inductive Validity of Equations 10.4230/LIPIcs.FSTTCS.2008.1737
• Sampath Kannan, Sanjeev Khanna, and Sudeepa Roy STCON in Directed Unique-Path Graphs 10.4230/LIPIcs.FSTTCS.2008.1758
• Kazuhiro Inaba and Sebastian Maneth The Complexity of Tree Transducer Output Languages 10.4230/LIPIcs.FSTTCS.2008.1757
• Jonathan Hayman and Glynn Winskel The unfolding of general Petri nets 10.4230/LIPIcs.FSTTCS.2008.1755