The SCEAS System
Navigation Menu

Journals in DBLP

Inf. Process. Lett.
1987, volume: 24, number: 5

  1. Klaus Madlener, Friedrich Otto
    Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:281-284 [Journal]
  2. Takao Asano, Tetsuo Asano, Hiroshi Imai
    Shortest Path Between Two Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:285-288 [Journal]
  3. M. D. Atkinson, H. W. Chang
    Computing the Number of Mergings with Constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:289-292 [Journal]
  4. Cyrus Hazari, Hussein Zedan
    A Distributed Algorithm for Distributed Termination. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:293-297 [Journal]
  5. Gregers Koch
    Automating the Semantic Component. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:299-305 [Journal]
  6. Daniel S. Hirschberg, Dennis J. Volper
    Improved Update/Query Algorithms for the Interval Valuation Problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:307-310 [Journal]
  7. Ernest J. H. Chang, Gaston H. Gonnet, Doron Rotem
    On the Costs of Self-Stabilization. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:311-316 [Journal]
  8. Mark Valentine, Robert H. Davis
    The Automated Solution of Logic Puzzles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:317-324 [Journal]
  9. Marek Chrobak, Wojciech Rytter
    Remarks on String-Matching and One-Way Multihead Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:325-329 [Journal]
  10. Robert D. Tennent
    A Note on Undefined Expression Values in Programming Logics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:331-333 [Journal]
  11. Peter Widmayer, Derick Wood
    Time- and Space-Optimal Contour Computation for a Set of Rectangles. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:335-338 [Journal]
  12. Michael B. Dillencourt
    Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:339-342 [Journal]
  13. Richard Kennaway, M. Ronan Sleep
    Variable Abstraction in O(n log n) Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:343-349 [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