Nordic Journal of Computing, Volume 3

Spring 1996, Volume 3, Number 1

• Y. H. Tsin and C.-A. Wang. Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. Nordic Journal of Computing, 3(1):1-26, Spring 1996. Abstract, References, etc.

• J. Katajainen, T. Pasanen, and J. Teuhola. Practical In-Place Mergesort. Nordic Journal of Computing, 3(1):27-40, Spring 1996. Abstract, References, etc.

• H. Seidl. Least and Greatest Solutions of Equations over N. Nordic Journal of Computing, 3(1):41-62, Spring 1996. Abstract, References, Citations, etc.

• S. G. Akl and I. Stojmenovic. Generating t-ary Trees in Parallel. Nordic Journal of Computing, 3(1):63-71, Spring 1996. Abstract, References, Citations, etc.

• A. Datta, A. Maheshwari, and J.-R. Sack. Optimal Parallel Algorithms for Direct Dominance Problems. Nordic Journal of Computing, 3(1):72-88, Spring 1996. Abstract, References, Citations, etc.

Summer 1996, Volume 3, Number 2

• C.-Z. Lin, C.-C. Tseng, Y.-L. Chen, and T.-W. Kuo. A Systematic Approach to Synthesize Data Alignment Directives for Distributed Memory Machines. Nordic Journal of Computing, 3(2):89-119, Summer 1996. Abstract, etc.

• L. Malmi. A New Method for Updating and Rebalancing Tree-Type Main Memory Dictionaries. Nordic Journal of Computing, 3(2):111-130, Summer 1996. Abstract, References, etc.

• H. Linnestad. Fatal Steps of Knuth-Bendix Completion. Nordic Journal of Computing, 3(2):131-143, Summer 1996. Abstract, References, etc.

• F. Nielson and H. Riis Nielson. Operational Semantics of Termination Types. Nordic Journal of Computing, 3(2):144-187, Summer 1996. Abstract, References, etc.

• K. Diks and A. Pelc. Fault-Tolerant Linear Broadcasting. Nordic Journal of Computing, 3(2):188-201, Summer 1996. Abstract, References, etc.

Fall 1996, Volume 3, Number 3

• C. A. Brown, L. Finkelstein, and P. W. Purdom Jr.. Backtrack Searching in the Presence of Symmetry. Nordic Journal of Computing, 3(3):203-219, Fall 1996. Abstract, References, etc.

• P. Eades, M. Keil, P. D. Manuel, and M. Miller. Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nordic Journal of Computing, 3(3):220-237, Fall 1996. Abstract, References, etc.

• G. S. Brodal. Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nordic Journal of Computing, 3(3):238-255, Fall 1996. Abstract, References, Citations, etc.

• S. Natarajan and A. P. Sprague. Disjoint Paths in Circular Arc Graphs. Nordic Journal of Computing, 3(3):256-270, Fall 1996. Abstract, References, etc.

• J.-C. Chen. Proportion Split Sort. Nordic Journal of Computing, 3(3):271-279, Fall 1996. Abstract, etc.

• C.-H. Ang and H. Samet. Approximate Average Storage Utilization of Bucket Methods with Arbitrary Fanout. Nordic Journal of Computing, 3(3):280-291, Fall 1996. Abstract, References, etc.

Winter 1996, Volume 3, Number 4

Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), July 3-5, 1996

• R. Karlsson and A. Lingas. Guest Editor's Foreword. Nordic Journal of Computing, 3(4):293-294, Winter 1996.

• T. W. Lam, W. K. Sung, and H. F. Ting. Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. Nordic Journal of Computing, 3(4):295-322, Winter 1996. Abstract, References, etc.

• T. Husfeldt, T. Rauhe, and S. Skyum. Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. Nordic Journal of Computing, 3(4):323-336, Winter 1996. Abstract, References, etc.

• G. S. Brodal, S. Chaudhuri, and J. Radhakrishnan. The Randomized Complexity of Maintaining the Minimum. Nordic Journal of Computing, 3(4):337-351, Winter 1996. Abstract, References, etc.

• D. Fernàndez-Baca, G. Slutzki, and D. Eppstein. Using Sparsification for Parametric Minimum Spanning Tree Problems. Nordic Journal of Computing, 3(4):352-366, Winter 1996. Abstract, References, Citations, etc.

• M. V. Marathe, R. Ravi, and R. Sundaram. Service-Constrained Network Design Problems. Nordic Journal of Computing, 3(4):367-387, Winter 1996. Abstract, References, Citations, etc.

• T. Asano, T. Ono, and T. Hirata. Approximation Algorithms for the Maximum Satisfiability Problem. Nordic Journal of Computing, 3(4):388-404, Winter 1996. Abstract, References, etc.

• H. C. Lau and O. Watanabe. Randomized Approximation of the Constraint Satisfaction Problem. Nordic Journal of Computing, 3(4):405-424, Winter 1996. Abstract, References, etc.

• N. Alon, P. Kelsen, S. Mahajan, and H. Ramesh. Approximate Hypergraph Coloring. Nordic Journal of Computing, 3(4):425-439, Winter 1996. Abstract, References, etc.

Shortcuts: