| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A hierarchy of tractable satisfiability problems
|
Dalal, Mukesh
|
|
1992
|
44 |
4 |
p. 173-180
8 p.
|
artikel
|
| 2 |
An efficient Write-All algorithm for fail-stop PRAM without initialized memory
|
Shvartsman, Alex A.
|
|
1992
|
44 |
4 |
p. 223-232
10 p.
|
artikel
|
| 3 |
A note on 0.5-bounded greedy algorithms for the 0⧸1 knapsack problem
|
Martello, Silvano
|
|
1992
|
44 |
4 |
p. 221-222
2 p.
|
artikel
|
| 4 |
A note on shortest superstrings with flipping
|
Jiang, Tao
|
|
1992
|
44 |
4 |
p. 195-199
5 p.
|
artikel
|
| 5 |
Cyclic reference counting with lazy mark-scan
|
Lins, Rafael D.
|
|
1992
|
44 |
4 |
p. 215-220
6 p.
|
artikel
|
| 6 |
Degree constrained tree embedding into points in the plane
|
Tamura, Akihisa
|
|
1992
|
44 |
4 |
p. 211-214
4 p.
|
artikel
|
| 7 |
Fault-tolerant routing in unique-path multistage omega network
|
Chang, Hsun-Wen
|
|
1992
|
44 |
4 |
p. 201-204
4 p.
|
artikel
|
| 8 |
On the closure of certain function classes under integer division by polynomially-bounded functions
|
Gupta, Sanjay
|
|
1992
|
44 |
4 |
p. 205-210
6 p.
|
artikel
|
| 9 |
Preservation of integrity constraints in definite DATALOG programs
|
Wang, Ke
|
|
1992
|
44 |
4 |
p. 185-193
9 p.
|
artikel
|
| 10 |
The pre-NTS property is undecidable for context-free grammars
|
Zhang, Louxin
|
|
1992
|
44 |
4 |
p. 181-184
4 p.
|
artikel
|
Tijdschrift beschrijving