The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1981, volume: 13, number: 4/5

  1. Christos H. Papadimitriou, Mihalis Yannakakis
    The Clique Problem for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:131-133 [Journal]
  2. Gerhard Barth
    An Alternative for the Implementation of the Knuth-Morris-Pratt Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:134-137 [Journal]
  3. R. H. Davis, C. Rinaldi, C. J. Trebilcock
    Data Compression in Limited Capacity Microcomputer Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:138-141 [Journal]
  4. Wojciech Rytter
    Time Complexity of Languages Recognized by One-Way Multihead Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:142-144 [Journal]
  5. Wojciech Rytter
    A Hardest Language Recognized by Two-Way Nondeterministic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:145-146 [Journal]
  6. Viktor K. Sabelfeld
    Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:147-153 [Journal]
  7. Nathan Goodman, Oded Shmueli
    Limitations of the Chase. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:154-156 [Journal]
  8. Alan A. Bertossi
    The Edge Hamiltonian Path Problem is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:157-159 [Journal]
  9. Laurent Siklóssy
    Efficient Query Evaluation in Relational Data Bases with Missing Values. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:160-163 [Journal]
  10. Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Testing Whether a Graph is a Superconcentrator. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:164-167 [Journal]
  11. Jacob T. Schwartz
    Finding the Minimum Distance Between Two Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:168-170 [Journal]
  12. Massimo Ancona, Vittoria Gianuzzi
    A New Method for Implementing LR(k) Tables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:171-176 [Journal]
  13. Herbert Edelsbrunner, Hermann A. Maurer
    On the Intersection of Orthogonal Objects. [Citation Graph (3, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:177-181 [Journal]
  14. Akira Nakamura, Kunio Aizawa
    Acceptors for Isometric Parallel Context-Free Array Languages. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:182-186 [Journal]
  15. M. Howard Williams
    A Systematic Test for Extended Operator Precedence. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:187-190 [Journal]
  16. Hiroto Yasuura
    Width and Depth of Combinational Logic Circuits. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:191-194 [Journal]
  17. Rusins Freivalds
    Projections of Languages Recognizable by Probabilistic and Alternating Finite Multitape Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:195-198 [Journal]
  18. R. K. Arora, N. K. Sharma
    Guarded Procedure: A Distributed Programming Concept. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:199-203 [Journal]
  19. Giovanni Guida, Marco Somalvico
    Multi-Problem-Solving: Knowledge Representation and System Architecture. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:204-214 [Journal]
  20. Henry S. Warren Jr., A. Shawhan Fox, Peter W. Markstein
    Modulus Division on a Two's Complement Machine. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:215-217 [Journal]
  21. José M. Troya, A. Vaquero
    An Approximation Algorithm for Reducing Expected Head Movement in Linear Storage Devices. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:218-220 [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