The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Marco Cadoli
    The Complexity of Model Checking for Circumscriptive Formulae. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:113-118 [Journal]
  2. Daniel P. Bovet, Stefano Varricchio
    On the Regularity of Languages on a Binary Alphabet Generated by Copying Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:119-123 [Journal]
  3. Erkki Mäkinen
    Remarks on the Structural Grammatical Inference Problem for Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:125-127 [Journal]
  4. Jorge Lobo, V. S. Subrahmanian
    Relating Minimal Models and Pre-Requisite-Free Normal Defaults. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:129-133 [Journal]
  5. James J. Lu, Lawrence J. Henschen
    The Completeness of GP-Resolution for Annotated Logics. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:135-140 [Journal]
  6. Yijie Han, Bhagirath Narahari, Hyeong-Ah Choi
    Mapping a Chain Task to Chained Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:141-148 [Journal]
  7. Victor Y. Pan, Akimou Sadikou, Elliott Landowne
    Polynomial Division with a Remainder by Means of Evaluation and Interpolation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:149-153 [Journal]
  8. Subir Kumar Ghosh, Anil Maheshwari
    An Optimal Parallel Algorithm for Computing Furthest Neighbors in a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:155-160 [Journal]
  9. Gerhard J. Woeginger
    The Complexity of Finding Arborescences in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:161-164 [Journal]
  10. John Bainbridge
    A Heuristic Method for Generating Large Random Expressions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:165-170 [Journal]
  11. Jan K. Pachl
    Corrigendum: A Simple Proof of a Completeness Result for Leads-To in the UNITY Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:3, pp:171- [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