| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An intuitive and simple bounding argument for Quicksort
|
Fredman, Michael L.
|
|
2014
|
114 |
3 |
p. 137-139
3 p.
|
artikel
|
| 2 |
A simpler counterexample to a long-standing conjecture on the complexity of Bryantʼs apply algorithm
|
Bollig, Beate
|
|
2014
|
114 |
3 |
p. 124-129
6 p.
|
artikel
|
| 3 |
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
|
Wawrzyniak, Wojciech
|
|
2014
|
114 |
3 |
p. 94-98
5 p.
|
artikel
|
| 4 |
Differential attack on nine rounds of the SEED block cipher
|
Lu, Jiqiang
|
|
2014
|
114 |
3 |
p. 116-123
8 p.
|
artikel
|
| 5 |
Editorial Board
|
|
|
2014
|
114 |
3 |
p. IFC-
1 p.
|
artikel
|
| 6 |
Efficient multiple-precision integer division algorithm
|
Mukhopadhyay, Debapriyay
|
|
2014
|
114 |
3 |
p. 152-157
6 p.
|
artikel
|
| 7 |
Excessively duplicating patterns represent non-regular languages
|
Creus, Carles
|
|
2014
|
114 |
3 |
p. 85-93
9 p.
|
artikel
|
| 8 |
Maximum common induced subgraph parameterized by vertex cover
|
Abu-Khzam, Faisal N.
|
|
2014
|
114 |
3 |
p. 99-103
5 p.
|
artikel
|
| 9 |
Modeling time criticality of information
|
Rovan, Branislav
|
|
2014
|
114 |
3 |
p. 147-151
5 p.
|
artikel
|
| 10 |
Novel bit-parallel multiplier for GF ( 2 m ) defined by all-one polynomial using generalized Karatsuba algorithm
|
Xie, Xiao-ning
|
|
2014
|
114 |
3 |
p. 140-146
7 p.
|
artikel
|
| 11 |
On the complexity of the Monte Carlo method for incremental PageRank
|
Lofgren, Peter
|
|
2014
|
114 |
3 |
p. 104-106
3 p.
|
artikel
|
| 12 |
Optimum sweeps of simple polygons with two guards
|
Tan, Xuehou
|
|
2014
|
114 |
3 |
p. 130-136
7 p.
|
artikel
|
| 13 |
Security weaknesses of a signature scheme and authenticated key agreement protocols
|
Nose, Peter
|
|
2014
|
114 |
3 |
p. 107-115
9 p.
|
artikel
|
Tijdschrift beschrijving