Ravi Kannan and K. Narayan Kumar. LIPIcs, Volume 4, FSTTCS'09, Complete Volume. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@Proceedings{kannan_et_al:LIPIcs.FSTTCS.2009, title = {{LIPIcs, Volume 4, FSTTCS'09, 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-13-2}, ISSN = {1868-8969}, year = {2013}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009}, URN = {urn:nbn:de:0030-drops-40987}, doi = {10.4230/LIPIcs.FSTTCS.2009}, annote = {Keywords: LIPIcs, Volume 4, FSTTCS'09, Complete Volume} }
Ravi Kannan and K. Narayan Kumar. Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. i-vii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{kannan_et_al:LIPIcs.FSTTCS.2009.2341, author = {Kannan, Ravi and Narayan Kumar, K.}, title = {{Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009)}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {i--vii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2341}, URN = {urn:nbn:de:0030-drops-23415}, doi = {10.4230/LIPIcs.FSTTCS.2009.2341}, annote = {Keywords: Preface, proceedings, FSTTCS, referees, programme committee, organising committee} }
Parosh A. Abdulla, Yu-Fang Chen, Lukas Holik, and Tomas Vojnar. Mediating for Reduction (on Minimizing Alternating Büchi Automata). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 1-12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{abdulla_et_al:LIPIcs.FSTTCS.2009.2302, author = {Abdulla, Parosh A. and Chen, Yu-Fang and Holik, Lukas and Vojnar, Tomas}, title = {{Mediating for Reduction (on Minimizing Alternating B\"{u}chi Automata)}}, 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-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2302}, URN = {urn:nbn:de:0030-drops-23027}, doi = {10.4230/LIPIcs.FSTTCS.2009.2302}, annote = {Keywords: Alternating Automata, Buchi Automata, Automata Minimization, Buchi Automata Complementation, Simulation Preorder, forward and backward simulation, mediated equivalence} }
Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, and Richard J. Lipton. Algorithms for Message Ferrying on Mobile ad hoc Networks. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 13-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{ammar_et_al:LIPIcs.FSTTCS.2009.2303, author = {Ammar, Mostafa and Chakrabarty, Deeparnab and Sarma, Atish Das and Kalyanasundaram, Subrahmanyam and Lipton, Richard J.}, title = {{Algorithms for Message Ferrying on Mobile ad hoc Networks}}, 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-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2303}, URN = {urn:nbn:de:0030-drops-23031}, doi = {10.4230/LIPIcs.FSTTCS.2009.2303}, annote = {Keywords: Algorithms, Network Algorithms, Routing, TSP, Buffer Optimization} }
Vikraman Arvind, Pushkar S. Joglekar, and Srikanth Srinivasan. Arithmetic Circuits and the Hadamard Product of Polynomials. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 25-36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2009.2304, author = {Arvind, Vikraman and Joglekar, Pushkar S. and Srinivasan, Srikanth}, title = {{Arithmetic Circuits and the Hadamard Product of Polynomials}}, 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-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2304}, URN = {urn:nbn:de:0030-drops-23046}, doi = {10.4230/LIPIcs.FSTTCS.2009.2304}, annote = {Keywords: Hadamard product, identity testing, lower bounds, algebraic branching programs} }
Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, and Stéphan Thomassé. Kernels for Feedback Arc Set In Tournaments. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 37-47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{bessy_et_al:LIPIcs.FSTTCS.2009.2305, author = {Bessy, St\'{e}phane and Fomin, Fedor V. and Gaspers, Serge and Paul, Christophe and Perez, Anthony and Saurabh, Saket and Thomass\'{e}, St\'{e}phan}, title = {{Kernels for Feedback Arc Set In Tournaments}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {37--47}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2305}, URN = {urn:nbn:de:0030-drops-23055}, doi = {10.4230/LIPIcs.FSTTCS.2009.2305}, annote = {Keywords: Parameterized complexity, kernels, tournaments} }
Tomas Brazdil, Javier Esparza, and Stefan Kiefer. On the Memory Consumption of Probabilistic Pushdown Automata. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 49-60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{brazdil_et_al:LIPIcs.FSTTCS.2009.2306, author = {Brazdil, Tomas and Esparza, Javier and Kiefer, Stefan}, title = {{On the Memory Consumption of Probabilistic Pushdown Automata}}, 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-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2306}, URN = {urn:nbn:de:0030-drops-23067}, doi = {10.4230/LIPIcs.FSTTCS.2009.2306}, annote = {Keywords: Pushdown automata, probabilistic systems, verification} }
Tomas Brazdil, Vojtech Forejt, Jan Krcal, Jan Kretinsky, and Antonin Kucera. Continuous-Time Stochastic Games with Time-Bounded Reachability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 61-72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{brazdil_et_al:LIPIcs.FSTTCS.2009.2307, author = {Brazdil, Tomas and Forejt, Vojtech and Krcal, Jan and Kretinsky, Jan and Kucera, Antonin}, title = {{Continuous-Time Stochastic Games with Time-Bounded Reachability}}, 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-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2307}, URN = {urn:nbn:de:0030-drops-23077}, doi = {10.4230/LIPIcs.FSTTCS.2009.2307}, annote = {Keywords: Continuous time stochastic systems, time bounded reachability, stochastic games} }
Mikolaj Bojanczyk and Szymon Torunczyk. Deterministic Automata and Extensions of Weak MSO. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 73-84, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{bojanczyk_et_al:LIPIcs.FSTTCS.2009.2308, author = {Bojanczyk, Mikolaj and Torunczyk, Szymon}, title = {{Deterministic Automata and Extensions of Weak MSO}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {73--84}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2308}, URN = {urn:nbn:de:0030-drops-23081}, doi = {10.4230/LIPIcs.FSTTCS.2009.2308}, annote = {Keywords: Deterministic automata, Weak MSO, min-automata, max-automata, BS-automata} }
Laura Bozzelli, Axel Legay, and Sophie Pinchinat. On Timed Alternating Simulation for Concurrent Timed Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 85-96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{bozzelli_et_al:LIPIcs.FSTTCS.2009.2309, author = {Bozzelli, Laura and Legay, Axel and Pinchinat, Sophie}, title = {{On Timed Alternating Simulation for Concurrent Timed Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {85--96}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2309}, URN = {urn:nbn:de:0030-drops-23092}, doi = {10.4230/LIPIcs.FSTTCS.2009.2309}, annote = {Keywords: Concurrent Timed Games, Timed Alternating Simulation, Timed Alternating Temporal Logics} }
Laurent Braud. Covering of ordinals. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 97-108, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{braud:LIPIcs.FSTTCS.2009.2310, author = {Braud, Laurent}, title = {{Covering of ordinals}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {97--108}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2310}, URN = {urn:nbn:de:0030-drops-23108}, doi = {10.4230/LIPIcs.FSTTCS.2009.2310}, annote = {Keywords: Ordinal theory, pushdown hierarchy, fundamental sequence, monadic second-order logic, prefix-recognizable graphs} }
Mark Braverman, Stephen Cook, Pierre McKenzie, Rahul Santhanam, and Dustin Wehr. Fractional Pebbling and Thrifty Branching Programs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 109-120, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{braverman_et_al:LIPIcs.FSTTCS.2009.2311, author = {Braverman, Mark and Cook, Stephen and McKenzie, Pierre and Santhanam, Rahul and Wehr, Dustin}, title = {{Fractional Pebbling and Thrifty Branching Programs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {109--120}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2311}, URN = {urn:nbn:de:0030-drops-23111}, doi = {10.4230/LIPIcs.FSTTCS.2009.2311}, annote = {Keywords: Branching programs, space complexity, tree evaluation, pebbling} }
Jérémie Cabessa, Jacques Duparc, Alessandro Facchini, and Filip Murlak. The Wadge Hierarchy of Max-Regular Languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 121-132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{cabessa_et_al:LIPIcs.FSTTCS.2009.2312, author = {Cabessa, J\'{e}r\'{e}mie and Duparc, Jacques and Facchini, Alessandro and Murlak, Filip}, title = {{The Wadge Hierarchy of Max-Regular Languages}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {121--132}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2312}, URN = {urn:nbn:de:0030-drops-23122}, doi = {10.4230/LIPIcs.FSTTCS.2009.2312}, annote = {Keywords: Max-regular languages, Wadge hierarchy, Wagner hierarchy} }
Julien Cristau. Automata and temporal logic over arbitrary linear time. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 133-144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{cristau:LIPIcs.FSTTCS.2009.2313, author = {Cristau, Julien}, title = {{Automata and temporal logic over arbitrary linear time}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {133--144}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2313}, URN = {urn:nbn:de:0030-drops-23132}, doi = {10.4230/LIPIcs.FSTTCS.2009.2313}, annote = {Keywords: LTL, linear orderings, automata} }
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, and Fabian Wagner. Graph Isomorphism for K_{3,3}-free and K_5-free graphs is in Log-space. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 145-156, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{datta_et_al:LIPIcs.FSTTCS.2009.2314, author = {Datta, Samir and Nimbhorkar, Prajakta and Thierauf, Thomas and Wagner, Fabian}, title = {{Graph Isomorphism for K\underline\{3,3\}-free and K\underline5-free graphs is in Log-space}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {145--156}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2314}, URN = {urn:nbn:de:0030-drops-23144}, doi = {10.4230/LIPIcs.FSTTCS.2009.2314}, annote = {Keywords: Graph isomorphism, K\underline\{3,3\}-free graphs, K\underline5-free graphs, log-space} }
Anuj Dawar and Stephan Kreutzer. Domination Problems in Nowhere-Dense Classes. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 157-168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{dawar_et_al:LIPIcs.FSTTCS.2009.2315, author = {Dawar, Anuj and Kreutzer, Stephan}, title = {{Domination Problems in Nowhere-Dense Classes}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {157--168}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2315}, URN = {urn:nbn:de:0030-drops-23153}, doi = {10.4230/LIPIcs.FSTTCS.2009.2315}, annote = {Keywords: Dominating Set, distance-d dominating set, nowhere-dense graph classes, H-minor free graphs, fixed-parameter tractablility} }
Stéphanie Delaune, Steve Kremer, and Olivier Pereira. Simulation based security in the applied pi calculus. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 169-180, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{delaune_et_al:LIPIcs.FSTTCS.2009.2316, author = {Delaune, St\'{e}phanie and Kremer, Steve and Pereira, Olivier}, title = {{Simulation based security in the applied pi calculus}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {169--180}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2316}, URN = {urn:nbn:de:0030-drops-23163}, doi = {10.4230/LIPIcs.FSTTCS.2009.2316}, annote = {Keywords: Simulation based security, applied pi calculus, joint state theorem, authentication protocols} }
Stéphane Demri, Marcin Jurdzinski, Oded Lachish, and Ranko Lazic. The Covering and Boundedness Problems for Branching Vector Addition Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 181-192, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{demri_et_al:LIPIcs.FSTTCS.2009.2317, author = {Demri, St\'{e}phane and Jurdzinski, Marcin and Lachish, Oded and Lazic, Ranko}, title = {{The Covering and Boundedness Problems for Branching Vector Addition Systems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {181--192}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2317}, URN = {urn:nbn:de:0030-drops-23173}, doi = {10.4230/LIPIcs.FSTTCS.2009.2317}, annote = {Keywords: Vector addition systems, Petri nets, covering, boundedness, computational complexity} }
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. Subexponential Algorithms for Partial Cover Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 193-201, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2009.2318, author = {Fomin, Fedor V. and Lokshtanov, Daniel and Raman, Venkatesh and Saurabh, Saket}, title = {{Subexponential Algorithms for Partial Cover Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {193--201}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2318}, URN = {urn:nbn:de:0030-drops-23186}, doi = {10.4230/LIPIcs.FSTTCS.2009.2318}, annote = {Keywords: Partial cover problems, parameterized complexity, subexponential time algorithms, irrelevant vertex technique} }
Konstantinos Georgiou, Avner Magen, and Iannis Tourlakis. On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 203-214, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{georgiou_et_al:LIPIcs.FSTTCS.2009.2319, author = {Georgiou, Konstantinos and Magen, Avner and Tourlakis, Iannis}, title = {{On the Tightening of the Standard SDP for Vertex Cover with \$ell\underline1\$ Inequalities}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {203--214}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2319}, URN = {urn:nbn:de:0030-drops-23195}, doi = {10.4230/LIPIcs.FSTTCS.2009.2319}, annote = {Keywords: Semidefinite Programming, Vertex Cover, Integrality Gap, Hypermetric Inequalities} }
John M. Hitchcock, Aduri Pavan, and N. V. Vinodchandran. Kolmogorov Complexity in Randomness Extraction. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 215-226, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{hitchcock_et_al:LIPIcs.FSTTCS.2009.2320, author = {Hitchcock, John M. and Pavan, Aduri and Vinodchandran, N. V.}, title = {{Kolmogorov Complexity in Randomness Extraction}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {215--226}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2320}, URN = {urn:nbn:de:0030-drops-23201}, doi = {10.4230/LIPIcs.FSTTCS.2009.2320}, annote = {Keywords: Extractors, Kolmogorov extractors, randomness} }
Chien-Chung Huang and Zoya Svitkina. Donation Center Location Problem. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 227-238, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{huang_et_al:LIPIcs.FSTTCS.2009.2321, author = {Huang, Chien-Chung and Svitkina, Zoya}, title = {{Donation Center Location Problem}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {227--238}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2321}, URN = {urn:nbn:de:0030-drops-23212}, doi = {10.4230/LIPIcs.FSTTCS.2009.2321}, annote = {Keywords: Approximation Algorithms, Facility Location, Matching with Preferences} }
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, and Jérémie Roland. Non-Local Box Complexity and Secure Function Evaluation. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 239-250, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{kaplan_et_al:LIPIcs.FSTTCS.2009.2322, author = {Kaplan, Marc and Kerenidis, Iordanis and Laplante, Sophie and Roland, J\'{e}r\'{e}mie}, title = {{Non-Local Box Complexity and Secure Function Evaluation}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {239--250}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2322}, URN = {urn:nbn:de:0030-drops-23226}, doi = {10.4230/LIPIcs.FSTTCS.2009.2322}, annote = {Keywords: Communication complexity, non-locality, non-local boxes, secure function evaluation} }
Mark Kattenbelt and Michael Huth. Verification and Refutation of Probabilistic Specifications via Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 251-262, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{kattenbelt_et_al:LIPIcs.FSTTCS.2009.2323, author = {Kattenbelt, Mark and Huth, Michael}, title = {{Verification and Refutation of Probabilistic Specifications via Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {251--262}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2323}, URN = {urn:nbn:de:0030-drops-23233}, doi = {10.4230/LIPIcs.FSTTCS.2009.2323}, annote = {Keywords: Probabilistic model checking, Markov decision processes, Abstraction preorder, Stochastic two-player games} }
Rohit Khandekar, Guy Kortsarz, and Zeev Nutov. Approximating Fault-Tolerant Group-Steiner Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 263-274, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{khandekar_et_al:LIPIcs.FSTTCS.2009.2324, author = {Khandekar, Rohit and Kortsarz, Guy and Nutov, Zeev}, title = {{Approximating Fault-Tolerant Group-Steiner Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {263--274}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2324}, URN = {urn:nbn:de:0030-drops-23243}, doi = {10.4230/LIPIcs.FSTTCS.2009.2324}, annote = {Keywords: Fault-tolerance, group Steiner problem, edge-disjointness, vertex-disjointness, approximation, connectivity} }
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, Deepak Rajan, Jay Sethuraman, and Joel Wolf. Bounded Size Graph Clustering with Applications to Stream Processing. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 275-286, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{khandekar_et_al:LIPIcs.FSTTCS.2009.2325, author = {Khandekar, Rohit and Hildrum, Kirsten and Parekh, Sujay and Rajan, Deepak and Sethuraman, Jay and Wolf, Joel}, title = {{Bounded Size Graph Clustering with Applications to Stream Processing}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {275--286}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2325}, URN = {urn:nbn:de:0030-drops-23250}, doi = {10.4230/LIPIcs.FSTTCS.2009.2325}, annote = {Keywords: Graph partitioning, uncrossing, Gomory-Hu trees, symmetric submodular functions} }
Joachim Kneis, Alexander Langer, and Peter Rossmanith. A Fine-grained Analysis of a Simple Independent Set Algorithm. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 287-298, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{kneis_et_al:LIPIcs.FSTTCS.2009.2326, author = {Kneis, Joachim and Langer, Alexander and Rossmanith, Peter}, title = {{A Fine-grained Analysis of a Simple Independent Set Algorithm}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {287--298}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2326}, URN = {urn:nbn:de:0030-drops-23269}, doi = {10.4230/LIPIcs.FSTTCS.2009.2326}, annote = {Keywords: Exact Algorithms, Independent Set, Computer-aided Proof} }
Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, and Jayalal Sarma M. N.. Using Elimination Theory to construct Rigid Matrices. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 299-310, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{kumar_et_al:LIPIcs.FSTTCS.2009.2327, author = {Kumar, Abhinav and Lokam, Satyanarayana V. and Patankar, Vijay M. and Sarma M. N., Jayalal}, title = {{Using Elimination Theory to construct Rigid Matrices}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {299--310}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2327}, URN = {urn:nbn:de:0030-drops-23278}, doi = {10.4230/LIPIcs.FSTTCS.2009.2327}, annote = {Keywords: Matrix Rigidity, Lower Bounds, Circuit Complexity} }
Christof Löding and Karianto Wong. On Nondeterministic Unranked Tree Automata with Sibling Constraints. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 311-322, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{loding_et_al:LIPIcs.FSTTCS.2009.2328, author = {L\"{o}ding, Christof and Wong, Karianto}, title = {{On Nondeterministic Unranked Tree Automata with Sibling Constraints}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {311--322}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2328}, URN = {urn:nbn:de:0030-drops-23281}, doi = {10.4230/LIPIcs.FSTTCS.2009.2328}, annote = {Keywords: Unranked tree automata, equality and disequality constraints, monadic second-order logic} }
André Madeira and S. Muthukrishnan. Functionally Private Approximations of Negligibly-Biased Estimators. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 323-334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{madeira_et_al:LIPIcs.FSTTCS.2009.2329, author = {Madeira, Andr\'{e} and Muthukrishnan, S.}, title = {{Functionally Private Approximations of Negligibly-Biased Estimators}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {323--334}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2329}, URN = {urn:nbn:de:0030-drops-23298}, doi = {10.4230/LIPIcs.FSTTCS.2009.2329}, annote = {Keywords: Functional privacy, privacy, data streams, #P-complete} }
Soumya Paul and Sunil Simon. Nash Equilibrium in Generalised Muller Games. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 335-346, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{paul_et_al:LIPIcs.FSTTCS.2009.2330, author = {Paul, Soumya and Simon, Sunil}, title = {{Nash Equilibrium in Generalised Muller Games}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {335--346}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2330}, URN = {urn:nbn:de:0030-drops-23304}, doi = {10.4230/LIPIcs.FSTTCS.2009.2330}, annote = {Keywords: Infinite games on graphs, Muller games, Nash equilibrium, subgame perfect equilibrium} }
M. Praveen and Kamal Lodaya. Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 347-358, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{praveen_et_al:LIPIcs.FSTTCS.2009.2331, author = {Praveen, M. and Lodaya, Kamal}, title = {{Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {347--358}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2331}, URN = {urn:nbn:de:0030-drops-23314}, doi = {10.4230/LIPIcs.FSTTCS.2009.2331}, annote = {Keywords: Petri nets, Coverability, Boundedness, paraPSPACE} }
Alexander Rabinovich. Synthesis of Finite-state and Definable Winning Strategies. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 359-370, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{rabinovich:LIPIcs.FSTTCS.2009.2332, author = {Rabinovich, Alexander}, title = {{Synthesis of Finite-state and Definable Winning Strategies}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {359--370}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2332}, URN = {urn:nbn:de:0030-drops-23320}, doi = {10.4230/LIPIcs.FSTTCS.2009.2332}, annote = {Keywords: Games of ordinal length, Church Synthesis Problem, Monadic Logic, Composition Method} }
Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena. The Power of Depth 2 Circuits over Algebras. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 371-382, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{saha_et_al:LIPIcs.FSTTCS.2009.2333, author = {Saha, Chandan and Saptharishi, Ramprasad and Saxena, Nitin}, title = {{The Power of Depth 2 Circuits over Algebras}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {371--382}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2333}, URN = {urn:nbn:de:0030-drops-23334}, doi = {10.4230/LIPIcs.FSTTCS.2009.2333}, annote = {Keywords: Polynomial identity testing, depth 3 circuits, matrix algebras, local rings} }
Ankur Taly and Ashish Tiwari. Deductive Verification of Continuous Dynamical Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 383-394, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{taly_et_al:LIPIcs.FSTTCS.2009.2334, author = {Taly, Ankur and Tiwari, Ashish}, title = {{Deductive Verification of Continuous Dynamical Systems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {383--394}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2334}, URN = {urn:nbn:de:0030-drops-23342}, doi = {10.4230/LIPIcs.FSTTCS.2009.2334}, annote = {Keywords: Deductive Verification, inductive invariants, continuous and hybrid dynamical systems, Theory of Reals} }
Mathieu Tracol, Christel Baier, and Marcus Grösser. Recurrence and Transience for Probabilistic Automata. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 395-406, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{tracol_et_al:LIPIcs.FSTTCS.2009.2335, author = {Tracol, Mathieu and Baier, Christel and Gr\"{o}sser, Marcus}, title = {{Recurrence and Transience for Probabilistic Automata}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {395--406}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2335}, URN = {urn:nbn:de:0030-drops-23357}, doi = {10.4230/LIPIcs.FSTTCS.2009.2335}, annote = {Keywords: Markov Chains, Probabilistic Automata, Buchi Automata, Recurrence, Omega-Regular Properties} }
Anuj Dawar. Structure and Specification as Sources of Complexity. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 407-416, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{dawar:LIPIcs.FSTTCS.2009.2336, author = {Dawar, Anuj}, title = {{Structure and Specification as Sources of Complexity}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {407--416}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2336}, URN = {urn:nbn:de:0030-drops-23365}, doi = {10.4230/LIPIcs.FSTTCS.2009.2336}, annote = {Keywords: Computational Complexity, Descriptive Complexity, Logical Complexity, Parametrized Complexity, Locality, Automata} }
Kim G. Larsen. Priced Timed Automata: Theory and Tools. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 417-425, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{larsen:LIPIcs.FSTTCS.2009.2337, author = {Larsen, Kim G.}, title = {{Priced Timed Automata: Theory and Tools}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {417--425}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2337}, URN = {urn:nbn:de:0030-drops-23374}, doi = {10.4230/LIPIcs.FSTTCS.2009.2337}, annote = {Keywords: Timed systems, optimal scheduling, priced timed automata, games, model-checking} }
Martin Odersky and Adriaan Moors. Fighting bit Rot with Types (Experience Report: Scala Collections). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 427-451, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{odersky_et_al:LIPIcs.FSTTCS.2009.2338, author = {Odersky, Martin and Moors, Adriaan}, title = {{Fighting bit Rot with Types (Experience Report: Scala Collections)}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {427--451}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2338}, URN = {urn:nbn:de:0030-drops-23386}, doi = {10.4230/LIPIcs.FSTTCS.2009.2338}, annote = {Keywords: Programming languages, scala, avoiding code duplication, higher-order kinds, type systems, polymorphism, collections library} }
R. Ravi. Iterative Methods in Combinatorial Optimization. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 453-469, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{ravi:LIPIcs.FSTTCS.2009.2339, author = {Ravi, R.}, title = {{Iterative Methods in Combinatorial Optimization}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {453--469}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2339}, URN = {urn:nbn:de:0030-drops-23391}, doi = {10.4230/LIPIcs.FSTTCS.2009.2339}, annote = {Keywords: Iterative methods, combinatorial optimization, network design, approximation algorithms, assignment problem, linear programming} }
Avi Wigderson. Randomness extractors -- applications and constructions. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 471-473, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
@InProceedings{wigderson:LIPIcs.FSTTCS.2009.2340, author = {Wigderson, Avi}, title = {{Randomness extractors -- applications and constructions}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, pages = {471--473}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-13-2}, ISSN = {1868-8969}, year = {2009}, volume = {4}, editor = {Kannan, Ravi and Narayan Kumar, K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2340}, URN = {urn:nbn:de:0030-drops-23407}, doi = {10.4230/LIPIcs.FSTTCS.2009.2340}, annote = {Keywords: Randomness extractors, weak random sources, purification of randomness} }
Feedback for Dagstuhl Publishing