default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID28th FSTTCS 2008: Bangalore, India
- Ramesh Hariharan, Madhavan Mukund, V. Vinay:
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008, December 9-11, 2008, Bangalore, India. LIPIcs 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2008 - Omid Amini, Fedor V. Fomin, Saket Saurabh:
Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). 1-12 - Takahito Aoto:
Sound Lemma Generation for Proving Inductive Validity of Equations. 13-24 - Vikraman Arvind, Pushkar S. Joglekar:
Some Sieving Algorithms for Lattice Problems. 25-36 - Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili:
Analyzing Asynchronous Programs with Preemption. 37-48 - David A. Basin, Felix Klaedtke, Samuel Müller, Birgit Pfitzmann:
Runtime Monitoring of Metric First-order Temporal Properties. 49-60 - Noam Berger, Nevin Kapur, Leonard J. Schulman
, Vijay V. Vazirani:
Solvency Games. 61-72 - Dietmar Berwanger, Laurent Doyen:
On the Power of Imperfect Information. 73-82 - Didier Caucal:
Boolean algebras of unambiguous context-free languages. 83-94 - André Chailloux, Iordanis Kerenidis:
Increasing the power of the verifier in Quantum Zero Knowledge. 95-106 - Krishnendu Chatterjee, Luca de Alfaro, Rupak Majumdar, Vishwanath Raman:
Algorithms for Game Metrics. 107-118 - Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. 119-130 - Chandra Chekuri, Nitish Korula:
Single-Sink Network Design with Vertex Connectivity Requirements. 131-142 - Julien Cristau, Florian Horn:
Graph Games on Ordinals. 143-154 - Samir Datta, Nutan Limaye, Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space. 155-162 - Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez:
A new upper bound for 3-SAT. 163-174 - Rayna Dimitrova, Bernd Finkbeiner:
Abstraction Refinement for Games with Incomplete Information. 175-186 - Alan M. Frieze, Ravi Kannan:
A new approach to the planted clique problem. 187-198 - Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan:
All-Norms and All-L_p-Norms Approximation Algorithms. 199-210 - Stefan Gulan, Henning Fernau:
An Optimal Construction of Finite Automata from Regular Expressions. 211-222 - Jonathan Hayman, Glynn Winskel:
The unfolding of general Petri nets. 223-234 - Florian Horn:
Explicit Muller Games are PTIME. 235-243 - Kazuhiro Inaba, Sebastian Maneth:
The Complexity of Tree Transducer Output Languages. 244-255 - Sampath Kannan, Sanjeev Khanna, Sudeepa Roy:
STCON in Directed Unique-Path Graphs. 256-267 - Telikepalli Kavitha:
Dynamic matrix rank with partial lookahead. 268-279 - Christian Komusiewicz, Johannes Uhlmann:
A Cubic-Vertex Kernel for Flip Consensus Tree. 280-291 - Markus Lohrey:
Leaf languages and string compression. 292-303 - Georg Moser, Andreas Schnabl, Johannes Waldmann:
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. 304-315 - Jean-Yves Marion, Romain Péchoux:
Analyzing the Implicit Computational Complexity of object-oriented programs. 316-327 - Juan Rodríguez-Hortalá:
A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems. 328-339 - Marcin Jurdzinski, Ashutosh Trivedi:
Average-Time Games. 340-351 - Hubert Comon-Lundh:
About models of security protocols. 352-356 - Uriel Feige:
On Estimation Algorithms vs Approximation Algorithms. 357-363 - Erich Grädel:
Banach-Mazur Games on Graphs. 364-382 - Simon L. Peyton Jones, Roman Leshchinskiy, Gabriele Keller, Manuel M. T. Chakravarty:
Harnessing the Multicores: Nested Data Parallelism in Haskell. 383-414 - Leslie G. Valiant:
Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. 415-422 - Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. i - Ramesh Hariharan, Madhavan Mukund, V. Vinay:
2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. 10
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-10-02 20:50 CEST 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:
