Journals in DBLP

Inf. Process. Lett.
2007, volume: 101, number: 2

1. Peter Clifford, Raphaël Clifford
   Simple deterministic wildcard matching. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:53-54 [Journal]
   
2. Michael H. Albert, Mike D. Atkinson, Doron Nussbaum, Jörg-Rüdiger Sack, Nicola Santoro
   On the longest increasing subsequence of a circular list. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:55-59 [Journal]
   
3. Ittai Abraham, Gregory Chockler, Idit Keidar, Dahlia Malkhi
   Wait-free regular storage from Byzantine components. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:60-65 [Journal]
   
4. Daniel Sawitzki
   Lower bounds on the OBDD size of two fundamental functions' graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:66-71 [Journal]
   
5. Yuuki Tanaka, Hiroyuki Kawai, Yukio Shibata
   Isomorphic factorization, the Kronecker product and the line digraph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:72-77 [Journal]
   
6. MoonBae Song, KwangJin Park, Ki-Sik Kong, SangKeun Lee
   Bottom-up nearest neighbor search for R-trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:78-85 [Journal]
   
7. Eric Bach
   Bounds for the expected duration of the monopolist game. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:101, n:2, pp:86-92 [Journal]