Journals in DBLP

Inf. Process. Lett.
2005, volume: 96, number: 3

1. Jérôme Monnot
   The labeled perfect matching in bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:81-88 [Journal]
   
2. Rocco A. Servedio, Andrew Wan
   Computing sparse permanents faster. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:89-92 [Journal]
   
3. Nikhil Srivastava, Alan D. Taylor
   Tight bounds on plurality. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:93-95 [Journal]
   
4. Sahadeo Padhye
   Partial known plaintext attack on Koyama scheme. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:96-100 [Journal]
   
5. Jianhua Zhao, Xuandong Li, Guoliang Zheng
   A quadratic-time DBM-based successor algorithm for checking timed automata. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:101-105 [Journal]
   
6. Yuriy A. Reznik
   On the average depth of asymmetric LC-tries. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:106-113 [Journal]
   
7. Swastik Kopparty, Chinya V. Ravishankar
   A framework for pursuit evasion games in Rⁿ. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2005, v:96, n:3, pp:114-122 [Journal]