The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1998, volume: 193, number: 1-2

  1. Marcello M. Bonsangue, Franck van Breugel, Jan J. M. M. Rutten
    Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:1-51 [Journal]
  2. Abbas Edalat, Reinhold Heckmann
    A Computational Model for Metric Spaces. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:53-73 [Journal]
  3. Giorgio Ghelli, Benjamin C. Pierce
    Bounded Existentials and Minimal Typing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:75-96 [Journal]
  4. Yoshifumi Manabe, Roberto Baldoni, Michel Raynal, Shigemi Aoyagi
    k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:97-112 [Journal]
  5. Fabio Alessi, Paolo Baldan
    A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:113-127 [Journal]
  6. Henri-Alex Esbelin, Malika More
    Rudimentary Relations and Primitive Recursion: A Toolbox. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:129-148 [Journal]
  7. Kenneth A. Ross, Divesh Srivastava, Peter J. Stuckey, S. Sudarshan
    Foundations of Aggregation Constraints. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:149-179 [Journal]
  8. Thomas Drakengren
    A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in P-omega. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:181-195 [Journal]
  9. Alexander Moshe Rabinovich
    On Translations of Temporal Logic of Actions Into Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:197-214 [Journal]
  10. Marco Cadoli, Luigi Palopoli
    Circumscribing DATALOG: Expressive Power and Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:193, n:1-2, pp:215-244 [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