Journal: Nord. J. Comput.

Volume 1, Issue 4

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

Volume 1, Issue 3

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

Volume 1, Issue 2

173 -- 201Jean R. S. Blair, Barry W. Peyton. On Finding Minimum-Diameter Clique Trees
202 -- 213Kris Coolsaet, Veerle Fack, H. De Meyer. A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors
214 -- 230Sushil Jajodia, Ravi Mukkamala, K. V. S. Ramarao. A View-Based Dynamic Replication Control Algorithm
231 -- 245Ravi Janardan, Franco P. Preparata. Widest-Corridor Problems
246 -- 263Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger. Some Geometric Clustering Problems
264 -- 267Klaus Jansen. Integral Flow with Disjoint Bundles
268 -- 0John W. Krussel, Barry Schaudt. A Note on Higher Order Voronoi Diagrams

Volume 1, Issue 1

3 -- 37Kathleen Fisher, Furio Honsell, John C. Mitchell. A lambda Calculus of Objects and Method Specialization
38 -- 49Torben Hagerup, Margin Maas. Generalized Topological Sorting in Linear Time
50 -- 76Thomas F. Melham. A Mechanized Theory of the Pi-Calculus in HOL
77 -- 93Hanspeter Mössenböck. Extensibility in the Oberon System
94 -- 110Pekka Orponen. Neural Networks and Complexity Theory
111 -- 134Hans Leo Bodlaender, Gerard Tel, Nicola Santoro. Trade-Offs in Non-Reversing Diameter
135 -- 156Olav Lysne. Heuristics for Completion in Automatic Proofs by Structural Induction
157 -- 171Jan Arne Telle. Complexity of Domination-Type Problems in Graphs