


default search action
BIT, Volume 28, 1988
Volume 28, Number 1, 1988
- Pranay Chaudhuri:

Fast Parallel Graph Searching with Applications. 1-18 - Rolf G. Karlsson:

Greedy Matching on a Grid. 19-26 - Yannis Manolopoulos, John G. Kollias:

Estimating Disk Head Movement in Batched Searching. 27-36 - Nageswara S. V. Rao

, Vijay K. Vaishnavi, S. Sitharama Iyengar
:
On the Dynamization of Data Structures. 37-53 - 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
Volume 28, Number 2, 1988
- Franz Aurenhammer:

On-Line Sorting of Twisted Sequences in Linear Time. 194-204 - Chin-Chen Chang:

Application of Principal Component Analysis to Multi-Disk Concurrent Accessing. 205-214 - Shou-Hsuan Stephen Huang:

A VLSI Partition Algorithm. 215-226 - Rolf G. Karlsson, Mark H. Overmars:

Scanline Algorithms on a Grid. 227-241 - P. P. Nicolaou, C. C. Lefas:

On the Recovery of Error Patterns from Signatures Obtained in Digital System Testing. 242-252
Volume 28, Number 3, 1988
- Edsger W. Dijkstra:

On Binary Operators and Their Derived Relations. 377-382 - Bo Einarsson:

Tutorial on Analytical Methods as a Complement ot Numerical Computing. 383-390 - Paul Erdös, Hans Riesel:

On Admissible Constellations of Consecutive Primes. 391-396 - Andrei P. Ershov:

Basic Concepts of Algorithms and Programming to be Taught in a School Course in Informatics. 397-405 - Carl-Erik Fröberg:

On a Combinatorial Problem Related to Permanents. 406-411 - Brian H. Mayoh:

On Formalisms. 412-426 - Anders P. Ravn, Hans Rischel, Hans Henrik Løvengreen

:
A Design Method for Embedded Software Systems. 427-438 - Keith W. Smillie:

Array Theory and the Nial Programming Language. 439-449 - Edda Sveinsdottir, Erik Frøkjær:

Datalogy - The Copenhagen Tradition of Computer Science. 450-472 - Wladyslaw M. Turski:

Time Considered Irrelevant for Real-Time Systems. 473-486
- Annika Aasa, Sören Holmström, Christina Nilsson:

An Efficiency Comparison of Some Representations of Purely Functional Arrays. 489-503 - J. W. de Bakker, John-Jules Ch. Meyer:

Metric Semantics for Concurrency. 504-529 - Edward K. Blum:

The Semantics and Complexity of Parallel Programs for Vector Computations. Part I: A Case Study Using Ada. 530-551 - Jens Clausen, Jakob Krarup:

Arranging Apples in an Array. 552-568 - David Gries

, Jinyun Xue:
Generating a Random Cycle Permutation. 569-572 - Peter Johansen:

Inductive Inference of Ultimately Periodic Sequences. 573-580 - Reino Kurki-Suonio, T. Kankaanpää:

On the Design of Reactive Systems. 581-604 - Bengt Nordström:

Terminating General Recursion. 605-619 - Jørgen Staunstrup, Mark R. Greenstreet:

From High-Level Descriptions to VLSI Circuits. 620-638 - Alan Stewart:

SIMD Language Design Using Prescriptive Semantics. 639-649
Volume 28, Number 4, 1988
- István Beck, Stein Krogdahl:

A Select and Insert Sorting Algorithm. 725-735 - Christos Faloutsos:

Signature Files: An Integrated Access Method for Text and Attributes, Sluitable for Optical Disk Storage. 736-754 - J. K. Gibson:

A Generalisation of Brickell's Algorithm for Fast Modular Multiplication. 755-763 - Dana S. Richards, Pravin M. Vaidya:

On the Distribution of Comparisons in Sorting Algorithms. 764-774 - Steven Skiena

:
Encroaching Lists as a Measure of Presortedness. 775-784 - Ivan Stojmenovic, Michael A. Langston:

On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm. 785-789

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














