default search action
29th FSTTCS 2009: Kanpur, India
- Ravi Kannan, K. Narayan Kumar:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India. LIPIcs 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2009, ISBN 978-3-939897-13-2 - Ravi Kannan, K. Narayan Kumar:
Preface -- IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). - Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar:
Mediating for Reduction (on Minimizing Alternating Büchi Automata). 1-12 - Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram
, Richard J. Lipton:
Algorithms for Message Ferrying on Mobile ad hoc Networks. 13-24 - Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
Arithmetic Circuits and the Hadamard Product of Polynomials. 25-36 - Stéphane Bessy, Fedor V. Fomin
Kernels for Feedback Arc Set In Tournaments. 37-47 - Tomás Brázdil, Javier Esparza
On the Memory Consumption of Probabilistic Pushdown Automata. 49-60 - Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera:
Continuous-Time Stochastic Games with Time-Bounded Reachability. 61-72 - Mikolaj Bojanczyk, Szymon Torunczyk
Deterministic Automata and Extensions of Weak MSO. 73-84 - Laura Bozzelli, Axel Legay, Sophie Pinchinat:
On Timed Alternating Simulation for Concurrent Timed Games. 85-96 - Laurent Braud:
Covering of ordinals. 97-108 - Mark Braverman, Stephen A. Cook, Pierre McKenzie, Rahul Santhanam
Fractional Pebbling and Thrifty Branching Programs. 109-120 - Jérémie Cabessa
The Wadge Hierarchy of Max-Regular Languages. 121-132 - Julien Cristau:
Automata and temporal logic over arbitrary linear time. 133-144 - Samir Datta
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. 145-156 - Anuj Dawar
Domination Problems in Nowhere-Dense Classes. 157-168 - Stéphanie Delaune, Steve Kremer
Simulation based security in the applied pi calculus. 169-180 - Stéphane Demri, Marcin Jurdzinski
The Covering and Boundedness Problems for Branching Vector Addition Systems. 181-192 - Fedor V. Fomin
Subexponential Algorithms for Partial Cover Problems. 193-201 - Konstantinos Georgiou, Avner Magen, Iannis Tourlakis:
On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. 203-214 - John M. Hitchcock
Kolmogorov Complexity in Randomness Extraction. 215-226 - Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. 227-238 - Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland
Non-Local Box Complexity and Secure Function Evaluation. 239-250 - Mark Kattenbelt, Michael Huth:
Verification and Refutation of Probabilistic Specifications via Games. 251-262 - Rohit Khandekar, Guy Kortsarz, Zeev Nutov:
Approximating Fault-Tolerant Group-Steiner Problems. 263-274 - Rohit Khandekar, Kirsten Hildrum, Sujay S. Parekh, Deepak Rajan, Jay Sethuraman, Joel L. Wolf:
Bounded Size Graph Clustering with Applications to Stream Processing. 275-286 - Joachim Kneis, Alexander Langer, Peter Rossmanith:
A Fine-grained Analysis of a Simple Independent Set Algorithm. 287-298 - Abhinav Kumar, Satyanarayana V. Lokam, Vijay M. Patankar, Jayalal Sarma:
Using Elimination Theory to construct Rigid Matrices. 299-310 - Christof Löding, Karianto Wong:
On Nondeterministic Unranked Tree Automata with Sibling Constraints. 311-322 - André Madeira, S. Muthukrishnan:
Functionally Private Approximations of Negligibly-Biased Estimators. 323-334 - Soumya Paul, Sunil Easaw Simon:
Nash Equilibrium in Generalised Muller Games. 335-346 - M. Praveen, Kamal Lodaya:
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. 347-358 - Alexander Rabinovich
Synthesis of Finite-state and Definable Winning Strategies. 359-370 - Chandan Saha, Ramprasad Saptharishi
The Power of Depth 2 Circuits over Algebras. 371-382 - Ankur Taly, Ashish Tiwari:
Deductive Verification of Continuous Dynamical Systems. 383-394 - Mathieu Tracol, Christel Baier, Marcus Größer:
Recurrence and Transience for Probabilistic Automata. 395-406 - Anuj Dawar
Structure and Specification as Sources of Complexity. 407-416 - Kim G. Larsen:
Priced Timed Automata: Theory and Tools. 417-425 - Martin Odersky, Adriaan Moors:
Fighting bit Rot with Types (Experience Report: Scala Collections). 427-451 - R. Ravi:
Iterative Methods in Combinatorial Optimization. 453-469 - Avi Wigderson:
Randomness extractors -- applications and constructions. 471-473
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: