nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A decidable propositional dynamic logic with explicit probabilities
|
Feldman, Yishai A. |
|
1984 |
63 |
1-2 |
p. 11-38 28 p. |
artikel |
2 |
An approach for generating different types of gray codes
|
Arazi, Benjamin |
|
1984 |
63 |
1-2 |
p. 1-10 10 p. |
artikel |
3 |
A programming language for the inductive sets, and applications
|
Harel, David |
|
1984 |
63 |
1-2 |
p. 118-139 22 p. |
artikel |
4 |
Call for papers
|
|
|
1984 |
63 |
1-2 |
p. 140-141 2 p. |
artikel |
5 |
Can message buffers be axiomatized in linear temporal logic?
|
Sistla, A.P. |
|
1984 |
63 |
1-2 |
p. 88-112 25 p. |
artikel |
6 |
Direction independent context-sensitive grammars
|
Kleijn, H.C.M. |
|
1984 |
63 |
1-2 |
p. 113-117 5 p. |
artikel |
7 |
Editorial Board
|
|
|
1984 |
63 |
1-2 |
p. i- 1 p. |
artikel |
8 |
Fast probabilistic RAM simulation of single tape turing machine computations
|
Robson, J.M. |
|
1984 |
63 |
1-2 |
p. 67-87 21 p. |
artikel |
9 |
Geometric retrieval problems
|
Cole, Richard |
|
1984 |
63 |
1-2 |
p. 39-57 19 p. |
artikel |
10 |
The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete
|
Narendran, Paliath |
|
1984 |
63 |
1-2 |
p. 58-66 9 p. |
artikel |