Nordic Journal of Computing, Volume 3

Volume 3, Number 1, Spring 1996

Yung H. Tsin, Cao An Wang: Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. 1-26
Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola: Practical In-Place Mergesort. 27-40
Helmut Seidl: Least and Greatest Solutions of Equations over N. 41-62
Selim G. Akl, Ivan Stojmenovic: Generating t-ary Trees in Parallel. 63-71
Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack: Optimal Parallel Algorithms for Direct Dominance Problems. 72-88

C.-Z. Lin, C.-C. Tseng, Y.-L. Chen, T.-W. Kuo: A Systematic Approach to Synthesize Data Alignment Directives for Distributed Memory Machines. 89-119
Lauri Malmi: A New Method for Updating and Rebalancing Tree-Type Main Memory Dictionaries. 111-130
Henrik Linnestad: Fatal Steps of Knuth-Bendix Completion. Nordic Journal of Computing. 131-143
Flemming Nielson, Hanne Riis Nielson: Operational Semantics of Termination Types. 144-187
Krzysztof Diks, Andrzej Pelc: Fault-Tolerant Linear Broadcasting. 188-201

Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.: Backtrack Searching in the Presence of Symmetry. 203-219
Peter Eades, M. Keil, Paul D. Manuel, Mirka Miller: Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. 220-237
Gerth Stølting Brodal: Partially Persistent Data Structures of Bounded Degree with Constant Update Time. 238-255
Sridhar Natarajan, Alan P. Sprague: Disjoint Paths in Circular Arc Graphs. 256-270
J.-C. Chen: Proportion Split Sort. 271-279
Chuan-Heng Ang, Hanan Samet: Approximate Average Storage Utilization of Bucket Methods with Arbitrary Fanout. 280-291

Rolf G. Karlsson, Andrzej Lingas: Guest Editor's Foreword. 293-294
Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting: Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. 295-322
Thore Husfeldt, Theis Rauhe, Søren Skyum: Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. 323-336
Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan: The Randomized Complexity of Maintaining the Minimum. 337-351
David Fernández-Baca, Giora Slutzki, David Eppstein: Using Sparsification for Parametric Minimum Spanning Tree Problems. 352-366
Madhav V. Marathe, R. Ravi, Ravi Sundaram: Service-Constrained Network Design Problems. 367-387
Takao Asano, Takao Ono, Tomio Hirata: Approximation Algorithms for the Maximum Satisfiability Problem. 388-404
Hoong Chuin Lau, Osamu Watanabe: Randomized Approximation of the Constraint Satisfaction Problem. 405-424
Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan: Approximate Hypergraph Coloring. 425-439