The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1983, volume: 16, number: 1

  1. Friedhelm Meyer auf der Heide
    Infinite Cube-Connected Cycles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:1-2 [Journal]
  2. Alan A. Bertossi, Maurizio A. Bonuccelli
    Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:3-6 [Journal]
  3. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On the Subword Complexity of Locally Catenative D0L Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:7-9 [Journal]
  4. Vitit Kantabutra
    Traveling Salesman Cycles are not Always Subgraphs of Voronoi Duals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:11-12 [Journal]
  5. Ronald Fagin, Moshe Y. Vardi
    Armstrong Databases for Functional and Inclusion Dependencies. [Citation Graph (5, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:13-19 [Journal]
  6. Aarni Perko
    A Representation of Disjoint Sets with Fast Initialization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:21- [Journal]
  7. Kenneth L. Clarkson
    A Modification of the Greedy Algorithm for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:23-25 [Journal]
  8. Michel Latteux
    On a Language Without Star. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:27-30 [Journal]
  9. Yves Métivier
    About the Rewriting Systems Produced by the Knuth-Bendix Completion Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:31-34 [Journal]
  10. Ralf Hartmut Güting
    Stabbing C-Oriented Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:35-40 [Journal]
  11. Ingo Wegener
    Relating Monotone Formula Size and Monotone Depth of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:41-42 [Journal]
  12. Lewis Neale Lester
    Accuracy of Approximating Queueing Network Departure Processes With Independent Renewal Processes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:1, pp:43-48 [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