The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1987, volume: 53, number:

  1. Eric G. Wagner
    A Categorical Treatment of Pre- and Post-Conditions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:3-24 [Journal]
  2. Gilberto Filé
    Classical and Incremental Attribute Evaluation by Means of Recursive Procedures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:25-65 [Journal]
  3. David de Frutos-Escrig
    Probabilistic Ianov's Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:67-97 [Journal]
  4. Guy Louchard
    Random Walks, Gaussian Processes and List Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:99-124 [Journal]
  5. Alex Pelin, Jean H. Gallier
    Building Exact Computation Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:125-150 [Journal]
  6. Alberto Pettorossi
    Derivation of Efficient Programs for Computing Sequences of Actions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:151-167 [Journal]
  7. Hagit Attiya, Yishay Mansour
    Language Complexity on the Synchronous Anonymous Ring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:169-185 [Journal]
  8. Igor Litovsky, Erick Timmerman
    On Generators of Rational omega-Power Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:187-200 [Journal]
  9. Claus-Peter Schnorr
    A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:201-224 [Journal]
  10. Samson Abramsky
    Observation Equivalence as a Testing Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:225-241 [Journal]
  11. Zoltán Ésik, Ferenc Gécseg
    On a Representation of Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:243-255 [Journal]
  12. Haiko Müller, Andreas Brandstädt
    The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:257-265 [Journal]
  13. Meurig Beynon, John Buckle
    On the Planar Monotone Computation of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:267-279 [Journal]
  14. David Peleg, Eli Upfal
    The Generalized Packet Routing Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:281-293 [Journal]
  15. Wojciech Rytter, Raffaele Giancarlo
    Optimal Parallel Parsing of Bracket Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:295-306 [Journal]
  16. Max H. Garzon
    Cyclic Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:307-317 [Journal]
  17. Taishin Y. Nishida, Youichi Kobuchi
    Repeatable Words for Substitution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:319-333 [Journal]
  18. Lars Hallnäs
    An Intensional Characterization of the Largest Bisimulation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:335-343 [Journal]
  19. Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia
    Geometric Containment and Vector Dominance. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:53, n:, pp:345-352 [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