BIT, Volume 24, 1984

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

Volume 24, Number 1, 1984

Part 1 - Computer Science

Donald C. S. Allison, M. T. Noga: Some Performance Tests of Convex Hull Algorithms. 2-13
Svante Carlsson: Improving Worst-Case Behavior of Heaps. 14-18
Jarmo Ernvall, Olli Nevalainen: Estimating the Length of Minimal Spanning Trees in Compression of Files. 19-32
Trevor I. Fenner, George Loizou: Loop-Free Algorithms for Traversing Binary Trees. 33-44
W. J. Hsu, M. W. Du: Computing a Longest Common Subsequence for a Set of Strings. 45-59
Johann P. Malmquist, Edward L. Robertson: On the Complexity of Partitioning Sparse Matrix Representations. 60-68

Part 1 - Computer Science

Ratan K. Ghosh, G. P. Bhattacharjee: A Parallel Search Algorithm for Directed Acyclic Graphs. 134-150
Arne Maus: Delaunay Triangulation and the Convex Hull of n Points in Expected Linear Time. 151-163
Erkki Mäkinen: On Context-Free and Szilard Languages. 164-170
Timo Niemi: Specification of a Query Language by the Attribute Method. 171-186
S. S. Tseng, Richard C. T. Lee: A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations. 187-195
Shmuel Zaks: A New Algorithm for Generation of Permutations. 196-204

Part 1 - Computer Science

Mee Yee Chan: Multidisk File Design: An Analysis of Folding Buckets to Disks. 262-268
R. C. Chang, Richard C. T. Lee: On the Average Length of Delaunay Triangulations. 269-273
P. Gupta, G. P. Bhattacharjee: A Parallel Selection Algorithm. 274-287
Bengt Nordström, Jan M. Smith: Propositions and Specifications of Programs in Martin-Löfs Type Theory. 288-301
G. M. Prabhu, Narsingh Deo: On the Power of a Perturbation for Testing Non-Isomorphism of Graphs. 302-307
S. S. Tseng, Richard C. T. Lee: A Parallel Algorithm to Solve the Stable Marriage Problem. 308-316
Aimo A. Törn: Hashing with Overflow Indexing. 317-332
D. Y. Yeh, D. T. Lee: Graph Algorithms on a Tree-Structured Parallel Computer. 333-340

Last update Tue May 21 05:50:07 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page