Journals in DBLP
Jik H. Chang , Oscar H. Ibarra , Bala Ravikumar , Leonard Berman Some Observations Concerning Alternating Turing Machines Using Small Space. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:1-9 [Journal ] Avraham A. Melkman On-Line Construction of the Convex Hull of a Simple Polyline. [Citation Graph (2, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:11-12 [Journal ] Bernd Kirsig , Klaus-Jörn Lange Separation with the Ruzzo, Simon, and Tompa Relativization Implies DSPACE(log n) != NSPACE(log n). [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:13-15 [Journal ] Richard G. Hamlet Probable Correctness Theory. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:17-25 [Journal ] Rodney R. Howell , Louis E. Rosier , Hsu-Chun Yen An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:27-33 [Journal ] George Cybenko , David W. Krumme , K. N. Venkataraman Fixed Hypercube Embedding. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:35-39 [Journal ] Jean-Paul Laumond Obstacle Growing in a Nonpolygonal World. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:41-50 [Journal ] Joseph Naor A Fast Parallel Coloring of Planar Graphs with Five Colors. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:51-53 [Journal ] Cao An Wang , Yung H. Tsin An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:55-60 [Journal ] Gary A. Hyslop , Edmund A. Lamagna Performance of Distributive Partitioned Sort in a Demand Paging Environment. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:61-64 [Journal ] John H. Reif A Topological Approach to Dynamic Graph Connectivity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1987, v:25, n:1, pp:65-70 [Journal ]