The SCEAS System
Navigation Menu

Conferences in DBLP

Foundations of Software Technology and Theoretical Computer Science (FSTTCS) (fsttcs)
2008 (conf/fsttcs/2008)

  1. 2008 Preface - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. [Citation Graph (, )][DBLP]

  2. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). [Citation Graph (, )][DBLP]

  3. 2008 Abstracts Collection - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. [Citation Graph (, )][DBLP]

  4. Sound Lemma Generation for Proving Inductive Validity of Equations. [Citation Graph (, )][DBLP]

  5. Some Sieving Algorithms for Lattice Problems. [Citation Graph (, )][DBLP]

  6. Analyzing Asynchronous Programs with Preemption. [Citation Graph (, )][DBLP]

  7. Runtime Monitoring of Metric First-order Temporal Properties. [Citation Graph (, )][DBLP]

  8. Solvency Games. [Citation Graph (, )][DBLP]

  9. On the Power of Imperfect Information. [Citation Graph (, )][DBLP]

  10. Boolean algebras of unambiguous context-free languages. [Citation Graph (, )][DBLP]

  11. Increasing the power of the verifier in Quantum Zero Knowledge. [Citation Graph (, )][DBLP]

  12. Algorithms for Game Metrics. [Citation Graph (, )][DBLP]

  13. Pruning 2-Connected Graphs. [Citation Graph (, )][DBLP]

  14. Single-Sink Network Design with Vertex Connectivity Requirements. [Citation Graph (, )][DBLP]

  15. Graph Games on Ordinals. [Citation Graph (, )][DBLP]

  16. 3-connected Planar Graph Isomorphism is in Log-space. [Citation Graph (, )][DBLP]

  17. A new upper bound for 3-SAT. [Citation Graph (, )][DBLP]

  18. Abstraction Refinement for Games with Incomplete Information. [Citation Graph (, )][DBLP]

  19. A new approach to the planted clique problem. [Citation Graph (, )][DBLP]

  20. All-Norms and All-L_p-Norms Approximation Algorithms. [Citation Graph (, )][DBLP]

  21. An Optimal Construction of Finite Automata from Regular Expressions. [Citation Graph (, )][DBLP]

  22. The unfolding of general Petri nets. [Citation Graph (, )][DBLP]

  23. Explicit Muller Games are PTIME. [Citation Graph (, )][DBLP]

  24. The Complexity of Tree Transducer Output Languages. [Citation Graph (, )][DBLP]

  25. STCON in Directed Unique-Path Graphs. [Citation Graph (, )][DBLP]

  26. Dynamic matrix rank with partial lookahead. [Citation Graph (, )][DBLP]

  27. A Cubic-Vertex Kernel for Flip Consensus Tree. [Citation Graph (, )][DBLP]

  28. Leaf languages and string compression. [Citation Graph (, )][DBLP]

  29. Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations. [Citation Graph (, )][DBLP]

  30. Analyzing the Implicit Computational Complexity of object-oriented programs. [Citation Graph (, )][DBLP]

  31. A Hierarchy of Semantics for Non-deterministic Term Rewriting Systems. [Citation Graph (, )][DBLP]

  32. Average-Time Games. [Citation Graph (, )][DBLP]

  33. About models of security protocols. [Citation Graph (, )][DBLP]

  34. On Estimation Algorithms vs Approximation Algorithms. [Citation Graph (, )][DBLP]

  35. Banach-Mazur Games on Graphs. [Citation Graph (, )][DBLP]

  36. Harnessing the Multicores: Nested Data Parallelism in Haskell. [Citation Graph (, )][DBLP]

  37. Knowledge Infusion: In Pursuit of Robustness in Artificial Intelligence. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002