Journals in DBLP

Inf. Comput.
1989, volume: 82, number: 1

1. Jean-Pierre Jouannaud, Emmanuel Kounalis
   Automatic Proofs by Induction in Theories without Constructors [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:82, n:1, pp:1-33 [Journal]
   
2. Jin-yi Cai, Lane A. Hemachandra
   Enumerative Counting Is Hard [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:82, n:1, pp:34-44 [Journal]
   
3. Dan E. Willard
   Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems [Citation Graph (1, 0)][DBLP]
   Inf. Comput., 1989, v:82, n:1, pp:45-64 [Journal]
   
4. Manfred Droste
   Recursive Domain Equations for Concrete Data Structures [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:82, n:1, pp:65-80 [Journal]
   
5. Nancy A. Lynch, Eugene W. Stark
   A Proof of the Kahn Principle for Input/Output Automata [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:82, n:1, pp:81-92 [Journal]
   
6. Alistair Sinclair, Mark Jerrum
   Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains [Citation Graph (1, 0)][DBLP]
   Inf. Comput., 1989, v:82, n:1, pp:93-133 [Journal]