Journals in DBLP

Inf. Process. Lett.
1998, volume: 65, number: 1

1. Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
   A Simplified NP-Complete MAXSAT Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:1-6 [Journal]
   
2. Peter Y. A. Ryan, Steve A. Schneider
   An Attack on a Recursive Authentication Protocol. A Cautionary Tale. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:7-10 [Journal]
   
3. Jamel Lakhal, Luc Litzler
   A Polynomial Algorithm for the Extendability Problem in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:11-16 [Journal]
   
4. Paul E. Dunne, Michele Zito
   An Inproved Upper Bound on the Non-3-Colourability Threshold. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:17-23 [Journal]
   
5. Carlo Blundo, Alfredo De Santis, Ugo Vaccaro
   On Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:25-32 [Journal]
   
6. Amos Israeli, Asaf Shirazi
   The Time Complexity of Updating Snapshot Memories. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:33-40 [Journal]
   
7. Hosam M. Mahmoud
   On Rotations in Fringe-Balanced Binary Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:41-46 [Journal]
   
8. Refik Molva, Gene Tsudik
   Secret Sets and Applications. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1998, v:65, n:1, pp:47-55 [Journal]