nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Average complexity of backward q-gram string matching algorithms
|
Salmela, Leena |
|
2012 |
112 |
11 |
p. 433-437 5 p. |
artikel |
2 |
Bandwidth of convex bipartite graphs and related graphs
|
Shrestha, Anish Man Singh |
|
2012 |
112 |
11 |
p. 411-417 7 p. |
artikel |
3 |
Concurrent non-malleable statistically hiding commitment
|
Zhang, Zongyang |
|
2012 |
112 |
11 |
p. 443-448 6 p. |
artikel |
4 |
Drawing trees in a streaming model
|
Binucci, Carla |
|
2012 |
112 |
11 |
p. 418-422 5 p. |
artikel |
5 |
Editorial Board
|
|
|
2012 |
112 |
11 |
p. IFC- 1 p. |
artikel |
6 |
Efficient precomputation schemes of k P + l Q
|
Lin, Qiping |
|
2012 |
112 |
11 |
p. 462-466 5 p. |
artikel |
7 |
On the nonnegative rank of distance matrices
|
Hrubeš, Pavel |
|
2012 |
112 |
11 |
p. 457-461 5 p. |
artikel |
8 |
Quadratic-time algorithm for a string constrained LCS problem
|
Deorowicz, Sebastian |
|
2012 |
112 |
11 |
p. 423-426 4 p. |
artikel |
9 |
Recursive sum–product algorithm for generalized outer-planar graphs
|
Cheng, Qiang |
|
2012 |
112 |
11 |
p. 449-456 8 p. |
artikel |
10 |
The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers
|
Wang, Qingju |
|
2012 |
112 |
11 |
p. 427-432 6 p. |
artikel |
11 |
The quantum query complexity of learning multilinear polynomials
|
Montanaro, Ashley |
|
2012 |
112 |
11 |
p. 438-442 5 p. |
artikel |