Journals in DBLP

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

1. Mukesh Singhal, Friedemann Mattern
   An Optimality Proof for Asynchronous Recovery Algorithms in Distributed Systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:117-121 [Journal]
   
2. Pranava K. Jha, Giora Slutzki
   A Scheme to Construct Distance Three Codes Using Latin Squares, with Applications to the n-Cube. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:123-127 [Journal]
   
3. Béatrice Bérard
   Untiming Timed Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:129-135 [Journal]
   
4. Hongchi Shi, Gerhard X. Ritter, Joseph N. Wilson
   Simulations Between Two Reconfigurable Mesh Models. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:137-142 [Journal]
   
5. Borislav Nikolik
   Constraint Preservation Through Loops. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:143-148 [Journal]
   
6. Ortrud Oellermann, Jeremy Spinrad
   A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:149-154 [Journal]
   
7. Ee-Chien Chang, Chee-Keng Yap
   A Note on Improved Deterministic Time Simulation of Nondeterministic Space for Small Space. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:155-157 [Journal]
   
8. Lydia E. Kavraki, Mihail N. Kolountzakis
   Partitioning a Planar Assembly Into Two Connected Parts is NP-Complete. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:159-165 [Journal]
   
9. Li Gong
   Collisionful Keyed Hash Functions with Selectable Collisions. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1995, v:55, n:3, pp:167-170 [Journal]
   
10. Walter Hower
    Constraint Satisfaction - Algorithms and Complexity Analysis. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:55, n:3, pp:171-178 [Journal]