Journals in DBLP

Inf. Process. Lett.
1990, volume: 34, number: 2

1. Simeon C. Ntafos
   The Robber Route Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:59-63 [Journal]
   
2. Pradip Dey, Barrett R. Bryant, Tadao Takaoka
   Lexical Ambiguity in Tree Adjoining Grammars. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:65-69 [Journal]
   
3. Young C. Wee, Seth Chaiken, Dan E. Willard
   On the Angle Restricted Nearest Neighbor Problem. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:71-76 [Journal]
   
4. Sandeep Sen
   Finding an Approximate Median with High Probability in Constant Parallel Time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:77-80 [Journal]
   
5. Stephen A. Cook, Toniann Pitassi
   A Feasibly Constructive Lower Bound for Resolution Proofs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:81-85 [Journal]
   
6. Jean-Paul Laumond
   Connectivity of Plane Triangulations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:87-96 [Journal]
   
7. Stephan Olariu
   On the Closure of Triangle-Free Graphs Under Substitution. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:97-101 [Journal]
   
8. Michel Cosnard, Jean Duprat, Afonso Ferreira
   The Complexity of Searching in X+Y and Other Multisets. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1990, v:34, n:2, pp:103-109 [Journal]