Journals in DBLP

BIT
1985, volume: 25, number: 1

1. Stefan Arnborg
   Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. [Citation Graph (1, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:2-23 [Journal]
   
2. Ole Immanuel Franksen
   The Nature of Data: From Measurements to Systems. [Citation Graph (0, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:24-50 [Journal]
   
3. Rolf Nossum
   Automated Theorem Proving Methods. [Citation Graph (0, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:51-64 [Journal]
   
4. Martti Tienari
   Computer Networking of Nordic Universities. [Citation Graph (0, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:65-69 [Journal]
   
5. T. D. Bui, Mai Thanh
   Significant Improvements to the Ford-Johnson Algorithm for Sorting. [Citation Graph (0, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:70-75 [Journal]
   
6. Bernard Chazelle, Leonidas J. Guibas, D. T. Lee
   The Power of Geometric Duality. [Citation Graph (1, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:76-90 [Journal]
   
7. Ola-Olu A. Daini
   A Language-Driven Generalized Numerical Database Translator. [Citation Graph (0, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:91-105 [Journal]
   
8. David J. Evans, Nadia Y. Yousif
   Analysis of the Performance of the Parallel Quicksort Method. [Citation Graph (0, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:106-112 [Journal]
   
9. Philippe Flajolet
   Approximate Counting: A Detailed Analysis. [Citation Graph (1, 0)][DBLP]
   BIT, 1985, v:25, n:1, pp:113-134 [Journal]
   
10. Markku Tamminen
    On Search by Address Computation. [Citation Graph (0, 0)][DBLP]
    BIT, 1985, v:25, n:1, pp:135-147 [Journal]
    
11. Wei-Pang Yang, M. W. Du
    A Backtracking Method for Constructing Perfect Hash Functions from a Set of Mapping Functions. [Citation Graph (0, 0)][DBLP]
    BIT, 1985, v:25, n:1, pp:148-164 [Journal]