default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNordic 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. Nord. J. Comput. 3(1): 1-26 (1996) - Jyrki Katajainen, Tomi Pasanen, Jukka Teuhola:
Practical In-Place Mergesort. Nord. J. Comput. 3(1): 27-40 (1996) - Helmut Seidl:
Least and Greatest Solutions of Equations over N. Nord. J. Comput. 3(1): 41-62 (1996) - Selim G. Akl, Ivan Stojmenovic:
Generating t-ary Trees in Parallel. Nord. J. Comput. 3(1): 63-71 (1996) - Amitava Datta, Anil Maheshwari, Jörg-Rüdiger Sack:
Optimal Parallel Algorithms for Direct Dominance Problems. Nord. J. Comput. 3(1): 72-88 (1996)
Volume 3, Number 2, Summer 1996
- Chih-Zong Lin, Chien-Chao Tseng, Yi-Lin Chen, Tso-Wei Kuo:
A Systematic Approach to Synthesize Data Alignment Directives for Distributed Memory Machines. Nord. J. Comput. 3(2): 89-119 (1996) - Lauri Malmi:
A New Method for Updating and Rebalancing Tree-Type Main Memory Dictionaries. Nord. J. Comput. 3(2): 111-130 (1996) - Henrik Linnestad:
Fatal Steps of Knuth-Bendix Completion. Nordic Journal of Computing. Nord. J. Comput. 3(2): 131-143 (1996) - Flemming Nielson, Hanne Riis Nielson:
Operational Semantics of Termination Types. Nord. J. Comput. 3(2): 144-187 (1996) - Krzysztof Diks, Andrzej Pelc:
Fault-Tolerant Linear Broadcasting. Nord. J. Comput. 3(2): 188-201 (1996)
Volume 3, Number 3, Fall 1996
- Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom Jr.:
Backtrack Searching in the Presence of Symmetry. Nord. J. Comput. 3(3): 203-219 (1996) - Peter Eades, J. Mark Keil, Paul D. Manuel, Mirka Miller:
Two Minimum Dominating Sets with Minimum Intersection in Chordal Graphs. Nord. J. Comput. 3(3): 220-237 (1996) - Gerth Stølting Brodal:
Partially Persistent Data Structures of Bounded Degree with Constant Update Time. Nord. J. Comput. 3(3): 238-255 (1996) - Sridhar Natarajan, Alan P. Sprague:
Disjoint Paths in Circular Arc Graphs. Nord. J. Comput. 3(3): 256-270 (1996) - Jing-Chao Chen:
Proportion Split Sort. Nord. J. Comput. 3(3): 271-279 (1996) - Chuan-Heng Ang, Hanan Samet:
Approximate Average Storage Utilization of Bucket Methods with Arbitrary Fanout. Nord. J. Comput. 3(3): 280-291 (1996)
Volume 3, Number 4, Winter 1996
- Rolf G. Karlsson, Andrzej Lingas:
Guest Editor's Foreword. Nord. J. Comput. 3(4): 293-294 (1996) - Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting:
Computing the Unrooted Maximum Agreement Subtree in Sub-quadratic Time. Nord. J. Comput. 3(4): 295-322 (1996) - Thore Husfeldt, Theis Rauhe, Søren Skyum:
Lower Bounds for Dynamic Transitive Closure, Planar Point Location, and Parantheses Matching. Nord. J. Comput. 3(4): 323-336 (1996) - Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan:
The Randomized Complexity of Maintaining the Minimum. Nord. J. Comput. 3(4): 337-351 (1996) - David Fernández-Baca, Giora Slutzki, David Eppstein:
Using Sparsification for Parametric Minimum Spanning Tree Problems. Nord. J. Comput. 3(4): 352-366 (1996) - Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Service-Constrained Network Design Problems. Nord. J. Comput. 3(4): 367-387 (1996) - Takao Asano, Takao Ono, Tomio Hirata:
Approximation Algorithms for the Maximum Satisfiability Problem. Nord. J. Comput. 3(4): 388-404 (1996) - Hoong Chuin Lau, Osamu Watanabe:
Randomized Approximation of the Constraint Satisfaction Problem. Nord. J. Comput. 3(4): 405-424 (1996) - Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Ramesh Hariharan:
Approximate Hypergraph Coloring. Nord. J. Comput. 3(4): 425-439 (1996)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-28 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
