BIT, Volume 28, 1988

This index includes only papers from the Computer Science section of BIT.

Volume 28, Number 1, 1988

Part 1 - Computer Science

Pranay Chaudhuri: Fast Parallel Graph Searching with Applications. 2-18 BibTeX
Rolf G. Karlsson: Greedy Matching on a Grid. 19-26 BibTeX
Yannis Manolopoulos, John G. Kollias: Estimating Disk Head Movement in Batched Searching. 27-36 BibTeX
Nageswara S. V. Rao, Vijay K. Vaishnavi, S. Sitharama Iyengar: On the Dynamization of Data Structures. 37-53 BibTeX
Ling-Ling Wang, Wen-Hsiang Tsai: Optimal Assignment of Task Modules with Precedence for Distributed Processing by Graph Matching and State-Space Search. 54-68 BibTeX

Part 1 - Computer Science

Franz Aurenhammer: On-Line Sorting of Twisted Sequences in Linear Time. 194-204 BibTeX
Chin-Chen Chang: Application of Principal Component Analysis to Multi-Disk Concurrent Accessing. 205-214 BibTeX
Shou-Hsuan Stephen Huang: A VLSI Partition Algorithm. 215-226 BibTeX
Rolf G. Karlsson, Mark H. Overmars: Scanline Algorithms on a Grid. 227-241 BibTeX
P. P. Nicolaou, C. C. Lefas: On the Recovery of Error Patterns from Signatures Obtained in Digital System Testing. 242-252 BibTeX

Part 1 - Educational Papers

Edsger W. Dijkstra: On Binary Operators and Their Derived Relations. 378-382 BibTeX
Bo Einarsson: Tutorial on Analytical Methods as a Complement ot Numerical Computing. 383-390 BibTeX
Paul Erdös, Hans Riesel: On Admissible Constellations of Consecutive Primes. 391-396 BibTeX
Andrei P. Ershov: Basic Concepts of Algorithms and Programming to be Taught in a School Course in Informatics. 397-405 BibTeX
Carl-Erik Fröberg: On a Combinatorial Problem Related to Permanents. 406-411 BibTeX
Brian H. Mayoh: On Formalisms. 412-426 BibTeX
Anders P. Ravn, Hans Rischel, Hans Henrik Løvengreen: A Design Method for Embedded Software Systems. 427-438 BibTeX
K. W. Smillie: Array Theory and the Nial Programming Language. 439-449 BibTeX
Edda Sveinsdottir, Erik Frøkjær: Datalogy - The Copenhagen Tradition of Computer Science. 450-472 BibTeX
Wladyslaw M. Turski: Time Considered Irrelevant for Real-Time Systems. 473-486 BibTeX

Part 2 - Computer Science

Annika Aasa, Sören Holmström, Christina Nilsson: An Efficiency Comparison of Some Representations of Purely Functional Arrays. 490-503 BibTeX
J. W. de Bakker, John-Jules Ch. Meyer: Metric Semantics for Concurrency. 504-529 BibTeX
Edward K. Blum: The Semantics and Complexity of Parallel Programs for Vector Computations. Part I: A Case Study Using Ada. 530-551 BibTeX
Jens Clausen, Jakob Krarup: Arranging Apples in an Array. 552-568 BibTeX
David Gries, Jinyun Xue: Generating a Random Cycle Permutation. 569-572 BibTeX
Peter Johansen: Inductive Inference of Ultimately Periodic Sequences. 573-580 BibTeX
Reino Kurki-Suonio, T. Kankaanpää: On the Design of Reactive Systems. 581-604 BibTeX
Bengt Nordström: Terminating General Recursion. 605-619 BibTeX
Jørgen Staunstrup, Mark R. Greenstreet: From High-Level Descriptions to VLSI Circuits. 620-638 BibTeX
Alan Stewart: SIMD Language Design Using Prescriptive Semantics. 639- BibTeX 650

Part 1 - Computer Science

István Beck, Stein Krogdahl: A Select and Insert Sorting Algorithm. 726-735 BibTeX
Christos Faloutsos: Signature Files: An Integrated Access Method for Text and Attributes, Sluitable for Optical Disk Storage. 736-754 BibTeX
J. K. Gibson: A Generalisation of Brickell's Algorithm for Fast Modular Multiplication. 755-764 BibTeX
Dana S. Richards, Pravin M. Vaidya: On the Distribution of Comparisons in Sorting Algorithms. 764-774 BibTeX
Steven Skiena: Encroaching Lists as a Measure of Presortedness. 755-784 BibTeX
Ivan Stojmenovic, Michael A. Langston: On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm. 785-789 BibTeX