nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Cycles embedding in hypercubes with node failures
|
Tsai, Chang-Hsiung |
|
2007 |
102 |
6 |
p. 242-246 5 p. |
artikel |
2 |
Editorial Board
|
|
|
2007 |
102 |
6 |
p. IFC- 1 p. |
artikel |
3 |
Efficient domination in circulant graphs with two chord lengths
|
Obradović, Nenad |
|
2007 |
102 |
6 |
p. 253-258 6 p. |
artikel |
4 |
Fast exact string matching algorithms
|
Lecroq, Thierry |
|
2007 |
102 |
6 |
p. 229-235 7 p. |
artikel |
5 |
Fault diameter of product graphs
|
Xu, Jun-Ming |
|
2007 |
102 |
6 |
p. 226-228 3 p. |
artikel |
6 |
Jebelean–Weber's algorithm without spurious factors
|
Sedjelmaci, Sidi Mohamed |
|
2007 |
102 |
6 |
p. 247-252 6 p. |
artikel |
7 |
Lower bounds for testing Euclidean Minimum Spanning Trees
|
Ben-Zwi, Oren |
|
2007 |
102 |
6 |
p. 219-225 7 p. |
artikel |
8 |
Maximizing the throughput of parallel jobs on hypercubes
|
Ye, Deshi |
|
2007 |
102 |
6 |
p. 259-263 5 p. |
artikel |
9 |
State explosion in almost-sure probabilistic reachability
|
Laroussinie, François |
|
2007 |
102 |
6 |
p. 236-241 6 p. |
artikel |