The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2004, volume: 91, number: 4

  1. Jan Poland
    A coding theorem for Enumerable Output Machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:157-161 [Journal]
  2. Pradipta Prometheus Mitra, Muhammad Arshad Ul Abedin, Md. Abul Kashem
    Algorithms for solving the symmetry number problem on trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:163-169 [Journal]
  3. Ramtin Khosravi, Mohammad Ghodsi
    Shortest paths in simple polygons with polygon-meet constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:171-176 [Journal]
  4. Jan Remy
    Resource constrained scheduling on multiple machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:177-182 [Journal]
  5. Raja Jothi, Balaji Raghavachari
    Survivable network design: the capacitated minimum spanning network problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:183-190 [Journal]
  6. Fangguo Zhang, Xiaofeng Chen
    Attack on an ID-based authenticated group key agreement scheme from PKC 2004. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:191-193 [Journal]
  7. Partha Dutta, Rachid Guerraoui, Bastian Pochon
    Fast non-blocking atomic commit: an inherent trade-off. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:91, n:4, pp:195-200 [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