Journals in DBLP

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

1. Amihood Amir, Martin Farach
   Two-Dimensional Dictionary Matching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:233-239 [Journal]
   
2. Jer-Shyan Wu, Rong-Jaye Chen
   The Towers of Hanoi Problem with Parallel Moves. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:241-243 [Journal]
   
3. Jyh-Han Lin, Jeffrey Scott Vitter
   Approximation Algorithms for Geometric Median Problems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:245-249 [Journal]
   
4. Amotz Bar-Noy, Rajeev Motwani, Joseph Naor
   The Greedy Algorithm is Optimal for On-Line Edge Coloring. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:251-253 [Journal]
   
5. Fabrizio d'Amore, Paolo Giulio Franciosa
   On the Optimal Binary Plane Partition for Sets of Isothetic Rectangles. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:255-259 [Journal]
   
6. Mark H. Overmars
   Point Location in Fat Subdivisions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:261-265 [Journal]
   
7. Peter Rossmanith, Wojciech Rytter
   Oberservation on log(n) Time Parallel Recognition of Unambiguous cfl's. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:267-272 [Journal]
   
8. Gopal Gupta
   Dynamic Parallel Evaluation of the Cross-Product Set Using Time-Stamps. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:273-280 [Journal]
   
9. Ronald I. Greenberg, Joseph JáJá, Sridhar Krishnamurthy
   On the Difficulty of Manhattan Channel Routing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1992, v:44, n:5, pp:281-284 [Journal]
   
10. Eliezer Dekel, Jie Hu, Wen Ouyang
    An Optimal Algorithm for Finding Compact Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:285-289 [Journal]