Nordic Journal of Computing, Volume 1

Volume 1, Number 1, Spring 1994

• Kathleen Fisher, Furio Honsell, John C. Mitchell: A lambda Calculus of Objects and Method Specialization. 3-37
• Torben Hagerup, Margin Maas: Generalized Topological Sorting in Linear Time. 38-49
• Thomas F. Melham: A Mechanized Theory of the Pi-Calculus in HOL. 50-76
• Hanspeter Mössenböck: Extensibility in the Oberon System. 77-93

• Pekka Orponen: Neural Networks and Complexity Theory. 94-110

• Hans L. Bodlaender, Gerard Tel, Nicola Santoro: Trade-Offs in Non-Reversing Diameter. 111-134
• Olav Lysne: Heuristics for Completion in Automatic Proofs by Structural Induction. 135-156
• Jan Arne Telle: Complexity of Domination-Type Problems in Graphs. 157-171

Volume 1, Number 2, Summer 1994

• Jean R. S. Blair, Barry W. Peyton: On Finding Minimum-Diameter Clique Trees. 173-201
• Kris Coolsaet, Veerle Fack, H. De Meyer: A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors. 202-213
• Sushil Jajodia, Ravi Mukkamala, K. V. S. Ramarao: A View-Based Dynamic Replication Control Algorithm. 214-230
• Ravi Janardan, Franco P. Preparata: Widest-Corridor Problems. 231-245
• Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger: Some Geometric Clustering Problems. 246-263

• Klaus Jansen: Integral Flow with Disjoint Bundles. 264-267
• John W. Krussel, Barry Schaudt: A Note on Higher Order Voronoi Diagrams. 268-

Volume 1, Number 3, Fall 1994

• Andrzej Lingas: Editor's Foreword. 273
• Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi: The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. 275-316
• Viggo Kann: Polynomially Bounded Minimization Problems That Are Hard to Approximate. 317-331
• Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Sparse Networks Supporting Efficient Reliable Broadcasting. 332-345
• Klaus Havelund, Kim Guldstrand Larsen: The Fork Calculus. 346-363
• Hardi Hungar, Bernhard Steffen: Local Model-Checking for Context-Free Processes. 364-

Volume 1, Number 4, Winter 1994

• Sven Skyum: Guest Editor's Foreword. 387-
• Peter Becker: A New Algorithm for the Construction of Optimal B-Trees. 389-401
• Eric Schenk: Parallel Dynamic Lowest Common Ancestors. 402-432
• Gautam Das, Paul J. Heffernan, Giri Narasimhan: Finding all Weakly-Visible Chords of a Polygon in Linear Time. 433-457
• Sven Schuierer: An O(log log n) Time Algorithm to Compute the Kernel of a Polygon. 458-474
• Magnús M. Halldórsson, Jaikumar Radhakrishnan: Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. 475-492
• Marcus Peinado: Hard Graphs for the Randomized Boppana-Halldörsson Algorithm for MAXCLIQUE. 493-