The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Eli Biham
    How to decrypt or even substitute DES-encrypted messages in 228 steps. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:117-124 [Journal]
  2. Seung Mo Cho, Hyung-Ho Kim, Sung Deok Cha, Doo-Hwan Bae
    A semantics of sequence diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:125-130 [Journal]
  3. Guillaume Fertin, Emmanuel Godard, André Raspaud
    Minimum feedback vertex set and acyclic coloring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:131-139 [Journal]
  4. Zhi-Zhong Chen, Shiqing Zhang
    Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:141-145 [Journal]
  5. Hans Kleine Büning, Xishun Zhao
    Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:147-151 [Journal]
  6. Oded Regev
    Priority algorithms for makespan minimization in the subset model. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:153-157 [Journal]
  7. Roberto Baldoni, Giovanna Melideo
    On the minimal information to encode timestamps in distributed computations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:159-166 [Journal]
  8. Shin-Ichi Nakano
    Efficient generation of plane trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:167-172 [Journal]
  9. Tom Araki, Yukio Shibata
    Erratum to "Pancyclicity of recursive circulant graphs": [Information Processing Letters 81 (2002) 187-190]. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:3, pp:173- [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