The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1979, volume: 8, number: 4

  1. Maurizio A. Bonuccelli, Daniel P. Bovet
    Minimum Node Disjoint Path Covering for Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:159-161 [Journal]
  2. Ludwik Czaja
    A Specification of Parallel Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:162-167 [Journal]
  3. Martin Huits, Vipin Kumar
    The Practical Significance of Distributive Partitioning Sort. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:168-169 [Journal]
  4. Wlodzimierz Dobosiewicz
    The Practical Significance of d.p.Sort Revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:170-172 [Journal]
  5. Alain Fournier
    Comments on Convex Hull of a Finite Set of Points in Two Dimensions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:173- [Journal]
  6. Hirosi Hitotumatu, Kohei Noshita
    A Technique for Implementing Backtrack Algorithms and its Application. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:174-175 [Journal]
  7. J. Henno
    The Depth of Monotone Functions in Multivalued Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:176-177 [Journal]
  8. Ronald L. Rivest, Jean-Paul Van de Wiele
    An Omega(n/lg n)1/2 Lower Bound on the Number of Additions Necessary to Compute 0-1 Polynomials over the Ring of Integer Polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:178-180 [Journal]
  9. Karel Culik II, Hermann A. Maurer
    Secure Information Storage and Retrieval Using New Results in Cryptography. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:181-186 [Journal]
  10. Esko Ukkonen
    The Nonexistence of Some Covering Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:187-192 [Journal]
  11. C. C. Yang, D. T. Lee
    A Note on the all Nearest-Neighbor Problem for Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:193-194 [Journal]
  12. David Harel
    Two Results on Process Logic. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:195-198 [Journal]
  13. Ján Plesník
    The NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:199-201 [Journal]
  14. P. S. Pankov, S. L. Dolmatov
    Substantiable Evaluations by Electronic Computers and Their Application to one Problem in Combinatorial Geometry. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:202-203 [Journal]
  15. Felix J. Fridman, Glenn H. Holloway, Naftaly H. Minsky, Josef Stein
    Abstract FOR-Loops Over Several Aggregates. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:204-206 [Journal]
  16. Jörg Mühlbacher
    F-Factors of Graphs: A Generalized Matching Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:207-214 [Journal]
  17. Harold Abelson
    A Note on Time-Space Tradeoffs for Computing Continuous Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:4, pp:215-217 [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