The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Ernst-Erich Doberkat
    Factoring stochastic relations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:161-166 [Journal]
  2. Valerio Freschi, Alessandro Bogliolo
    Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:167-173 [Journal]
  3. Francis Y. L. Chin, Alfredo De Santis, Anna Lisa Ferrara, N. L. Ho, S. K. Kim
    A simple algorithm for the constrained sequence problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:175-179 [Journal]
  4. James F. Korsh, Paul LaFollette
    Constant time generation of derangements. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:181-186 [Journal]
  5. Alexandros V. Gerbessiotis, Constantinos J. Siniolakis
    Probabilistic integer sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:187-193 [Journal]
  6. Harumichi Nishimura, Tomoyuki Yamakami
    Polynomial time quantum computation with advice. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:195-204 [Journal]
  7. Nicholas J. A. Harvey, J. Ian Munro
    Deterministic SkipNet. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:205-208 [Journal]
  8. Guy Melançon, Fabrice Philippe
    Generating connected acyclic digraphs uniformly at random. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:4, pp:209-213 [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