
Journals in DBLP
 Amihood Amir, Martin Farach
TwoDimensional Dictionary Matching. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:5, pp:233239 [Journal]
 JerShyan Wu, RongJaye Chen
The Towers of Hanoi Problem with Parallel Moves. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:5, pp:241243 [Journal]
 JyhHan Lin, Jeffrey Scott Vitter
Approximation Algorithms for Geometric Median Problems. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:5, pp:245249 [Journal]
 Amotz BarNoy, Rajeev Motwani, Joseph Naor
The Greedy Algorithm is Optimal for OnLine Edge Coloring. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:5, pp:251253 [Journal]
 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:255259 [Journal]
 Mark H. Overmars
Point Location in Fat Subdivisions. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:5, pp:261265 [Journal]
 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:267272 [Journal]
 Gopal Gupta
Dynamic Parallel Evaluation of the CrossProduct Set Using TimeStamps. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:44, n:5, pp:273280 [Journal]
 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:281284 [Journal]
 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:285289 [Journal]
