Journals in DBLP

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

1. Jonathan S. Turner
   Approximation Algorithms for the Shortest Common Superstring Problem [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:1-20 [Journal]
   
2. Toshiya Itoh, Shigeo Tsujii
   Structure of Parallel Multipliers for a Class of Fields GF(2^m) [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:21-40 [Journal]
   
3. Maurice Nivat, Ahmed Saoudi
   Automata on Infinite Objects and Their Applications to Logic and Programming [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:41-64 [Journal]
   
4. Bernd Voigt, Ingo Wegener
   Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:65-79 [Journal]
   
5. Rudolf Ahlswede, Zhen Zhang
   Coding for Write-Efficient Memory [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:80-97 [Journal]
   
6. Alok Aggarwal, Heather Booth, Joseph O'Rourke, Subhash Suri, Chee-Keng Yap
   Finding Minimal Convex Nested Polygons [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:98-110 [Journal]
   
7. Vladimir Estivill-Castro, Derick Wood
   A New Measure of Presortedness [Citation Graph (0, 0)][DBLP]
   Inf. Comput., 1989, v:83, n:1, pp:111-119 [Journal]