The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2002, volume: 83, number: 3

  1. Matthieu Latapy, Clémence Magnien
    Coding distributive lattices with Edge Firing Games. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:125-128 [Journal]
  2. Marek Piotrów
    A note on constructing binary heaps with periodic networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:129-134 [Journal]
  3. L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem
    Walking around fat obstacles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:135-140 [Journal]
  4. Francis Y. L. Chin, Fu Lee Wang
    Efficient algorithm for transversal of disjoint convex polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:141-144 [Journal]
  5. Rafael Dueire Lins
    An efficient algorithm for cyclic reference counting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:145-150 [Journal]
  6. Ricardo A. Baeza-Yates, Hector Soza-Pollman
    Optimal bounded disorder. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:151-157 [Journal]
  7. Alberto Apostolico, Stefano Lonardi
    A speed-up for the commute between subword trees and DAWGs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:159-161 [Journal]
  8. Mohammad Taghi Hajiaghayi, Yashar Ganjali
    A note on the Consecutive Ones Submatrix problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:163-166 [Journal]
  9. Pierre-Yves Schobbens, Gunter Saake, Amílcar Sernadas, Cristina Sernadas
    A two-level temporal logic for evolving specifications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:167-172 [Journal]
  10. Claudio Arbib, Alberto Caprara
    On the stability number of the edge intersection of two graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:173-174 [Journal]
  11. Navneet Malpani, Jianer Chen
    A note on practical construction of maximum bandwidth paths. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:83, n:3, pp:175-180 [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