nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A faster FPT algorithm for 3-path vertex cover
|
Katrenič, Ján |
|
2016 |
116 |
4 |
p. 273-278 6 p. |
artikel |
2 |
Capacity and delay analysis in delay tolerant network with multiple communities
|
Wu, Yahui |
|
2016 |
116 |
4 |
p. 310-315 6 p. |
artikel |
3 |
Editorial Board
|
|
|
2016 |
116 |
4 |
p. IFC- 1 p. |
artikel |
4 |
Improving counting Bloom filter performance with fingerprints
|
Pontarelli, Salvatore |
|
2016 |
116 |
4 |
p. 304-309 6 p. |
artikel |
5 |
Inefficiency analysis of the scheduling game on limited identical machines with activation costs
|
Xie, Fang |
|
2016 |
116 |
4 |
p. 316-320 5 p. |
artikel |
6 |
Introducing the counter mode of operation to Compressed Sensing based encryption
|
Fay, Robin |
|
2016 |
116 |
4 |
p. 279-283 5 p. |
artikel |
7 |
On message authentication with a correlated setup
|
Jiang, Shaoquan |
|
2016 |
116 |
4 |
p. 289-293 5 p. |
artikel |
8 |
On the construction of all shortest node-disjoint paths in star networks
|
Lai, Cheng-Nan |
|
2016 |
116 |
4 |
p. 299-303 5 p. |
artikel |
9 |
On the expressive power of Kleene algebra with domain
|
Struth, Georg |
|
2016 |
116 |
4 |
p. 284-288 5 p. |
artikel |
10 |
Sufficient conditions for edit-optimal clusters
|
Damaschke, Peter |
|
2016 |
116 |
4 |
p. 267-272 6 p. |
artikel |
11 |
The (k,ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy
|
Dantas, Simone |
|
2016 |
116 |
4 |
p. 294-298 5 p. |
artikel |