The SCEAS System
Navigation Menu

Conferences in DBLP

IFIP International Conference on Theoretical Computer Science (IFIP TCS) (ifipTCS)
2008 (conf/ifipTCS/2008)

  1. Ambiguity and Complementation in Recognizable Two-dimensional Languages. [Citation Graph (, )][DBLP]

  2. Algorithmic Game Theory: Some Greatest Hits and Future Directions. [Citation Graph (, )][DBLP]

  3. Synchronizing Road Coloring. [Citation Graph (, )][DBLP]

  4. Leader Election in Anonymous Rings: Franklin Goes Probabilistic. [Citation Graph (, )][DBLP]

  5. Inverse Problems Have Inverse Complexity. [Citation Graph (, )][DBLP]

  6. Literal Shuffle of Compressed Words. [Citation Graph (, )][DBLP]

  7. Reconstructing words from a fixed palindromic length sequence. [Citation Graph (, )][DBLP]

  8. The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. [Citation Graph (, )][DBLP]

  9. Partitioning Random Graphs with General Degree Distributions. [Citation Graph (, )][DBLP]

  10. On the Longest Common Factor Problem. [Citation Graph (, )][DBLP]

  11. Stable Dynamics of Sand Automata. [Citation Graph (, )][DBLP]

  12. On tractability of Cops and Robbers game. [Citation Graph (, )][DBLP]

  13. Computability of Tilings. [Citation Graph (, )][DBLP]

  14. A Classification of Degenerate Loop Agreement. [Citation Graph (, )][DBLP]

  15. On the expressive power of univariate equations over sets of natural numbers. [Citation Graph (, )][DBLP]

  16. Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. [Citation Graph (, )][DBLP]

  17. Cache-sensitive Memory Layout for Binary Trees. [Citation Graph (, )][DBLP]

  18. From Processes to ODEs by Chemistry. [Citation Graph (, )][DBLP]

  19. Differential Linear Logic and Processes. [Citation Graph (, )][DBLP]

  20. Solving Monotone Polynomial Equations. [Citation Graph (, )][DBLP]

  21. Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. [Citation Graph (, )][DBLP]

  22. Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. [Citation Graph (, )][DBLP]

  23. µ-calculus Pushdown Module Checking with Imperfect State Information. [Citation Graph (, )][DBLP]

  24. From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. [Citation Graph (, )][DBLP]

  25. On Traits and Types in a Java-like Setting. [Citation Graph (, )][DBLP]

  26. Canonical Sequent Proofs via Multi-Focusing. [Citation Graph (, )][DBLP]

  27. Universal Coinductive Characterisations of Process Semantics. [Citation Graph (, )][DBLP]

  28. Static and dynamic typing for the termination of mobile processes. [Citation Graph (, )][DBLP]

  29. Regular n-ary Queries in Trees and Variable Independence. [Citation Graph (, )][DBLP]

  30. Hamiltonicity of automatic graphs. [Citation Graph (, )][DBLP]

  31. Marking the chops: an unambiguous temporal logic. [Citation Graph (, )][DBLP]

  32. On Boundedness in Depth in the pi-Calculus. [Citation Graph (, )][DBLP]

  33. A Unified View of Tree Automata and Term Schematisations. [Citation Graph (, )][DBLP]

  34. Deconstructing behavioural theories of mobility. [Citation Graph (, )][DBLP]

  35. Adequacy of Compositional Translations for Observational Semantics. [Citation Graph (, )][DBLP]

  36. The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. [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