|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
20 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A bit-string longest-common-subsequence algorithm |
Allison, Lloyd |
1986 |
23 | 5 |
p. 305-310 6 p. |
artikel |
|
| 2 | A linear algorithm for the cutting center of a tree |
Harary, Frank |
1986 |
23 | 5 |
p. 317-319 3 p. |
artikel |
|
| 3 | An alternative implementation of communication primitives |
Van de Snepscheut, Jan L.A. |
1986 |
23 | 5 |
p. 231-238 8 p. |
artikel |
|
| 4 | A new generalization of Dekker's algorithm for mutual exclusion |
Martin, Alain J. |
1986 |
23 | 5 |
p. 295-297 3 p. |
artikel |
|
| 5 | An in situ distributive sort |
Handley, C.C. |
1986 |
23 | 5 |
p. 265-270 6 p. |
artikel |
|
| 6 | A note on complete problems for complexity classes |
Ambos-Spies, Klaus |
1986 |
23 | 5 |
p. 227-230 4 p. |
artikel |
|
| 7 | A note on implementing prolog in LISP |
Stojanovski, Jordan |
1986 |
23 | 5 |
p. 261-264 4 p. |
artikel |
|
| 8 | A note on pure grammars |
Mäkinen, Erkki |
1986 |
23 | 5 |
p. 271-274 4 p. |
artikel |
|
| 9 | A parallel O(log n) algorithm for the drawing of algebraic curves in an n × n square |
Sommerhalder, R. |
1986 |
23 | 5 |
p. 221-226 6 p. |
artikel |
|
| 10 | Author index volume 23 (1986) |
1986 |
23 | 5 |
p. 329-330 2 p. |
artikel |
||
| 11 | Denotational semantics of communicating sequential programs |
Broy, Manfred |
1986 |
23 | 5 |
p. 253-259 7 p. |
artikel |
|
| 12 | Efficient computation of the locally least-cost insertion string for the LR error repair |
Choe, Kwang-Moo |
1986 |
23 | 5 |
p. 311-316 6 p. |
artikel |
|
| 13 | Halfplanar range search in linear space and O(n0.695) query time |
Edelsbrunner, Herbert |
1986 |
23 | 5 |
p. 289-293 5 p. |
artikel |
|
| 14 | L-attributed LL(1)-grammars are LR-attributed |
Nakata, Ikuo |
1986 |
23 | 5 |
p. 325-328 4 p. |
artikel |
|
| 15 | Merging by the parallel jump searching algorithm |
Evans, David John |
1986 |
23 | 5 |
p. 239-246 8 p. |
artikel |
|
| 16 | On the complexity of some extended word problems defined by cancellation rules |
Benois, Michèle |
1986 |
23 | 5 |
p. 281-287 7 p. |
artikel |
|
| 17 | The correctness of nondeterministic programs revisited |
Holenderski, Leszek |
1986 |
23 | 5 |
p. 299-303 5 p. |
artikel |
|
| 18 | The inaccessible set: A classification by query type of security risks in statistical databases |
Leiss, Ernst L. |
1986 |
23 | 5 |
p. 275-279 5 p. |
artikel |
|
| 19 | The value of an array facility in prolog |
Chen, G. |
1986 |
23 | 5 |
p. 247-251 5 p. |
artikel |
|
| 20 | When chasing your tail saves time |
Kieburtz, Richard B. |
1986 |
23 | 5 |
p. 321-324 4 p. |
artikel |
20 gevonden resultaten