Journals in DBLP

Inf. Process. Lett.
1995, volume: 55, number: 6

1. Martin Farach, Teresa M. Przytycka, Mikkel Thorup
   On the Agreement of Many Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:297-301 [Journal]
   
2. Zhi-Zhong Chen
   A Fast and Efficient NC Algorithm for Maximal Matching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:303-307 [Journal]
   
3. Jürg Nievergelt, Narsingh Deo
   Metric Graphs Elastically Embeddable in the Plane. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:309-315 [Journal]
   
4. Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar
   Utility of Pathmax in Partial Order Heuristic Search. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:317-322 [Journal]
   
5. Vasco Thudichum Vasconcelos
   Unification of Kinded Infinite Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:323-328 [Journal]
   
6. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold
   Balanced Allocations for Tree-Like Inputs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:329-332 [Journal]
   
7. Weifa Liang
   Fast Parallel Algorithms for the Approximate Edge-Coloring Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:333-338 [Journal]
   
8. Amiya Nayak, Vincenzo Acciaro, Paolo Gissi
   A Note on Isomorphic Chordal Rings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:339-341 [Journal]
   
9. Young Gil Park, Benjamin Goldberg
   Order-of-Demand Analysis for Lazy Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:6, pp:343-348 [Journal]
   
10. Gisela Pitsch
    LR(k)-Coupled-Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:6, pp:349-358 [Journal]