Nordic Journal of Computing, Volume 4

Volume 4, Number 1, Spring 1997

Theme Issue on Programming Environments

Kai Koskimies: Theme Issue on Programming Environments - Editor's Foreword. 1-2 BibTeX
Jukka Paakki, Jussi Koskinen, Airi Salminen: From Relational Program Dependencies to Hypertextual Access Structures. 3-36 BibTeX
S. G. Efremidis, Khalid Azim Mughal, John H. Reppy, L. Søraas: AML: Attribute Grammars in ML. 37-65 BibTeX
Jan Bosch: Delegating Compiler Objects: Modularity and Reusability in Language Engineering. 66-92 BibTeX
Görel Hedin: Attribute Extensions - a Technique for Enforcing Programming Conventions. 93-122 BibTeX
Dag I. K. Sjøberg, Ray Welland, Malcolm P. Atkinson, Paul Philbrow, Cathy Waite, S. Macneill: The Persistent Workshop - a Programming Environment for Napier88. 123-149 BibTeX

Giorgio Gambosi, Alberto Postiglione, Maurizio Talamo: On-Line Maintenance of an Approximate Bin-Packing Solution. 151-166 BibTeX
Thomas Roos: New Upper Bounds on Voronoi Diagrams of Moving Points. 167-171 BibTeX
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara: An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. 172-186 BibTeX
Emmanuel Roche: Compact Factorization of Finite-State Transducers and Finite-State Automata. 187-216 BibTeX
Mehryar Mohri: String-Matching with Automata. 217-231 BibTeX

Lars Lundberg, Håkan Lennerstad: Bounding the Gain of Changing the Number of Memory Modules in Shared Memory Multiprocessors. 233-258 BibTeX
Jens Palsberg, Trevor Jim: Type Inference with Simple Selftypes is NP-complete. 259-286 BibTeX
Tibor Gyimóthy, Tamás Horváth: Learning Semantic Functions of Attribute Grammars. 287-302 BibTeX
Atsuko Yamaguchi, Koji Nakano, Satoru Miyano: An Approximation Algorithm for the Minimum Common Supertree Problem. 303-316 BibTeX

Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro: Time-Message Trade-Offs for the Weak Unison Problem. 317-341 BibTeX
Asish Mukhopadhyay, Alok Aggrawal, Ravi Mohan Hosabettu: On the Ordinary Line Problem in Computational Geometry. 330-341 BibTeX
Madhumangal Pal, G. P. Bhattacharjee: An Optimal Parallel Algorithm for All-Pairs Shortest Paths on Unweighted Interval Graphs. 342-356 BibTeX
Owen Kaser: Optimal Height Reduction Problems for Tree-Structured Hierarchies. 357-379 BibTeX
M. Hakan Erdogmus: Architecture-Driven Verification of Concurrent Systems. 380- BibTeX