Journals in DBLP

Inf. Process. Lett.
1986, volume: 23, number: 4

1. Patrick Dehornoy
   Turing Complexity of the Ordinals. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:167-170 [Journal]
   
2. Michel Latteux, Erick Timmerman
   Finitely Generated (Omega)o-Languages. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:171-175 [Journal]
   
3. Bowen Alpern, Alan J. Demers, Fred B. Schneider
   Safety Without Stuttering. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:177-180 [Journal]
   
4. David R. O'Hallaron, P. E. Reynolds
   A Generalized Deadlock Predicate. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:181-188 [Journal]
   
5. Lenore Blum
   Towards an Asymptotic Analysis of Karmarkar's Algorithm. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:189-194 [Journal]
   
6. Alan A. Bertossi, Maurizio A. Bonuccelli
   Hamiltonian Circuits in Interval Graph Generalizations. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:195-200 [Journal]
   
7. Susumu Yamasaki, Shuji Doshita
   Resolution Deduction to Detect Satisfiability For Another Class Including Non-Horn Sentences In Propositional Logic. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:201-207 [Journal]
   
8. D. Gordon
   Eliminating the Flag in Threaded Binary Search Trees. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:209-214 [Journal]
   
9. O. J. Murphy, Stanley M. Selkow
   The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1986, v:23, n:4, pp:215-218 [Journal]