The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1984, volume: 28, number: 3

  1. Manfred K. Warmuth, David Haussler
    On the Complexity of Iterated Shuffle. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:345-358 [Journal]
  2. Michael C. Loui
    Minimizing Access Pointers into Trees and Arrays. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:359-378 [Journal]
  3. Dan E. Willard
    New Trie Data Structures Which Support Very Fast Search Operations. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:379-394 [Journal]
  4. Harry B. Hunt III, Daniel J. Rosenkrantz
    The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:395-419 [Journal]
  5. Errol L. Lloyd, S. S. Ravi
    One-Layer Routing without Component Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:420-438 [Journal]
  6. Robin Milner
    A Complete Inference System for a Class of Regular Behaviours. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:3, pp:439-466 [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