![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Nordic Journal of Computing, Volume 8
Volume 8, Number 1, Spring 2001
- Kaisa Sere, Wang Li:
Guest Editors' Foreword. Nord. J. Comput. 8(1): 1 (2001) - Ralph-Johan Back, Luigia Petre, Ivan Porres:
Continuous Action Systems as a Model for Hybrid Systems. Nord. J. Comput. 8(1): 2-21 (2001) - Ana Bove:
Simple General Recursion in Type Theory. Nord. J. Comput. 8(1): 22-42 (2001) - Thomas Hune, Kim Guldstrand Larsen, Paul Pettersson:
Guided Synthesis of Control Programs Using UPPAAL. Nord. J. Comput. 8(1): 43-64 (2001) - Bengt Jonsson, Tiziana Margaria, Gustaf Naeser, Jan Nyström, Bernhard Steffen:
Incremental Requirement Specification for Evolving Systems. Nord. J. Comput. 8(1): 65-87 (2001) - Ronald F. Lutje Spelberg, W. J. Toetenel:
Parametric Real-Time Model Checking Using Splitting Trees. Nord. J. Comput. 8(1): 88-120 (2001) - Simon Mørk:
Distributed Implementation of a Process-Algebra Based Programming Language for Embedded Systems. Nord. J. Comput. 8(1): 121-158 (2001) - Mauno Rönkkö, Xuandong Li:
Linear Hybrid Action Systems. Nord. J. Comput. 8(1): 159- (2001)
Volume 8, Number 2, Summer 2001
- Thomas Ottmann, Sven Schuierer, Subbiah Soundaralakshmi:
Enumerating Extreme Points in Higher Dimensions. 179-192 - Kaisa Sere, Marina Waldén:
Structuring and Verifying Distributed Algorithms. 193-218 - Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan:
Approximating a Minimum Manhattan Network. 219-232 - Hanne Riis Nielson, Flemming Nielson:
Shape Analysis for Mobile Ambients. 233-275
Volume 8, Number 3, Fall 2001
- Magne Haveraaen, Olaf Owe:
Guest Editors' Foreword. Nord. J. Comput. 8(3): 277-278 (2001) - Walter Dosch, Sönke Magnussen:
Computer Aided Fusion for Algebraic Program Derivation. 279-297 - Yngve Lamo, Michal Walicki:
Specification of Parametrized Programs - Persistency Revisited. 298-323 - Viktor Petersson, Sergei G. Vorobyov:
A Randomized Subexponential Algorithm for Parity Games. 324-345 - Harald Fecher:
A Real-Time Process Algebra with Open Intervals and Maximal Progress. 346-365 - Tarmo Uustalu, Varmo Vene, Alberto Pardo:
Recursion Schemes from Comonads. 366-390 - José Emilio Labra Gayo, Juan Manuel Cueva Lovelle, María Cándida Luengo Díez, Agustín Cernuda del Río:
Modular Development of Interpreters from Semantic Building Blocks. 391-407
Volume 8, Number 4, Winter 2001
- Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila:
Time-Series Similarity Problems and Well-Separated Geometric Sets. 409-423 - Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem. 424-436 - Bernd Grobauer, Julia L. Lawall:
Partial Evaluation of Pattern Matching in Strings, revisited. 437-462 - Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
The Competitive Ratio for On-Line Dual Bin Packing with Restricted Input Sequences. 463-472 - Jochen Burghardt:
Maintaining Partial Sums in Logarithmic Time. 473-474
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.