Journals in DBLP

Inf. Process. Lett.
1994, volume: 49, number: 6

1. Gerard Tel
   Maximal Matching Stabilizes in Quadratic Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:271-272 [Journal]
   
2. Leonid Libkin, Limsoon Wong
   Conservativity of Nested Relational Calculi with Internal Generic Functions. [Citation Graph (8, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:273-280 [Journal]
   
3. Victor Chepoi, Feodor F. Dragan
   Computing a Median Point of a Simple Rectilinear Polygon. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:281-285 [Journal]
   
4. Al Borchers, Prosenjit Gupta
   Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:287-290 [Journal]
   
5. Sergio Rajsbaum
   Upper and Lower Bounds for Stochastic Marked Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:291-295 [Journal]
   
6. Zeev Collin, Shlomi Dolev
   Self-Stabilizing Depth-First Search. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:297-301 [Journal]
   
7. G. Sajith, Sanjeev Saxena
   Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:303-308 [Journal]
   
8. Viggo Kann
   Maximum Bounded H-Matching is MAX SNP-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:309-318 [Journal]
   
9. Hari N. Reddy, Ernst L. Leiss
   An O(log N) Algorithm to Solve Linear Recurrences on Hypercubes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1994, v:49, n:6, pp:319-325 [Journal]
   
10. Helmut Prodinger
    An Asymptotic Comment on a Paper by Analyti and Pramanik. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:49, n:6, pp:327-328 [Journal]