IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Proceedings{hariharan_et_al:LIPIcs.FSTTCS.2008, title = {{LIPIcs, Volume 2, FSTTCS'08, Complete Volume}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2013}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008}, URN = {urn:nbn:de:0030-drops-40966}, doi = {10.4230/LIPIcs.FSTTCS.2008}, annote = {Keywords: LIPIcs, Volume 2, FSTTCS'08, Complete Volume} }
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. i-xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hariharan_et_al:LIPIcs.FSTTCS.2008.1772, author = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, title = {{2008 Abstracts Collection -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {i--xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1772}, URN = {urn:nbn:de:0030-drops-17720}, doi = {10.4230/LIPIcs.FSTTCS.2008.1772}, annote = {Keywords: } }
Ramesh Hariharan, Madhavan Mukund, and V Vinay. 2008 Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, p. -1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hariharan_et_al:LIPIcs.FSTTCS.2008.1771, author = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, title = {{2008 Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {-1---1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1771}, URN = {urn:nbn:de:0030-drops-17713}, doi = {10.4230/LIPIcs.FSTTCS.2008.1771}, annote = {Keywords: Preface} }
Samir Datta, Nutan Limaye, and Prajakta Nimbhorkar. 3-connected Planar Graph Isomorphism is in Log-space. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 155-162, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{datta_et_al:LIPIcs.FSTTCS.2008.1749, author = {Datta, Samir and Limaye, Nutan and Nimbhorkar, Prajakta}, title = {{3-connected Planar Graph Isomorphism is in Log-space}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {155--162}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1749}, URN = {urn:nbn:de:0030-drops-17491}, doi = {10.4230/LIPIcs.FSTTCS.2008.1749}, annote = {Keywords: Planar graph isomorphism, three connected graphs, logspace, universal exploration sequence} }
Christian Komusiewicz and Johannes Uhlmann. A Cubic-Vertex Kernel for Flip Consensus Tree. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 280-291, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{komusiewicz_et_al:LIPIcs.FSTTCS.2008.1760, author = {Komusiewicz, Christian and Uhlmann, Johannes}, title = {{A Cubic-Vertex Kernel for Flip Consensus Tree}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {280--291}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1760}, URN = {urn:nbn:de:0030-drops-17600}, doi = {10.4230/LIPIcs.FSTTCS.2008.1760}, annote = {Keywords: Fixed-parameter algorithm, problem kernel, NP-hard problem, graph modification problem, computational phylogenetics} }
Juan Rodriguez-Hortala. A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 328-339, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{rodriguezhortala:LIPIcs.FSTTCS.2008.1764, author = {Rodriguez-Hortala, Juan}, title = {{A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {328--339}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1764}, URN = {urn:nbn:de:0030-drops-17643}, doi = {10.4230/LIPIcs.FSTTCS.2008.1764}, annote = {Keywords: Functional-logic programming, term rewriting systems, constructor-based rewriting logic, non-determinism, call-time choice semantics, run-time choice} }
Alan Frieze and Ravi Kannan. A new approach to the planted clique problem. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 187-198, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{frieze_et_al:LIPIcs.FSTTCS.2008.1752, author = {Frieze, Alan and Kannan, Ravi}, title = {{A new approach to the planted clique problem}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {187--198}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1752}, URN = {urn:nbn:de:0030-drops-17521}, doi = {10.4230/LIPIcs.FSTTCS.2008.1752}, annote = {Keywords: Planted Clique, Tensor, Random Graph} }
Josep Diaz, Lefteris Kirousis, Dieter Mitsche, and Xavier Perez-Gimenez. A new upper bound for 3-SAT. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 163-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{diaz_et_al:LIPIcs.FSTTCS.2008.1750, author = {Diaz, Josep and Kirousis, Lefteris and Mitsche, Dieter and Perez-Gimenez, Xavier}, title = {{A new upper bound for 3-SAT}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {163--174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1750}, URN = {urn:nbn:de:0030-drops-17507}, doi = {10.4230/LIPIcs.FSTTCS.2008.1750}, annote = {Keywords: Satisfiability, 3-SAT, random, threshold} }
Hubert Comon-Lundh. About models of security protocols. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 352-356, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{comonlundh:LIPIcs.FSTTCS.2008.1766, author = {Comon-Lundh, Hubert}, title = {{About models of security protocols}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {352--356}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1766}, URN = {urn:nbn:de:0030-drops-17662}, doi = {10.4230/LIPIcs.FSTTCS.2008.1766}, annote = {Keywords: Protocols, security, concurrency, formal methods} }
Rayna Dimitrova and Bernd Finkbeiner. Abstraction Refinement for Games with Incomplete Information. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 175-186, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{dimitrova_et_al:LIPIcs.FSTTCS.2008.1751, author = {Dimitrova, Rayna and Finkbeiner, Bernd}, title = {{Abstraction Refinement for Games with Incomplete Information}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {175--186}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1751}, URN = {urn:nbn:de:0030-drops-17510}, doi = {10.4230/LIPIcs.FSTTCS.2008.1751}, annote = {Keywords: Automatic abstraction refinement, synthesis} }
Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, and Vishwanath Raman. Algorithms for Game Metrics. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 107-118, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{chatterjee_et_al:LIPIcs.FSTTCS.2008.1745, author = {Chatterjee, Krishnendu and de Alfaro, Luca and Majumdar, Rupak and Raman, Vishwanath}, title = {{Algorithms for Game Metrics}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {107--118}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1745}, URN = {urn:nbn:de:0030-drops-17455}, doi = {10.4230/LIPIcs.FSTTCS.2008.1745}, annote = {Keywords: Algorithms, Metrics, Kernel, Simulation, Bisimulation, Linear Programming, Theory of Reals} }
Daniel Golovin, Anupam Gupta, Amit Kumar, and Kanat Tangwongsan. All-Norms and All-L_p-Norms Approximation Algorithms. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 199-210, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{golovin_et_al:LIPIcs.FSTTCS.2008.1753, author = {Golovin, Daniel and Gupta, Anupam and Kumar, Amit and Tangwongsan, Kanat}, title = {{All-Norms and All-L\underlinep-Norms Approximation Algorithms}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {199--210}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1753}, URN = {urn:nbn:de:0030-drops-17537}, doi = {10.4230/LIPIcs.FSTTCS.2008.1753}, annote = {Keywords: Approximation algorithms, set-cover problems, combinatorial optimization, sampling minkowski norms} }
Stefan Gulan and Henning Fernau. An Optimal Construction of Finite Automata from Regular Expressions. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 211-222, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{gulan_et_al:LIPIcs.FSTTCS.2008.1754, author = {Gulan, Stefan and Fernau, Henning}, title = {{An Optimal Construction of Finite Automata from Regular Expressions}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {211--222}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1754}, URN = {urn:nbn:de:0030-drops-17544}, doi = {10.4230/LIPIcs.FSTTCS.2008.1754}, annote = {Keywords: Finite automata,regular expressions,descriptional complexity} }
Mohamed Faouzi Atig, Ahmed Bouajjani, and Tayssir Touili. Analyzing Asynchronous Programs with Preemption. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 37-48, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{atig_et_al:LIPIcs.FSTTCS.2008.1739, author = {Atig, Mohamed Faouzi and Bouajjani, Ahmed and Touili, Tayssir}, title = {{Analyzing Asynchronous Programs with Preemption}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {37--48}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1739}, URN = {urn:nbn:de:0030-drops-17398}, doi = {10.4230/LIPIcs.FSTTCS.2008.1739}, annote = {Keywords: Multiset Pushdown Systems, Multithreaded Asynchronous Programs, Program verification, Verification algorithms} }
Jean-Yves Marion and Romain Pechoux. Analyzing the Implicit Computational Complexity of object-oriented programs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 316-327, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{marion_et_al:LIPIcs.FSTTCS.2008.1763, author = {Marion, Jean-Yves and Pechoux, Romain}, title = {{Analyzing the Implicit Computational Complexity of object-oriented programs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {316--327}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1763}, URN = {urn:nbn:de:0030-drops-17638}, doi = {10.4230/LIPIcs.FSTTCS.2008.1763}, annote = {Keywords: Implicit computational complexity, object-oriented programs, sup-interpretation, resource upper bounds} }
Marcin Jurdzinski and Ashutosh Trivedi. Average-Time Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 340-351, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{jurdzinski_et_al:LIPIcs.FSTTCS.2008.1765, author = {Jurdzinski, Marcin and Trivedi, Ashutosh}, title = {{Average-Time Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {340--351}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1765}, URN = {urn:nbn:de:0030-drops-17650}, doi = {10.4230/LIPIcs.FSTTCS.2008.1765}, annote = {Keywords: Games on Timed Automata, Mean-payoff Games, Average-Time Games, Game Theory} }
Erich Graedel. Banach-Mazur Games on Graphs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 364-382, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{graedel:LIPIcs.FSTTCS.2008.1768, author = {Graedel, Erich}, title = {{Banach-Mazur Games on Graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {364--382}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1768}, URN = {urn:nbn:de:0030-drops-17684}, doi = {10.4230/LIPIcs.FSTTCS.2008.1768}, annote = {Keywords: Games, strategies, determinacy, positional determinacy, definability, complexity} }
Didier Caucal. Boolean algebras of unambiguous context-free languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 83-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{caucal:LIPIcs.FSTTCS.2008.1743, author = {Caucal, Didier}, title = {{Boolean algebras of unambiguous context-free languages}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {83--94}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1743}, URN = {urn:nbn:de:0030-drops-17436}, doi = {10.4230/LIPIcs.FSTTCS.2008.1743}, annote = {Keywords: Synchronization, deterministic graph grammars} }
Georg Moser, Andreas Schnabl, and Johannes Waldmann. Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 304-315, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{moser_et_al:LIPIcs.FSTTCS.2008.1762, author = {Moser, Georg and Schnabl, Andreas and Waldmann, Johannes}, title = {{Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {304--315}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1762}, URN = {urn:nbn:de:0030-drops-17626}, doi = {10.4230/LIPIcs.FSTTCS.2008.1762}, annote = {Keywords: Term Rewriting, Derivational Complexity, Termination, Automation} }
Telikepalli Kavitha. Dynamic matrix rank with partial lookahead. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 268-279, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{kavitha:LIPIcs.FSTTCS.2008.1759, author = {Kavitha, Telikepalli}, title = {{Dynamic matrix rank with partial lookahead}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {268--279}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1759}, URN = {urn:nbn:de:0030-drops-17594}, doi = {10.4230/LIPIcs.FSTTCS.2008.1759}, annote = {Keywords: Matrix rank, dynamic algorithm, fast matrix multiplication} }
Florian Horn. Explicit Muller Games are PTIME. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 235-243, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{horn:LIPIcs.FSTTCS.2008.1756, author = {Horn, Florian}, title = {{Explicit Muller Games are PTIME}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {235--243}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1756}, URN = {urn:nbn:de:0030-drops-17565}, doi = {10.4230/LIPIcs.FSTTCS.2008.1756}, annote = {Keywords: Games, authomata, model checking} }
Julien Cristau and Florian Horn. Graph Games on Ordinals. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 143-154, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{cristau_et_al:LIPIcs.FSTTCS.2008.1748, author = {Cristau, Julien and Horn, Florian}, title = {{Graph Games on Ordinals}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {143--154}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1748}, URN = {urn:nbn:de:0030-drops-17485}, doi = {10.4230/LIPIcs.FSTTCS.2008.1748}, annote = {Keywords: Games, ordinals, zeno} }
Simon Peyton Jones, Roman Leshchinskiy, Gabriele Keller, and Manuel M T Chakravarty. Harnessing the Multicores: Nested Data Parallelism in Haskell. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 383-414, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{peytonjones_et_al:LIPIcs.FSTTCS.2008.1769, author = {Peyton Jones, Simon and Leshchinskiy, Roman and Keller, Gabriele and Chakravarty, Manuel M T}, title = {{Harnessing the Multicores: Nested Data Parallelism in Haskell}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {383--414}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1769}, URN = {urn:nbn:de:0030-drops-17697}, doi = {10.4230/LIPIcs.FSTTCS.2008.1769}, annote = {Keywords: Nested data parallelism, Vectorisation, Haskell, Program transformation} }
Omid Amini, Fedor Fomin, and Saket Saurabh. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{amini_et_al:LIPIcs.FSTTCS.2008.1736, author = {Amini, Omid and Fomin, Fedor and Saurabh, Saket}, title = {{Implicit Branching and Parameterized Partial Cover Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {1--12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1736}, URN = {urn:nbn:de:0030-drops-17363}, doi = {10.4230/LIPIcs.FSTTCS.2008.1736}, annote = {Keywords: Implicit Branching, Parameterized Algorithms, Partial Dominating Set, Partial Vertex Cover, Local Treewidth} }
Andre Chailloux and Iordanis Kerenidis. Increasing the power of the verifier in Quantum Zero Knowledge. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 95-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{chailloux_et_al:LIPIcs.FSTTCS.2008.1744, author = {Chailloux, Andre and Kerenidis, Iordanis}, title = {{Increasing the power of the verifier in Quantum Zero Knowledge}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {95--106}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1744}, URN = {urn:nbn:de:0030-drops-17446}, doi = {10.4230/LIPIcs.FSTTCS.2008.1744}, annote = {Keywords: Quantum cryptography, zero-knowledge protocols, honest-verifier, quantum semi-honest model, hiddenquantum cryptography, zero-knowledge protocols, honest-verifier, quantum semi-honest model, hidden-bits} }
Leslie G Valiant. Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 415-422, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{valiant:LIPIcs.FSTTCS.2008.1770, author = {Valiant, Leslie G}, title = {{Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {415--422}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1770}, URN = {urn:nbn:de:0030-drops-17703}, doi = {10.4230/LIPIcs.FSTTCS.2008.1770}, annote = {Keywords: Artificial intelligence, knowledge acquisition, knowledge representation,learning, reasoning, robustness} }
Markus Lohrey. Leaf languages and string compression. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 292-303, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{lohrey:LIPIcs.FSTTCS.2008.1761, author = {Lohrey, Markus}, title = {{Leaf languages and string compression}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {292--303}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1761}, URN = {urn:nbn:de:0030-drops-17612}, doi = {10.4230/LIPIcs.FSTTCS.2008.1761}, annote = {Keywords: Leaf languages, string compression, grammar-based compression, complexity theory} }
Uriel Feige. On Estimation Algorithms vs Approximation Algorithms. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 357-363, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{feige:LIPIcs.FSTTCS.2008.1767, author = {Feige, Uriel}, title = {{On Estimation Algorithms vs Approximation Algorithms}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {357--363}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1767}, URN = {urn:nbn:de:0030-drops-17676}, doi = {10.4230/LIPIcs.FSTTCS.2008.1767}, annote = {Keywords: Estimation Algorithms, Approximation Algorithms, Combinatorial Optimization} }
Dietmar Berwanger and Laurent Doyen. On the Power of Imperfect Information. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 73-82, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{berwanger_et_al:LIPIcs.FSTTCS.2008.1742, author = {Berwanger, Dietmar and Doyen, Laurent}, title = {{On the Power of Imperfect Information}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {73--82}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1742}, URN = {urn:nbn:de:0030-drops-17427}, doi = {10.4230/LIPIcs.FSTTCS.2008.1742}, annote = {Keywords: Infinite games, imperfect information} }
Chandra Chekuri and Nitish Korula. Pruning 2-Connected Graphs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 119-130, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{chekuri_et_al:LIPIcs.FSTTCS.2008.1746, author = {Chekuri, Chandra and Korula, Nitish}, title = {{Pruning 2-Connected Graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {119--130}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1746}, URN = {urn:nbn:de:0030-drops-17469}, doi = {10.4230/LIPIcs.FSTTCS.2008.1746}, annote = {Keywords: 2-Connected Graphs, k-MST, Density, Approximation} }
David Basin, Felix Klaedtke, Samuel Müller, and Birgit Pfitzmann. Runtime Monitoring of Metric First-order Temporal Properties. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{basin_et_al:LIPIcs.FSTTCS.2008.1740, author = {Basin, David and Klaedtke, Felix and M\"{u}ller, Samuel and Pfitzmann, Birgit}, title = {{Runtime Monitoring of Metric First-order Temporal Properties}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {49--60}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1740}, URN = {urn:nbn:de:0030-drops-17404}, doi = {10.4230/LIPIcs.FSTTCS.2008.1740}, annote = {Keywords: Runtime Monitoring, Metric First-order Temporal Logic, Automatic Structures, Temporal Databases} }
Chandra Chekuri and Nitish Korula. Single-Sink Network Design with Vertex Connectivity Requirements. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 131-142, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{chekuri_et_al:LIPIcs.FSTTCS.2008.1747, author = {Chekuri, Chandra and Korula, Nitish}, title = {{Single-Sink Network Design with Vertex Connectivity Requirements}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {131--142}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1747}, URN = {urn:nbn:de:0030-drops-17475}, doi = {10.4230/LIPIcs.FSTTCS.2008.1747}, annote = {Keywords: Network Design, Vertex Connectivity, Buy-at-Bulk, Rent-or-Buy, Approximation} }
Noam Berger, Nevin Kapur, Leonard Schulman, and Vijay Vazirani. Solvency Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 61-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{berger_et_al:LIPIcs.FSTTCS.2008.1741, author = {Berger, Noam and Kapur, Nevin and Schulman, Leonard and Vazirani, Vijay}, title = {{Solvency Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {61--72}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1741}, URN = {urn:nbn:de:0030-drops-17419}, doi = {10.4230/LIPIcs.FSTTCS.2008.1741}, annote = {Keywords: Decision making under uncertainity, multi-arm bandit problems, game theory} }
V. Arvind and Pushkar S. Joglekar. Some Sieving Algorithms for Lattice Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 25-36, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2008.1738, author = {Arvind, V. and Joglekar, Pushkar S.}, title = {{Some Sieving Algorithms for Lattice Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {25--36}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1738}, URN = {urn:nbn:de:0030-drops-17380}, doi = {10.4230/LIPIcs.FSTTCS.2008.1738}, annote = {Keywords: Lattice problems, sieving algorithm, closest vector problem} }
Takahito Aoto. Sound Lemma Generation for Proving Inductive Validity of Equations. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 13-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{aoto:LIPIcs.FSTTCS.2008.1737, author = {Aoto, Takahito}, title = {{Sound Lemma Generation for Proving Inductive Validity of Equations}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {13--24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1737}, URN = {urn:nbn:de:0030-drops-17379}, doi = {10.4230/LIPIcs.FSTTCS.2008.1737}, annote = {Keywords: Sound generalization, inductive theorem, automated theorem proving, term rewriting} }
Sampath Kannan, Sanjeev Khanna, and Sudeepa Roy. STCON in Directed Unique-Path Graphs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 256-267, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{kannan_et_al:LIPIcs.FSTTCS.2008.1758, author = {Kannan, Sampath and Khanna, Sanjeev and Roy, Sudeepa}, title = {{STCON in Directed Unique-Path Graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {256--267}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1758}, URN = {urn:nbn:de:0030-drops-17589}, doi = {10.4230/LIPIcs.FSTTCS.2008.1758}, annote = {Keywords: Algorithm, complexity, st-connectivity} }
Kazuhiro Inaba and Sebastian Maneth. The Complexity of Tree Transducer Output Languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 244-255, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{inaba_et_al:LIPIcs.FSTTCS.2008.1757, author = {Inaba, Kazuhiro and Maneth, Sebastian}, title = {{The Complexity of Tree Transducer Output Languages}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {244--255}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1757}, URN = {urn:nbn:de:0030-drops-17570}, doi = {10.4230/LIPIcs.FSTTCS.2008.1757}, annote = {Keywords: Complexity, Tree Transducer, OI-hierarchy, Context-Sensitive} }
Jonathan Hayman and Glynn Winskel. The unfolding of general Petri nets. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 2, pp. 223-234, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
@InProceedings{hayman_et_al:LIPIcs.FSTTCS.2008.1755, author = {Hayman, Jonathan and Winskel, Glynn}, title = {{The unfolding of general Petri nets}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {223--234}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-08-8}, ISSN = {1868-8969}, year = {2008}, volume = {2}, editor = {Hariharan, Ramesh and Mukund, Madhavan and Vinay, V}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2008.1755}, URN = {urn:nbn:de:0030-drops-17552}, doi = {10.4230/LIPIcs.FSTTCS.2008.1755}, annote = {Keywords: Petri nets, symmetry, unfolding} }
Feedback for Dagstuhl Publishing