The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2002, volume: 275, number: 1-2

  1. Mingsheng Ying
    Bisimulation indexes and their applications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:1-68 [Journal]
  2. Bruce S. Burdick
    A note on iterated duals of certain topological spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:69-77 [Journal]
  3. Ernest G. Manes
    Taut Monads and T0-spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:79-109 [Journal]
  4. Alexander Moshe Rabinovich
    Finite variability interpretation of monadic logic of order. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:111-125 [Journal]
  5. Nadia Busi
    Analysis issues in Petri nets with inhibitor arcs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:127-177 [Journal]
  6. Serge Abiteboul, Sophie Cluet, Tova Milo
    Correspondence and translation for heterogeneous data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:179-213 [Journal]
  7. Dominic Duggan, John Ophel
    Open and closed scopes for constrained genericity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:215-258 [Journal]
  8. Pierpaolo Degano, Fabio Gadducci, Corrado Priami
    A causal semantics for CCS via rewriting logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:259-282 [Journal]
  9. Iain A. Stewart
    Program schemes, arrays, Lindström quantifiers and zero-one laws. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:283-310 [Journal]
  10. Igor Walukiewicz
    Monadic second-order logic on tree-like structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:311-346 [Journal]
  11. Danièle Beauquier, Anatol Slissenko
    Decidable verification for reducible timed automata specified in a first order logic with time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:347-388 [Journal]
  12. Maria I. Sessa
    Approximate reasoning by similarity-based SLD resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:389-426 [Journal]
  13. Jirí Adámek, Michel Hébert, Jirí Rosický
    On abstract data types presented by multiequations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:427-462 [Journal]
  14. Sergei G. Vorobyov
    forall-Exists5-equational theory of context unification is undecidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:463-479 [Journal]
  15. Mingsheng Ying
    Additive models of probabilistic processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:481-519 [Journal]
  16. Agostino Cortesi, Agostino Dovier, Elisa Quintarelli, Letizia Tanca
    Operational and abstract semantics of the query language G-Log. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:521-560 [Journal]
  17. Ernst Zimmermann
    Peirce's Rule in Natural Deduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:561-574 [Journal]
  18. Felice Cardone
    A coinductive completeness proof for the equivalence of recursive types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:575-587 [Journal]
  19. Walter Vogler
    Efficiency of asynchronous systems, read arcs, and the MUTEX-problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:589-631 [Journal]
  20. Frank Neven, Thomas Schwentick
    Query automata over finite trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:633-674 [Journal]
  21. Adel Bouhoula, Michaël Rusinowitch
    Observational proofs by rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:675-698 [Journal]
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