| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A faster approximation algorithm for the steiner tree problem in graphs
|
Zelikovsky, Alexander Z.
|
|
1993
|
46 |
2 |
p. 79-83
5 p.
|
artikel
|
| 2 |
A note on minimal visibility graphs
|
Shen, Xiaojun
|
|
1993
|
46 |
2 |
p. 101-
1 p.
|
artikel
|
| 3 |
A proof of the substitution lemma in de Bruijn's notation
|
Ohtsuka, Hiroshi
|
|
1993
|
46 |
2 |
p. 63-66
4 p.
|
artikel
|
| 4 |
A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
|
Makedon, Fillia
|
|
1993
|
46 |
2 |
p. 103-107
5 p.
|
artikel
|
| 5 |
Congruent weak bisimulation with dense real-time
|
Ho-Stuart, Chris
|
|
1993
|
46 |
2 |
p. 55-61
7 p.
|
artikel
|
| 6 |
Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
|
Wegener, Ingo
|
|
1993
|
46 |
2 |
p. 85-87
3 p.
|
artikel
|
| 7 |
Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems
|
Thangavel, P.
|
|
1993
|
46 |
2 |
p. 89-94
6 p.
|
artikel
|
| 8 |
Supporting random access in files of variable length records
|
Moffat, Alistair
|
|
1993
|
46 |
2 |
p. 71-77
7 p.
|
artikel
|
| 9 |
Symmetry of information and one-way functions
|
Longpré, Luc
|
|
1993
|
46 |
2 |
p. 95-100
6 p.
|
artikel
|
| 10 |
Universal traversal sequences for expander graphs
|
Hoory, Shlomo
|
|
1993
|
46 |
2 |
p. 67-69
3 p.
|
artikel
|
Tijdschrift beschrijving