External Links

    Journal: BIT

    Volume 25, Issue 1

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