The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
2000, volume: 73, number: 5-6

  1. Andrzej Ehrenfeucht, Jurriaan Hage, Tero Harju, Grzegorz Rozenberg
    Pancyclicity in switching classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:153-156 [Journal]
  2. Raymond R. Devillers, Joël Goossens
    Liu and Layland's schedulability test revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:157-161 [Journal]
  3. Atsushi Kaneko, Kiyoshi Yoshimoto
    On spanning trees with restricted degrees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:163-165 [Journal]
  4. Liang Chen, Naoyuki Tokuda
    A note on "Category and measure in complexity classes". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:167-168 [Journal]
  5. Steven McKellar, Robert Davis
    Redundancy removal in multicast protocols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:169-173 [Journal]
  6. Zoltán Fülöp, Sebastian Maneth
    Domains of partial attributed tree transducers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:175-180 [Journal]
  7. Fanica Gavril
    Maximum weight independent sets and cliques in intersection graphs of filaments. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:181-188 [Journal]
  8. Giovanni Dimauro, Sebastiano Impedovo, Giuseppe Pirlo, A. Salzo
    RNS architectures for the implementation of the `diagonal function'. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:189-198 [Journal]
  9. Amiya Nayak, J. Ren, Nicola Santoro
    An improved testing scheme for catastrophic fault patterns. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:199-206 [Journal]
  10. Achour Mostéfaoui, Michel Raynal, Frederic Tronel
    From Binary Consensus to Multivalued Consensus in asynchronous message-passing systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:207-212 [Journal]
  11. Amos Beimel, Eyal Kushilevitz
    Learning unions of high-dimensional boxes over the reals. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:213-220 [Journal]
  12. Daniel Stefankovic
    Acyclic orientations do not lead to optimal deadlock-free packet routing algorithms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:73, n:5-6, pp:221-225 [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