default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNordic Journal of Computing, Volume 7
Volume 7, Number 1, Spring 2000
- Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter:
Pattern-Matching Problems for Two-Dimensional Images Described by Finite Automata. Nord. J. Comput. 7(1): 1-13 (2000) - Hans L. Bodlaender, Klaus Jansen:
On the Complexity of the Maximum Cut Problem. Nord. J. Comput. 7(1): 14-31 (2000) - Joachim Gudmundsson, Christos Levcopoulos:
A Parallel Approximation Algorithm for Minimum Weight Triangulation. Nord. J. Comput. 7(1): 32-57 (2000) - Michele Zito:
Linear Time Maximum Induced Matching Algorithm for Trees. Nord. J. Comput. 7(1): 58- (2000)
Volume 7, Number 2, Summer 2000
- Andreas L. Opdahl, Dag I. K. Sjøberg:
Guest Editors' Foreword: Programming and Software Development Environment Research in the Nordic Countries. Nord. J. Comput. 7(2): 65-66 (2000) - Eva Magnusson, Görel Hedin:
Program Visualization Using Reference Attributed Grammars. Nord. J. Comput. 7(2): 67-86 (2000) - Kurt Nørmark:
Elucidative Programming. Nord. J. Comput. 7(2): 87-105 (2000) - Thomas Vestdam:
Documentation Threads - Presentation of Fragmented Documentation. Nord. J. Comput. 7(2): 106-125 (2000) - Maarit Harsu:
Identifying Object-Oriented Features from Procedural Software. Nord. J. Comput. 7(2): 126-142 (2000) - Lars Bendix, Ulf Asklund, Jonas Persson:
Summary of the Subworkshop on Change Management for Open Source Software. Nord. J. Comput. 7(2): 143- (2000)
Volume 7, Number 3, Fall 2000
- Magnús M. Halldórsson:
Guest Editor's Foreword. Nord. J. Comput. 7(3): 149-150 (2000) - Rasmus Pagh:
A Trade-Off for Worst-Case Efficient Dictionaries. Nord. J. Comput. 7(3): 151-163 (2000) - Anne Berry, Jean Paul Bordat, Pinar Heggernes:
Recognizing Weakly Triangulated Graphs by Edge Separability. Nord. J. Comput. 7(3): 164-177 (2000) - Piotr Berman:
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nord. J. Comput. 7(3): 178-184 (2000) - Srinivas Doddi, Madhav V. Marathe, S. S. Ravi, David Scot Taylor, Peter Widmayer:
Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nord. J. Comput. 7(3): 185-203 (2000) - Vincenzo Liberatore:
Scheduling Jobs before Shut-Down. Nord. J. Comput. 7(3): 204-226 (2000) - Pankaj K. Agarwal, Leonidas J. Guibas, Sariel Har-Peled, Alexander Rabinovitch, Micha Sharir:
Penetration Depth of Two Convex Polytopes in 3D. Nord. J. Comput. 7(3): 227-240 (2000) - Tetsuo Asano, Tomomi Matsui, Takeshi Tokuyama:
Optimal Roundings of Sequences and Matrices. Nord. J. Comput. 7(3): 241- (2000)
Volume 7, Number 4, Winter 2000
- Gert Smolka:
Guest Editor's Foreword. Nord. J. Comput. 7(4): 257 (2000) - Martin Hofmann:
A Type System for Bounded Space and Functional In-Place Update. Nord. J. Comput. 7(4): 258-289 (2000) - Laurent Mauborgne:
An Incremental Unique Representation for Regular Trees. Nord. J. Comput. 7(4): 290-311 (2000) - François Pottier:
A Versatile Constraint-Based Type Inference System. Nord. J. Comput. 7(4): 312-347 (2000) - Claudio V. Russo:
First-Class Structures for Standard ML. Nord. J. Comput. 7(4): 348-374 (2000) - Helmut Seidl, Bernhard Steffen:
Constraint-Based Inter-Procedural Analysis of Parallel Programs. Nord. J. Comput. 7(4): 375- (2000)
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 2024-09-18 00:03 CEST 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:
