nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An efficient approach to cyclic reference counting based on a coarse-grained search
|
Lin, Chin-Yang |
|
2010 |
111 |
1 |
p. 1-10 10 p. |
artikel |
2 |
An improved lower bound on query complexity for quantum PAC learning
|
Zhang, Chi |
|
2010 |
111 |
1 |
p. 40-45 6 p. |
artikel |
3 |
Connecting face hitting sets in planar graphs
|
Schweitzer, Pascal |
|
2010 |
111 |
1 |
p. 11-15 5 p. |
artikel |
4 |
Domination number of Cartesian products of directed cycles
|
Zhang, Xindong |
|
2010 |
111 |
1 |
p. 36-39 4 p. |
artikel |
5 |
Editorial Board
|
|
|
2010 |
111 |
1 |
p. IFC- 1 p. |
artikel |
6 |
E-passport EAC scheme based on Identity-Based Cryptography
|
Li, C.H. |
|
2010 |
111 |
1 |
p. 26-30 5 p. |
artikel |
7 |
Learning parities in the mistake-bound model
|
Buhrman, Harry |
|
2010 |
111 |
1 |
p. 16-21 6 p. |
artikel |
8 |
Online malleable job scheduling for m ⩽ 3
|
Havill, Jessen T. |
|
2010 |
111 |
1 |
p. 31-35 5 p. |
artikel |
9 |
Root-restricted Kleenean rotations
|
Pallo, Jean Marcel |
|
2010 |
111 |
1 |
p. 46-50 5 p. |
artikel |
10 |
Super-connected but not super edge-connected graphs
|
Zhou, Jin-Xin |
|
2010 |
111 |
1 |
p. 22-25 4 p. |
artikel |