| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
About the rewriting systems produced by the Knuth-Bendix completion algorithm
|
Metivier, Yves
|
|
1983
|
16 |
1 |
p. 31-34
4 p.
|
artikel
|
| 2 |
Accuracy of approximating queueing network departure processes with independent renewal processes
|
Lester, Lewis Neale
|
|
1983
|
16 |
1 |
p. 43-48
6 p.
|
artikel
|
| 3 |
A modification of the greedy algorithm for vertex cover
|
Clarkson, Kenneth L.
|
|
1983
|
16 |
1 |
p. 23-25
3 p.
|
artikel
|
| 4 |
A representation of disjoint sets with fast initialization
|
Perko, Aarni
|
|
1983
|
16 |
1 |
p. 21-
1 p.
|
artikel
|
| 5 |
Armstrong databases for functional and inclusion dependencies
|
Fagin, Ronald
|
|
1983
|
16 |
1 |
p. 13-19
7 p.
|
artikel
|
| 6 |
Infinite cube-connected cycles
|
Meyer auf der Heide, Friedhelm
|
|
1983
|
16 |
1 |
p. 1-2
2 p.
|
artikel
|
| 7 |
On a language without star
|
Latteux, Michel
|
|
1983
|
16 |
1 |
p. 27-30
4 p.
|
artikel
|
| 8 |
On the subword complexity of locally catenative dol languages
|
Ehrenfeucht, A.
|
|
1983
|
16 |
1 |
p. 7-9
3 p.
|
artikel
|
| 9 |
Open maths problems computer competition
|
Wos, Larry
|
|
1983
|
16 |
1 |
p. 49-50
2 p.
|
artikel
|
| 10 |
Preemptive scheduling of periodic jobs in uniform multiprocessor systems
|
Bertossi, Alan A.
|
|
1983
|
16 |
1 |
p. 3-6
4 p.
|
artikel
|
| 11 |
Relating monotone formula size and monotone depth of boolean functions
|
Wegener, Ingo
|
|
1983
|
16 |
1 |
p. 41-42
2 p.
|
artikel
|
| 12 |
Stabbing c-oriented polygons
|
Güting, Ralf Hartmut
|
|
1983
|
16 |
1 |
p. 35-40
6 p.
|
artikel
|
| 13 |
Traveling salesman cycles are not always subgraphs of Voronoi duals
|
Kantabutra, Vitit
|
|
1983
|
16 |
1 |
p. 11-12
2 p.
|
artikel
|
Tijdschrift beschrijving