Journals in DBLP
Wojciech Rytter , Ahmed Saoudi On the Complexity of the Recognition of Parallel 2D-Image Languages. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:225-229 [Journal ] John Hershberger A New Data Structure for Shortest Path Queries in a Simple Polygon. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:231-235 [Journal ] Andrzej Lingas Bit Complexity of Matrix Products. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:237-242 [Journal ] Myoung-Ho Kim , Sakti Pramanik The FX Distribution Method for Parallel Processing of Partial Match Queries. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:243-252 [Journal ] Gerhard J. Woeginger On Minimizing the Sum of k Tardinesses. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:253-256 [Journal ] Susanne E. Hambrusch , Michael Luby Parallel Asynchronous Connected Components in a Mesh. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:257-263 [Journal ] T. Z. Kalamboukis , S. L. Mantzaris Towards Optimal Distributed Election on Chordal Rings. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:265-270 [Journal ] Farshad Fotouhi , Sakti Pramanik Problem of Optimizing the Number of Block Accesses in Performing Relational Join is NP-Hard. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:271-275 [Journal ] Jirí Matousek Computing Dominances in E^n. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:277-278 [Journal ] Timothy Law Snyder Corrigendum: Lower Bounds for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:279- [Journal ] Myung-Joon Lee , Kwang-Moo Choe Corrigenda: SLR(k) Covering for LR(k) Grammars. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1991, v:38, n:5, pp:281- [Journal ]