Nordic Journal of Computing, Volume 2

Spring 1995, Volume 2, Number 1

E. Ukkonen. Editor's foreword. Nordic Journal of Computing, 2(1):1, Spring 1995.
M. Golin, R. Raman, C. Schwartz, and M. Smid. Simple randomized algorithms for closest pair problems. Nordic Journal of Computing, 2(1):3-27, Spring 1995. Abstract, References, Citations, etc.
V. Kamakoti, K. Krithivasan, and C. Pandu Rangan. An efficient randomized algorithm for the closest pair problem on colored point sets. Nordic Journal of Computing, 2(1):28-40, Spring 1995. Abstract, References, etc.
J. Kratochvíl, P. D. Manuel, and M. Miller. Generalized domination in chordal graphs. Nordic Journal of Computing, 2(1):41-50, Spring 1995. Abstract, References, etc.
V. Leppänen and M. Penttonen. Work-optimal simulation of PRAM models on meshes. Nordic Journal of Computing, 2(1):51-69, Spring 1995. Abstract, References, Citations, etc.
M. Vassilakopoulos, Y. Manolopoulos, and B. Kröll. Efficiency analysis of overlapped quadtrees. Nordic Journal of Computing, 2(1):70-84, Spring 1995. Abstract, References, etc.

B. Jonsson and J. Parrow. Guest editors foreword. Nordic Journal of Computing, 2(2):87, Summer 1995.
O. Burkart and B. Steffen. Composition, decomposition and model checking of pushdown processes. Nordic Journal of Computing, 2(2):89-125, Summer 1995. Abstract, References, Citations, etc.
P. Di Gianantonio, F. Honsell, and G. Plotkin. Uncountable limits and the lambda calculus. Nordic Journal of Computing, 2(2):126-145, Summer 1995. Abstract, References, Citations, etc.
P. C. Kanellakis, D. Michailidis, and A. A. Shvartsman. Controlling memory access concurrency in efficient fault-tolerant parallel algorithms. Nordic Journal of Computing, 2(2):146-180, Summer 1995. Abstract, References, etc.
N. P. Mendler, P. Panangaden, P. J. Scott, and R. A. G. Seely. A logical view of concurrent constraint programming. Nordic Journal of Computing, 2(2):181-220 , Summer 1995. Abstract, References, Citations, etc.
M. Nielsen and C. Clausen. Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing, 2(2):221-249, Summer 1995. Abstract, References, etc.
R. Segala and N. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, Summer 1995. Abstract, References, etc.
C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2):274-302, Summer 1995. Abstract, References, Citations, etc.

C. B. Fraser and R. W. Irving. Approximation Algorithms for the Shortest Common Supersequence. Nordic Journal of Computing, 2(3):303-325, Fall 1995. Abstract, References, etc.
K.-L. Chung and Y.-W. Chen. Mapping Pyramids into 3-D Meshes. Nordic Journal of Computing, 2(3):326-337, Fall 1995. Abstract, etc.
J. C. Godskesen and K. G. Larsen. Synthesizing Distinguishing Formulae for Real Time Systems. Nordic Journal of Computing, 2(3):338-357, Fall 1995. Abstract, References, etc.
M. Walicki and M. Broy. Structured Specifications and Implementation of Nondeterministic Data Types. Nordic Journal of Computing, 2(3):358-395, Fall 1995. Abstract, References, etc.

K.-L. Chung. Fast Median-Finding on Mesh-Connected Computers with Segmented Buses. Nordic Journal of Computing, 2(4):397-406, Winter 1995. Abstract, etc.
J. Parrow. Interaction Diagrams. Nordic Journal of Computing, 2(4):407-443, Winter 1995. Abstract, References, etc.
C. Rick. A New Flexible Algorithm for the Longest Common Subsequence Problem. Nordic Journal of Computing, 2(4):444-461, Winter 1995. Abstract, References, etc.
H. L. Bodlaender, T. F. Gonzalez, and T. Kloks. Complexity Aspects of Two-Dimensional Data Compression. Nordic Journal of Computing, 2(4):462-495, Winter 1995. Abstract, etc.

J. Clausen and J. Krarup. A Family of Bipartite Cardinality Matching Problems Solvable in O(n²) Time. Nordic Journal of Computing, 2(4):496-501, Winter 1995. Abstract, etc.