default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNordic Journal of Computing, Volume 1
Volume 1, Number 1, Spring 1994
- Kathleen Fisher, Furio Honsell, John C. Mitchell:
A lambda Calculus of Objects and Method Specialization. Nord. J. Comput. 1(1): 3-37 (1994) - Torben Hagerup, Martin Maas:
Generalized Topological Sorting in Linear Time. Nord. J. Comput. 1(1): 38-49 (1994) - Thomas F. Melham:
A Mechanized Theory of the Pi-Calculus in HOL. Nord. J. Comput. 1(1): 50-76 (1994) - Hanspeter Mössenböck:
Extensibility in the Oberon System. Nord. J. Comput. 1(1): 77-93 (1994)
- Pekka Orponen:
Neural Networks and Complexity Theory. Nord. J. Comput. 1(1): 94-110 (1994)
- Hans L. Bodlaender, Gerard Tel, Nicola Santoro:
Trade-Offs in Non-Reversing Diameter. Nord. J. Comput. 1(1): 111-134 (1994) - Olav Lysne:
Heuristics for Completion in Automatic Proofs by Structural Induction. Nord. J. Comput. 1(1): 135-156 (1994) - Jan Arne Telle:
Complexity of Domination-Type Problems in Graphs. Nord. J. Comput. 1(1): 157-171 (1994)
Volume 1, Number 2, Summer 1994
- Jean R. S. Blair, Barry W. Peyton:
On Finding Minimum-Diameter Clique Trees. Nord. J. Comput. 1(2): 173-201 (1994) - Kris Coolsaet, Veerle Fack, Hans E. De Meyer:
A Tabular Method for Verification of Data Exchange Algorithms on Networks of Parallel Processors. Nord. J. Comput. 1(2): 202-213 (1994) - Sushil Jajodia, Ravi Mukkamala, K. V. S. Ramarao:
A View-Based Dynamic Replication Control Algorithm. Nord. J. Comput. 1(2): 214-230 (1994) - Ravi Janardan, Franco P. Preparata:
Widest-Corridor Problems. Nord. J. Comput. 1(2): 231-245 (1994) - Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger:
Some Geometric Clustering Problems. Nord. J. Comput. 1(2): 246-263 (1994)
- Klaus Jansen:
Integral Flow with Disjoint Bundles. Nord. J. Comput. 1(2): 264-267 (1994) - John W. Krussel, Barry Schaudt:
A Note on Higher Order Voronoi Diagrams. Nord. J. Comput. 1(2): 268- (1994)
Volume 1, Number 3, Fall 1994
- Andrzej Lingas:
Editor's Foreword. Nord. J. Comput. 1(3): 273 (1994) - Madhav V. Marathe, Harry B. Hunt III, S. S. Ravi:
The Complexity of Approximation PSPACE-Complete Problems for Hierarchical Specifications. Nord. J. Comput. 1(3): 275-316 (1994) - Viggo Kann:
Polynomially Bounded Minimization Problems That Are Hard to Approximate. Nord. J. Comput. 1(3): 317-331 (1994) - Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. 1(3): 332-345 (1994) - Klaus Havelund, Kim Guldstrand Larsen:
The Fork Calculus. Nord. J. Comput. 1(3): 346-363 (1994) - Hardi Hungar, Bernhard Steffen:
Local Model-Checking for Context-Free Processes. Nord. J. Comput. 1(3): 364- (1994)
Volume 1, Number 4, Winter 1994
- Sven Skyum:
Guest Editor's Foreword. Nord. J. Comput. 1(4): 387- (1994) - Peter Becker:
A New Algorithm for the Construction of Optimal B-Trees. Nord. J. Comput. 1(4): 389-401 (1994) - Eric Schenk:
Parallel Dynamic Lowest Common Ancestors. Nord. J. Comput. 1(4): 402-432 (1994) - Gautam Das, Paul J. Heffernan, Giri Narasimhan:
Finding all Weakly-Visible Chords of a Polygon in Linear Time. Nord. J. Comput. 1(4): 433-457 (1994) - Sven Schuierer:
An O(log log n) Time Algorithm to Compute the Kernel of a Polygon. Nord. J. Comput. 1(4): 458-474 (1994) - Magnús M. Halldórsson, Jaikumar Radhakrishnan:
Improved Approximations of Independent Sets in Bounded-Degree Graphs via Subgraph Removal. Nord. J. Comput. 1(4): 475-492 (1994) - Marcus Peinado:
Hard Graphs for the Randomized Boppana-Halldörsson Algorithm for MAXCLIQUE. Nord. J. Comput. 1(4): 493- (1994)
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:37 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:
