The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1992, volume: 43, number: 3

  1. Oege de Moor
    Inductive Data Types for Predicate Transformers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:113-117 [Journal]
  2. Sanjeev Saluja, K. V. Subrahmanyam
    On the Power of Enumerative Counting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:119-125 [Journal]
  3. Gerhard J. Woeginger
    Finding the Closest Extreme Vertex to a Fixed Point. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:127-128 [Journal]
  4. Xiaoquing Liu, Junguk L. Kim
    An Effecient Parallel Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:129-133 [Journal]
  5. Thomas A. Henzinger
    Sooner is Safer Than Later. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:135-141 [Journal]
  6. V. I. Galiev, A. F. Polupanov, Igor Shparlinski
    Distances from Differences of Roots of Polynomials to the Nearest Integers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:143-146 [Journal]
  7. Wojciech Penczek
    On Undecidability of Propositional Temporal Logics on Trace Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:147-153 [Journal]
  8. Michele Boreale, Paola Inverardi, Monica Nesi
    Complete Sets of Axioms for Finite Basic LOTOS Behavioural Equivalences. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:155-160 [Journal]
  9. Vassil S. Dimitrov, Todor Cooklev, B. D. Donevsky
    On the Multiplication of Reduced Biquaternions and Applications. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:161-164 [Journal]
  10. Do-Hyung Kim, Kwang-Moo Choe
    Corrigenda: Yet Another Efficient Backward Execution Algorithm in the AND/OR Process Model. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:165- [Journal]
  11. Boleslaw K. Szymanski, Balaram Sinharoy
    Corrigenda: Complexity of the Closest Vector Problem in a Lattice Generated by (0, 1)-Matrix. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:43, n:3, pp:167- [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