| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A fast algorithm for all-pairs Hamming distances
|
Arslan, Abdullah N.
|
|
2018
|
139 |
C |
p. 49-52
|
artikel
|
| 2 |
A note on multiparty communication complexity and the Hales–Jewett theorem
|
Shraibman, Adi
|
|
2018
|
139 |
C |
p. 44-48
|
artikel
|
| 3 |
2-Approximation algorithm for a generalization of scheduling on unrelated parallel machines
|
Azar, Yossi
|
|
2018
|
139 |
C |
p. 39-43
|
artikel
|
| 4 |
A probabilistic algorithm for verifying polynomial middle product in linear time
|
Giorgi, Pascal
|
|
2018
|
139 |
C |
p. 30-34
|
artikel
|
| 5 |
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
|
Stokes, Jonathan
|
|
2018
|
139 |
C |
p. 53-59
|
artikel
|
| 6 |
Constant runtime complexity of term rewriting is semi-decidable
|
Frohn, Florian
|
|
2018
|
139 |
C |
p. 18-23
|
artikel
|
| 7 |
Editorial Board
|
|
|
2018
|
139 |
C |
p. ii
|
artikel
|
| 8 |
Non-depth-first search against independent distributions on an AND–OR tree
|
Suzuki, Toshio
|
|
2018
|
139 |
C |
p. 13-17
|
artikel
|
| 9 |
On NC algorithms for problems on bounded rank-width graphs
|
Das, Bireswar
|
|
2018
|
139 |
C |
p. 64-67
|
artikel
|
| 10 |
On some graphs with a unique perfect matching
|
Chaplick, Steven
|
|
2018
|
139 |
C |
p. 60-63
|
artikel
|
| 11 |
Pairs of majority-decomposing functions
|
Soeken, Mathias
|
|
2018
|
139 |
C |
p. 35-38
|
artikel
|
| 12 |
Revisiting AES related-key differential attacks with constraint programming
|
Gérault, David
|
|
2018
|
139 |
C |
p. 24-29
|
artikel
|
| 13 |
Template Method test pattern
|
Bijlsma, A.
|
|
2018
|
139 |
C |
p. 8-12
|
artikel
|
| 14 |
The complexity of error metrics
|
Keszocze, Oliver
|
|
2018
|
139 |
C |
p. 1-7
|
artikel
|
Tijdschrift beschrijving