Journals in DBLP

Inf. Comput.
1987, volume: 75, number: 2

1. Dana Angluin
   Learning Regular Sets from Queries and Counterexamples [Citation Graph (1, 0)][DBLP]
   Inf. Comput., 1987, v:75, n:2, pp:87-106 [Journal]
   
2. Rolf Klein, Derick Wood
   The Node Visit Cost of Brother Trees [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1987, v:75, n:2, pp:107-129 [Journal]
   
3. Gabriel Bracha
   Asynchronous Byzantine Agreement Protocols [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1987, v:75, n:2, pp:130-143 [Journal]
   
4. Hiroaki Yamamoto, Shoichi Noguchi
   Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1987, v:75, n:2, pp:144-161 [Journal]
   
5. Yishay Mansour, Shmuel Zaks
   On the Bit Complexity of Distributed Computations in a Ring with a Leader [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1987, v:75, n:2, pp:162-177 [Journal]
   
6. Marek Karpinski, Rutger Verbeek
   On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1987, v:75, n:2, pp:178-189 [Journal]