Nordic Journal of Computing, Volume 1

Spring 1994, Volume 1, Number 1

Invited Papers:

• Kathleen Fisher, Furio Honsell, and John C. Mitchell. A lambda calculus of objects and method specialization. Nordic Journal of Computing, 1(1):3-37, Spring 1994. Abstract, References, Citations, etc.

• Torben Hagerup and Margin Maas. Generalized topological sorting in linear time. Nordic Journal of Computing, 1(1):38-49, Spring 1994. Abstract, References, etc.

• T. F. Melham. A mechanized theory of the Pi-calculus in HOL. Nordic Journal of Computing, 1(1):50-76, Spring 1994. Abstract, References, etc.

• Hanspeter Mössenböck. Extensibility in the Oberon system. Nordic Journal of Computing, 1(1):77-93, Spring 1994. Abstract, References, etc.

Survey:

• Pekka Orponen. Neural networks and complexity theory. Nordic Journal of Computing, 1(1):94-110, Spring 1994. Abstract, References, Citations, etc.

Regular papers:

• Hans L. Bodlaender, Gerard Tel, and Nicola Santoro. Trade-offs in non-reversing diameter. Nordic Journal of Computing, 1(1):111-134, Spring 1994. Abstract, References, Citations, etc.

• Olav Lysne. Heuristics for completion in automatic proofs by structural induction. Nordic Journal of Computing, 1(1):135-156, Spring 1994. Abstract, References, etc.

• Jan Arne Telle. Complexity of domination-type problems in graphs. Nordic Journal of Computing, 1(1):157-171, Spring 1994. Abstract, References, Citations, etc.

Summer 1994, Volume 1, Number 2

Regular papers:

• J. R. S. Blair and B. W. Peyton. On finding minimum-diameter clique trees. Nordic Journal of Computing, 1(2):173-201, Summer 1994. Abstract, References, etc.

• K. Coolsaet, V. Fack, and H. De Meyer. A tabular method for verification of data exchange algorithms on networks of parallel processors. Nordic Journal of Computing, 1(2):202-213, Summer 1994. Abstract, etc.

• S. Jajodia, R. Mukkamala, and K. V. S. Ramarao. A view-based dynamic replication control algorithm. Nordic Journal of Computing, 1(2):214-230, Summer 1994. Abstract, References, etc.

• R. Janardan and F. P. Preparata. Widest-corridor problems. Nordic Journal of Computing, 1(2):231-245, Summer 1994. Abstract, References, Citations, etc.

• U. Pferschy, R. Rudolf, and G. J. Woeginger. Some geometric clustering problems. Nordic Journal of Computing, 1(2):246-263, Summer 1994. Abstract, References, Citations, etc.

Notes:

• Klaus Jansen. Integral flow with disjoint bundles. Nordic Journal of Computing, 1(2):264-267, Summer 1994. Abstract and References.

• J. W. Krussel and B. F. Schaudt. A note on higher order Voronoi diagrams. Nordic Journal of Computing, 1(2):268-272, Summer 1994. Abstract, References, etc.

Fall 1994, Volume 1, Number 3

Selected Papers of the 20th International Colloquium on Automata, Languages and Programming (ICALP93), July 5-9, 1993

• A. Lingas. Editor's foreword. Nordic Journal of Computing, 1(3):273, Fall 1994.

• M. V. Marathe, H. B. Hunt III, and S. S. Ravi. The complexity of approximation PSPACE-complete problems for hierarchical specifications. Nordic Journal of Computing, 1(3):275-316, Fall 1994. Abstract, References, Citations, etc.

• V. Kann. Polynomially bounded minimization problems that are hard to approximate. Nordic Journal of Computing, 1(3):317-331, Fall 1994. Abstract, References, Citations, etc.

• B. S. Chlebus, K. Diks, and A. Pelc. Sparse networks supporting efficient reliable broadcasting. Nordic Journal of Computing, 1(3):332-345, Fall 1994. Abstract.

• K. Havelund and K. G. Larsen. The fork calculus. Nordic Journal of Computing, 1(3):346-363, Fall 1994. Abstract, References, etc.

• H. Hungar and B. Steffen. Local model-checking for context-free processes. Nordic Journal of Computing, 1(3):364-385, Fall 1994. Abstract, References, etc.

Winter 1994, Volume 1, Number 4

Selected Papers of the 4th Scandinavian Workshop on Algorithm Theory (SWAT94), July 6-8, 1994

• Sven Skyum. Guest editor's foreword. Nordic Journal of Computing, 1(4):387, Winter 1994.

• P. Becker. A new algorithm for the construction of optimal B-trees. Nordic Journal of Computing, 1(4):389-401, Winter 1994. Abstract, References, etc.

• E. Schenk. Parallel dynamic lowest common ancestors. Nordic Journal of Computing, 1(4):402-432, Winter 1994. Abstract, References, etc.

• G. Das, P. J. Heffernan, and G. Narasimhan. Finding all weakly-visible chords of a polygon in linear time. Nordic Journal of Computing, 1(4):433-457, Winter 1994. Abstract, References, etc.

• S. Schuierer. An O(log log n) time algorithm to compute the kernel of a polygon. Nordic Journal of Computing, 1(4):458-474, Winter 1994. Abstract, References, etc.

• M. M. Halldórsson and J. Radhakrishnan. Improved approximations of independent sets in bounded-degree graphs via subgraph removal. Nordic Journal of Computing, 1(4):475-492, Winter 1994. Abstract, References, Citations, etc.

• M. Peinado. Hard graphs for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE. Nordic Journal of Computing, 1(4):493-515, Winter 1994. Abstract, References, Citations, etc.

Shortcuts: