dblp: BIT, Volume 25

Volume 25, Number 1, 1985

Stefan Arnborg: Efficient Algorithms for Combinatorial Problems with Bounded Decomposability - A Survey. 2-23

Ole Immanuel Franksen: The Nature of Data: From Measurements to Systems. 24-50

Rolf Nossum: Automated Theorem Proving Methods. 51-64

Martti Tienari: Computer Networking of Nordic Universities. 65-69

T. D. Bui, Mai Thanh: Significant Improvements to the Ford-Johnson Algorithm for Sorting. 70-75

Ola-Olu A. Daini: A Language-Driven Generalized Numerical Database Translator. 91-105

David J. Evans, Nadia Y. Yousif: Analysis of the Performance of the Parallel Quicksort Method. 106-112

Philippe Flajolet: Approximate Counting: A Detailed Analysis. 113-134

Markku Tamminen: On Search by Address Computation. 135-147

Wei-Pang Yang, M. W. Du: A Backtracking Method for Constructing Perfect Hash Functions from a Set of Mapping Functions. 148-164

Volume 25, Number 2, 1985

Ivan E. Auger, Mukkai S. Krishnamoorthy: A Parallel Algorithm for the Monadic Unification Problem. 302-306

N. D. Francis, D. I. Fleming: Optimum Allocation of Places to Students in a National University System. 307-317

Stein Krogdahl: Multiple Inheritance in SIMULA-like Languages. 318-326

Alberto Pettorossi: Towers of Hanoi Problems: Deriving Iterative Solutions by Program Transformations. 327-334

Mireille Régnier: Analysis of Grid File Algorithms. 335-357

Lars-Erik Thorelli: A Language for Linking Modules into Systems. 358-378

Volume 25, Number 3, 1985

Trevor I. Fenner, Alan M. Frieze: An Algorithm for Finding a Matroid Basis which Maximizes the Products of the Weights of the Elements. 434-438

Kai Koskimies: A Note on One-Pass Evaluation of Attribute Grammars. 439-450

M. T. Noga, Donald C. S. Allison: Sorting in Linear Expected Time. 451-465

Otto Nurmi: A Fast Line-Sweep Algorithm for Hidden Line Elimination. 466-472

Michael J. Quinn: A Note on Two Parallel Algorithms to Solve the Stable Marriage Problem. 473-476

Kotagiri Ramamohanarao, Ron Sacks-Davis: Partial Match Retrieval Using Recursive Linear Hashing. 477-484

Pawel Winter: Generalized Steiner Problems in Outerplanar Networks. 485-496

Volume 25, Number 4, 1985

A. C. Armenakis, L. E. Garey, R. D. Gupta: An Adaption of a Root Finding Method to Searching Ordered Disk Files. 562-568

Klaus Hinrichs: Implementation of the Grid File: Design Concepts and Experience. 569-592

Matti Jakobsson: Compression of Character Stings by an Adaptive Dictionary. 593-603

Erkki Mäkinen: On Permutative Grammars Generating Context-Free Languages. 604-610

Martti Penttonen, Jyrki Katajainen: Notes on the Complexity of Sorting in Abstract Machines. 611-622

BIT, Volume 25, 1985