nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A measure in which Boolean negation is exponentially powerful
|
Skyum, Sven |
|
1983 |
17 |
3 |
p. 125-128 4 p. |
artikel |
2 |
A note on the complexity of a partition algorithm
|
Lifschitz, Vladimir |
|
1983 |
17 |
3 |
p. 117-120 4 p. |
artikel |
3 |
Folding of the plane and the design of systolic arrays
|
Choffrut, C. |
|
1983 |
17 |
3 |
p. 149-153 5 p. |
artikel |
4 |
On the arithmetic complexity of matrix Kronecker powers
|
Seroussi, Gadiel |
|
1983 |
17 |
3 |
p. 145-148 4 p. |
artikel |
5 |
On the ‘correct prefix property’ in precedence parsers
|
Wyrostek, Piotr |
|
1983 |
17 |
3 |
p. 161-165 5 p. |
artikel |
6 |
On the subword complexity of m-free D0L languages
|
Ehrenfeucht, A. |
|
1983 |
17 |
3 |
p. 121-124 4 p. |
artikel |
7 |
Precise typing and filters
|
Martin, Johannes J. |
|
1983 |
17 |
3 |
p. 109-112 4 p. |
artikel |
8 |
Reconstructing sequential behavior from parallel behavior projections
|
Weiser, Mark |
|
1983 |
17 |
3 |
p. 129-135 7 p. |
artikel |
9 |
Semi-linearity, parikh-boundedness and tree adjunct languages
|
Yokomori, Takashi |
|
1983 |
17 |
3 |
p. 137-143 7 p. |
artikel |
10 |
Space as time
|
Fariñas, Luis |
|
1983 |
17 |
3 |
p. 113-115 3 p. |
artikel |
11 |
The Duodirun merging algorithm: A new fast algorithm for parallel merging
|
Zheng, Zhi-Jie |
|
1983 |
17 |
3 |
p. 167-168 2 p. |
artikel |
12 |
The problem of absolute privacy
|
Williams, M.H. |
|
1983 |
17 |
3 |
p. 169-171 3 p. |
artikel |
13 |
Verifying programs by induction on their data structure: General format and applications
|
Mili, Ali |
|
1983 |
17 |
3 |
p. 155-160 6 p. |
artikel |