Journals in DBLP

Inf. Process. Lett.
2003, volume: 87, number: 5

1. Philip M. Long
   An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:229-234 [Journal]
   
2. Manuel Hernández, David A. Rosenblueth
   Disjunctive partial deduction of a right-to-left string-matching algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:235-241 [Journal]
   
3. Punit Chandra, Ajay D. Kshemkalyani
   Distributed algorithm to detect strong conjunctive predicates. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:243-249 [Journal]
   
4. Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
   Linear time self-stabilizing colorings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:251-255 [Journal]
   
5. Yon Dohn Chung, Jong Wook Kim, Myoung-Ho Kim
   Efficient preprocessing of XML queries using structured signatures. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:257-264 [Journal]
   
6. Florent Jacquemard
   Reachability and confluence are undecidable for flat term rewriting systems. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:265-270 [Journal]
   
7. Sing-Ling Lee, Hann-Jang Ho
   On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:271-275 [Journal]
   
8. Kilsoo Chun, Seungjoo Kim, Sangjin Lee, Soo Hak Sung, Seonhee Yoon
   Differential and linear cryptanalysis for 2-round SPNs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2003, v:87, n:5, pp:277-282 [Journal]