The SCEAS System
Navigation Menu

Journals in DBLP

Information and Control
1985, volume: 66, number: 1/2

  1. Ravi Kannan
    Unraveling k-page graphs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:1-5 [Journal]
  2. William C. Rounds
    On the Relationship between Scott Domains, Synchronization Trees, and Metric Spaces [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:6-28 [Journal]
  3. Michal Grabowski
    On Relative Completeness of Hoare Logics [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:29-44 [Journal]
  4. Norbert Blum
    An Area-Maximum Edge Length Trade-off for VLSI Layout [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:45-52 [Journal]
  5. Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou
    The Complexity of Cubical Graphs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:53-60 [Journal]
  6. Greg N. Frederickson
    Implicit Data Structures for Weighted Elements [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:61-82 [Journal]
  7. Orna Grumberg, Nissim Francez, Johann A. Makowsky, Willem P. de Roever
    A Proof Rule for Fair Termination of Guarded Commands [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:83-102 [Journal]
  8. Dung T. Huynh
    The Complexity of Equivalence Problems for Commutative Grammars [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:1/2, pp:103-121 [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