The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2000, volume: 76, number: 1-2

  1. Riccardo Focardi, Flaminia L. Luccio, David Peleg
    Feedback vertex set in hypercubes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:1-5 [Journal]
  2. Sergei Bespamyatnikh, Michael Segal
    Enumerating longest increasing subsequences and patience sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:7-11 [Journal]
  3. Ryuhei Uehara, Zhi-Zhong Chen
    Parallel approximation algorithms for maximum weighted matching in general graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:13-17 [Journal]
  4. Tomasz Borzyszkowski
    Generalized interpolation in CASL. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:19-24 [Journal]
  5. Lanfranco Lopriore
    Protection in a single-address-space environment. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:25-32 [Journal]
  6. Matthias Schonlau, Martin Theus
    Detecting masquerades in intrusion detection based on unpopular commands. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:33-38 [Journal]
  7. Joan Serra-Sagristà
    Enumeration of lattice points in l1 norm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:39-44 [Journal]
  8. Jue Xue, Ju Liu
    A network-flow-based lower bound for the minimum weighted integer coloring problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:45-50 [Journal]
  9. Joep Aerts, Jan H. M. Korst, Sebastian Egner
    Random duplicate storage strategies for load balancing in multimedia servers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:51-59 [Journal]
  10. Jin-yi Cai, Ajay Nerurkar
    A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:61-66 [Journal]
  11. L. Javier García-Villalba, Amparo Fúster-Sabater
    On the linear complexity of the sequences generated by nonlinear filterings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:67-73 [Journal]
  12. Chu Min Li
    Equivalency reasoning to solve a class of hard SAT problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:75-81 [Journal]
  13. Francesc Comellas, Javier Ozón, Joseph G. Peters
    Deterministic small-world communication networks. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:83-90 [Journal]
  14. Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto
    Evolutionary graph colouring. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:76, n:1-2, pp:91-94 [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