Journals in DBLP
Inf. Comput. 1992, volume: 97, number: 1
Sang Cho , Dung T. Huynh The Parallel Complexity of Finite-State Automata Problems [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:97, n:1, pp:1-22 [Journal ] Yasubumi Sakakibara Efficient Learning of Context-Free Grammars from Positive Structural Examples [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:97, n:1, pp:23-60 [Journal ] Brian A. Coan , Jennifer L. Welch Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:97, n:1, pp:61-85 [Journal ] Ingo Wegener The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:97, n:1, pp:86-96 [Journal ] Miklós Bartha An Algebraic Model of Synchronous Systems [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1992, v:97, n:1, pp:97-131 [Journal ]