default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNordic Journal of Computing, Volume 2
Volume 2, Number 1, Spring 1995
- Esko Ukkonen:
Editor's Foreword. Nord. J. Comput. 2(1): 1-2 (1995) - Mordecai J. Golin, Rajeev Raman, Christian Schwarz, Michiel H. M. Smid:
Simple Randomized Algorithms for Closest Pair Problems. Nord. J. Comput. 2(1): 3-27 (1995) - V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan:
An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets. Nord. J. Comput. 2(1): 28-40 (1995) - Jan Kratochvíl, Paul D. Manuel, Mirka Miller:
Generalized Domination in Chordal Graphs. Nord. J. Comput. 2(1): 41-50 (1995) - Ville Leppänen, Martti Penttonen:
Work-Optimal Simulation of PRAM Models on Meshes. Nord. J. Comput. 2(1): 51-69 (1995) - Michael Vassilakopoulos, Yannis Manolopoulos, Brigitte Kröll:
Efficiency Analysis of Overlapped Quadtrees. Nord. J. Comput. 2(1): 70-84 (1995)
Volume 2, Number 2, Summer 1995
- Bengt Jonsson, Joachim Parrow:
Guest Editors Foreword. Nord. J. Comput. 2(2): 87 (1995) - Olaf Burkart, Bernhard Steffen:
Composition, Decomposition and Model Checking of Pushdown Processes. Nord. J. Comput. 2(2): 89-125 (1995) - Pietro Di Gianantonio, Furio Honsell, Gordon D. Plotkin:
Uncountable Limits and the lambda Calculus. Nord. J. Comput. 2(2): 126-145 (1995) - Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman:
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. Nord. J. Comput. 2(2): 146-180 (1995) - Nax Paul Mendler, Prakash Panangaden, Philip J. Scott, Robert A. G. Seely:
A Logical View of Concurrent Constraint Programming. Nord. J. Comput. 2(2): 181-220 (1995) - Mogens Nielsen, Christian Clausen:
Games and Logics for a Noninterleaving Bisimulation. Nord. J. Comput. 2(2): 221-249 (1995) - Roberto Segala, Nancy A. Lynch:
Probabilistic Simulations for Probabilistic Processes. Nord. J. Comput. 2(2): 250-273 (1995) - Chris Verhoef:
A Congruence Theorem for Structured Operational Semantics with Predicates and Negative Premises. Nord. J. Comput. 2(2): 274-302 (1995)
Volume 2, Number 3, Fall 1995
- C. B. Fraser, Robert W. Irving:
Approximation Algorithms for the Shortest Common Supersequence. Nord. J. Comput. 2(3): 303-325 (1995) - Kuo-Liang Chung, Yu-Wei Chen:
Mapping Pyramids into 3-D Meshes. Nord. J. Comput. 2(3): 326-337 (1995) - Jens Chr. Godskesen, Kim Guldstrand Larsen:
Synthesizing Distinguishing Formulae for Real Time Systems. Nord. J. Comput. 2(3): 338-357 (1995) - Michal Walicki, Manfred Broy:
Structured Specifications and Implementation of Nondeterministic Data Types. Nord. J. Comput. 2(3): 358-395 (1995)
Volume 2, Number 4, Winter 1995
- K.-L. Chung:
Fast Median-Finding on Mesh-Connected Computers with Segmented Buses. Nord. J. Comput. 2(4): 397-406 (1995) - Joachim Parrow:
Interaction Diagrams. Nord. J. Comput. 2(4): 407-443 (1995) - Claus Rick:
A New Flexible Algorithm for the Longest Common Subsequence Problem. Nord. J. Comput. 2(4): 444-461 (1995) - Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks:
Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)
- Jens Clausen, Jakob Krarup:
A Family of Bipartite Cardinality Matching Problems Solvable in O(n2) Time. Nord. J. Comput. 2(4): 496-501 (1995)
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-12-04 01:26 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:
