The SCEAS System
Navigation Menu

Conferences in DBLP

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


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


  2. Mediating for Reduction (on Minimizing Alternating Büchi Automata). [Citation Graph (, )][DBLP]


  3. Algorithms for Message Ferrying on Mobile ad hoc Networks. [Citation Graph (, )][DBLP]


  4. Arithmetic Circuits and the Hadamard Product of Polynomials. [Citation Graph (, )][DBLP]


  5. Kernels for Feedback Arc Set In Tournaments. [Citation Graph (, )][DBLP]


  6. On the Memory Consumption of Probabilistic Pushdown Automata. [Citation Graph (, )][DBLP]


  7. Continuous-Time Stochastic Games with Time-Bounded Reachability. [Citation Graph (, )][DBLP]


  8. Deterministic Automata and Extensions of Weak MSO. [Citation Graph (, )][DBLP]


  9. On Timed Alternating Simulation for Concurrent Timed Games. [Citation Graph (, )][DBLP]


  10. Covering of ordinals. [Citation Graph (, )][DBLP]


  11. Fractional Pebbling and Thrifty Branching Programs. [Citation Graph (, )][DBLP]


  12. The Wadge Hierarchy of Max-Regular Languages. [Citation Graph (, )][DBLP]


  13. Automata and temporal logic over arbitrary linear time. [Citation Graph (, )][DBLP]


  14. Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. [Citation Graph (, )][DBLP]


  15. Domination Problems in Nowhere-Dense Classes. [Citation Graph (, )][DBLP]


  16. Simulation based security in the applied pi calculus. [Citation Graph (, )][DBLP]


  17. The Covering and Boundedness Problems for Branching Vector Addition Systems. [Citation Graph (, )][DBLP]


  18. Subexponential Algorithms for Partial Cover Problems. [Citation Graph (, )][DBLP]


  19. On the Tightening of the Standard SDP for Vertex Cover with $ell_1$ Inequalities. [Citation Graph (, )][DBLP]


  20. Kolmogorov Complexity in Randomness Extraction. [Citation Graph (, )][DBLP]


  21. Donation Center Location Problem. [Citation Graph (, )][DBLP]


  22. Non-Local Box Complexity and Secure Function Evaluation. [Citation Graph (, )][DBLP]


  23. Verification and Refutation of Probabilistic Specifications via Games. [Citation Graph (, )][DBLP]


  24. Approximating Fault-Tolerant Group-Steiner Problems. [Citation Graph (, )][DBLP]


  25. Bounded Size Graph Clustering with Applications to Stream Processing. [Citation Graph (, )][DBLP]


  26. A Fine-grained Analysis of a Simple Independent Set Algorithm. [Citation Graph (, )][DBLP]


  27. Using Elimination Theory to construct Rigid Matrices. [Citation Graph (, )][DBLP]


  28. On Nondeterministic Unranked Tree Automata with Sibling Constraints. [Citation Graph (, )][DBLP]


  29. Functionally Private Approximations of Negligibly-Biased Estimators. [Citation Graph (, )][DBLP]


  30. Nash Equilibrium in Generalised Muller Games. [Citation Graph (, )][DBLP]


  31. Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE. [Citation Graph (, )][DBLP]


  32. Synthesis of Finite-state and Definable Winning Strategies. [Citation Graph (, )][DBLP]


  33. The Power of Depth 2 Circuits over Algebras. [Citation Graph (, )][DBLP]


  34. Deductive Verification of Continuous Dynamical Systems. [Citation Graph (, )][DBLP]


  35. Recurrence and Transience for Probabilistic Automata. [Citation Graph (, )][DBLP]


  36. Structure and Specification as Sources of Complexity. [Citation Graph (, )][DBLP]


  37. Priced Timed Automata: Theory and Tools. [Citation Graph (, )][DBLP]


  38. Fighting bit Rot with Types (Experience Report: Scala Collections). [Citation Graph (, )][DBLP]


  39. Iterative Methods in Combinatorial Optimization. [Citation Graph (, )][DBLP]


  40. Randomness extractors -- applications and constructions. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002