Journals in DBLP

Inf. Process. Lett.
2006, volume: 100, number: 1

1. Yunlei Zhao
   A note on the Dwork-Naor timed deniable authentication. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:1-7 [Journal]
   
2. Ioannis Koutis
   Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:8-13 [Journal]
   
3. Sebastian Deorowicz
   Speeding up transposition-invariant string matching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:14-20 [Journal]
   
4. Dongvu Tonien
   On a traitor tracing scheme from ACISP 2003. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:21-22 [Journal]
   
5. Arvind Narayanan, K. Srinathan, C. Pandu Rangan
   Perfectly Reliable Message Transmission. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:23-28 [Journal]
   
6. Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès
   Fair cost-sharing methods for the minimum spanning tree game. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:29-35 [Journal]
   
7. Ted Krovetz, Phillip Rogaway
   Variationally universal hashing. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:100, n:1, pp:36-39 [Journal]