nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A correctness certificate for the Stoer–Wagner min-cut algorithm
|
Arikati, Srinivasa R |
|
1999 |
70 |
5 |
p. 251-254 4 p. |
artikel |
2 |
Adding state merging to the DMC data compression algorithm
|
Young-Lai, Matthew |
|
1999 |
70 |
5 |
p. 223-228 6 p. |
artikel |
3 |
A lower bound for quantum search of an ordered list
|
Buhrman, Harry |
|
1999 |
70 |
5 |
p. 205-209 5 p. |
artikel |
4 |
A note on inferring uniquely terminating code languages
|
Emerald, J.D. |
|
1999 |
70 |
5 |
p. 217-222 6 p. |
artikel |
5 |
Ear decomposition with bounds on ear length
|
Franzblau, D.S. |
|
1999 |
70 |
5 |
p. 245-249 5 p. |
artikel |
6 |
Exact learning when irrelevant variables abound
|
Guijarro, David |
|
1999 |
70 |
5 |
p. 233-239 7 p. |
artikel |
7 |
On average edge length of minimum spanning trees
|
Nath, Suman Kumar |
|
1999 |
70 |
5 |
p. 241-243 3 p. |
artikel |
8 |
Simple distributed Δ+1-coloring of graphs
|
Johansson, Öjvind |
|
1999 |
70 |
5 |
p. 229-232 4 p. |
artikel |
9 |
Weighted threshold secret sharing schemes
|
Morillo, P. |
|
1999 |
70 |
5 |
p. 211-216 6 p. |
artikel |