Nordic Journal of Computing, Volume 5

Volume 5, Number 1, Spring 1998

Drago Krznaric, Christos Levcopoulos: Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time.
Ole-Johan Dahl, Olaf Owe, Tore J. Bastiansen: Subtyping and Constructive Specification.
Bjørn Kristoffersen, Ole-Johan Dahl: On Introducing Higher Order Functions in ABEL.
Ricardo A. Baeza-Yates, Hector Soza-Pollman: Analysis of Linear Hashing Revisited.

Stefan Dobrev, Peter Ruzicka: On the Communication Complexity of Strong Time-Optimal Distributed Algorithms. 87-104
Peter Høyer, Kim S. Larsen: Parametric Permutation Routing via Matchings. 105-114
Joseph L. Ganley, Jeffrey S. Salowe: The Power-p Steiner Tree Problem. 115-127
Pinar Heggernes, Jan Arne Telle: Partitioning Graphs into Generalized Dominating Sets. 128-142
Mika Johnsson, Gábor Magyar, Olli Nevalainen: On the Euclidean 3-Matching Problem. 143-

Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle: On the Complexity of Graph Covering Problems. 173-195
Teofilo F. Gonzalez: Bounded Fan-Out Multimessage Multicasting. 196-213
Christian Mossin: Higher-Order Value Flow Graphs. 214-234
Jukka Paakki, Antti-Pekka Tuovinen: Source-to-Source Translation of Visual Languages. 235-

Selected Papers of the European Symposium on Programming (ESOP'98), April 2-3, 1998

Chris Hankin: Guest Editor's Foreword. 265-266
Martín Abadi, Andrew D. Gordon: A Bisimulation Method for Cryptographic Protocols. 267-
Christian Fecht, Helmut Seidl: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. 304-329
K. Rustan M. Leino: Recursive Object Types in a Logic of Object-Oriented Programs. 330-360
John L. Ross, Shmuel Sagiv: Building a Bridge between Pointer Aliases and Program Dependences. 361-