Result 101 to 120 of 301 total
Code synthesis for timed automata. (English)
Nord. J. Comput. 9, No. 4, 269-300 (2002).
101
Summary of the subworkshop on extreme programming. (English)
Nord. J. Comput. 9, No. 3, 261-265 (2002).
102
A pattern-based J2EE application development environment. (English)
Nord. J. Comput. 9, No. 3, 248-260 (2002).
103
A web-based support environment for software engineering experiments. (English)
Nord. J. Comput. 9, No. 3, 231-247 (2002).
104
Elucidative program tutorials. (English)
Nord. J. Comput. 9, No.3, 209-230 (2002).
105
Safe dynamic multiple inheritance. (English)
Nord. J. Comput. 9, No.3, 191-208 (2002).
106
Temporal concurrent constraint programming: Denotation, logic and applications. (English)
Nord. J. Comput. 9, No.2, 145-188 (2002).
107
An automata-theoretic approach to the reachability analysis of RPPS systems. (English)
Nord. J. Comput. 9, No.2, 118-144 (2002).
108
Independence-friendly modal logic and true concurrency. (English)
Nord. J. Comput. 9, No.2, 102-117 (2002).
109
On decidability of the control reachability problem in the asynchronous $π$-calculus. (English)
Nord. J. Comput. 9, No.2, 70-101 (2002).
110
Special issue: Selected papers from the 8th international workshop on expressiveness in concurrency, EXPRESS ’01, Aalborg, Denmark, August 20, 2001 (satellite event to CONCUR 2001). (English)
Nord. J. Comput. 9, No.2, 69-188 (2002).
111
Blood from Dahm’s turnip. (English)
Nord. J. Comput. 9, No. 1, 66-68 (2002).
112
Approximate string matching with gaps. (English)
Nord. J. Comput. 9, No. 1, 54-65 (2002).
113
Improved exploration of rectilinear polygons. (English)
Nord. J. Comput. 9, No. 1, 32-53 (2002).
114
Approximation algorithms for the bottleneck stretch factor problem. (English)
Nord. J. Comput. 9, No. 1, 13-31 (2002).
115
How to circumvent Church numerals. (English)
Nord. J. Comput. 9, No. 1, 1-12 (2002).
116
Maintaining partial sums in logarithmic time. (English)
Nord. J. Comput. 8, No.4, 473-474 (2001).
117
The competitive ratio for on-line dual bin packing with restricted input sequences. (English)
Nord. J. Comput. 8, No.4, 463-472 (2001).
118
Partial evaluation of pattern matching in strings, revisited. (English)
Nord. J. Comput. 8, No.4, 437-462 (2001).
119
A new algorithm for the maximum-weight clique problem. (English)
Nord. J. Comput. 8, No.4, 424-436 (2001).
120
Result 101 to 120 of 301 total
Start
Contact
Print
General Help
