| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A computable version of the Daniell–Stone theorem on integration and linear functionals
|
Wu, Yongcheng
|
|
2006
|
359 |
1-3 |
p. 28-42
15 p.
|
artikel
|
| 2 |
Algorithmic combinatorics based on slicing posets
|
Garg, Vijay K.
|
|
2006
|
359 |
1-3 |
p. 200-213
14 p.
|
artikel
|
| 3 |
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
|
Verhoeven, Yves F.
|
|
2006
|
359 |
1-3 |
p. 58-68
11 p.
|
artikel
|
| 4 |
An efficient algorithm to find a double-loop network that realizes a given L-shape
|
Chen, Chiuyuan
|
|
2006
|
359 |
1-3 |
p. 69-76
8 p.
|
artikel
|
| 5 |
An efficient approach for the rank aggregation problem
|
Dinu, Liviu P.
|
|
2006
|
359 |
1-3 |
p. 455-461
7 p.
|
artikel
|
| 6 |
A note on dimensions of polynomial size circuits
|
Gu, Xiaoyang
|
|
2006
|
359 |
1-3 |
p. 176-187
12 p.
|
artikel
|
| 7 |
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
|
Ryabko, Boris
|
|
2006
|
359 |
1-3 |
p. 440-448
9 p.
|
artikel
|
| 8 |
Approximation schemes for scheduling and covering on unrelated machines
|
Efraimidis, Pavlos S.
|
|
2006
|
359 |
1-3 |
p. 400-417
18 p.
|
artikel
|
| 9 |
Asymptotic analysis of a leader election algorithm
|
Lavault, Christian
|
|
2006
|
359 |
1-3 |
p. 239-254
16 p.
|
artikel
|
| 10 |
Author index
|
|
|
2006
|
359 |
1-3 |
p. 462-463
2 p.
|
artikel
|
| 11 |
Automated pattern detection—An algorithm for constructing optimally synchronizing multi-regular language filters
|
McTague, Carl S.
|
|
2006
|
359 |
1-3 |
p. 306-328
23 p.
|
artikel
|
| 12 |
Averages of automatic sequences
|
Barbé, A.
|
|
2006
|
359 |
1-3 |
p. 255-281
27 p.
|
artikel
|
| 13 |
Completeness in approximation classes beyond APX
|
Escoffier, Bruno
|
|
2006
|
359 |
1-3 |
p. 369-377
9 p.
|
artikel
|
| 14 |
Completing codes and the Rédei property of groups
|
Szabó, Sándor
|
|
2006
|
359 |
1-3 |
p. 449-454
6 p.
|
artikel
|
| 15 |
Distance bounds of ϵ -points on hypersurfaces
|
Pérez-Díaz, Sonia
|
|
2006
|
359 |
1-3 |
p. 344-368
25 p.
|
artikel
|
| 16 |
DLS-trees: A model of evolutionary scenarios
|
Górecki, Paweł
|
|
2006
|
359 |
1-3 |
p. 378-399
22 p.
|
artikel
|
| 17 |
Editorial board v-ix
|
|
|
2006
|
359 |
1-3 |
p. v-ix
nvt p.
|
artikel
|
| 18 |
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm
|
Nebel, Markus E.
|
|
2006
|
359 |
1-3 |
p. 329-343
15 p.
|
artikel
|
| 19 |
Improved bounds and schemes for the declustering problem
|
Doerr, Benjamin
|
|
2006
|
359 |
1-3 |
p. 123-132
10 p.
|
artikel
|
| 20 |
k -Spine, 1-bend planarity
|
Giacomo, Emilio Di
|
|
2006
|
359 |
1-3 |
p. 148-175
28 p.
|
artikel
|
| 21 |
Lower bounds for restricted read-once parity branching programs
|
Homeister, Matthias
|
|
2006
|
359 |
1-3 |
p. 1-14
14 p.
|
artikel
|
| 22 |
Maximal pattern complexity of two-dimensional words
|
Kamae, Teturo
|
|
2006
|
359 |
1-3 |
p. 15-27
13 p.
|
artikel
|
| 23 |
Multiple points of tilings associated with Pisot numeration systems
|
Sadahiro, Taizo
|
|
2006
|
359 |
1-3 |
p. 133-147
15 p.
|
artikel
|
| 24 |
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
|
Chan, Wun-Tat
|
|
2006
|
359 |
1-3 |
p. 430-439
10 p.
|
artikel
|
| 25 |
Newton's method with deflation for isolated singularities of polynomial systems
|
Leykin, Anton
|
|
2006
|
359 |
1-3 |
p. 111-122
12 p.
|
artikel
|
| 26 |
On the edge-bandwidth of graph products
|
Balogh, József
|
|
2006
|
359 |
1-3 |
p. 43-57
15 p.
|
artikel
|
| 27 |
Petri net reactive modules
|
Ţiplea, Ferucio Laurenţiu
|
|
2006
|
359 |
1-3 |
p. 77-100
24 p.
|
artikel
|
| 28 |
Power domination in block graphs
|
Xu, Guangjun
|
|
2006
|
359 |
1-3 |
p. 299-305
7 p.
|
artikel
|
| 29 |
Rationality of the Möbius function of a composition poset
|
Björner, Anders
|
|
2006
|
359 |
1-3 |
p. 282-298
17 p.
|
artikel
|
| 30 |
Synchronizing groups and automata
|
Arnold, Fredrick
|
|
2006
|
359 |
1-3 |
p. 101-110
10 p.
|
artikel
|
| 31 |
The conference call search problem in wireless networks
|
Epstein, Leah
|
|
2006
|
359 |
1-3 |
p. 418-429
12 p.
|
artikel
|
| 32 |
Unavoidable sets
|
Higgins, Peter M.
|
|
2006
|
359 |
1-3 |
p. 231-238
8 p.
|
artikel
|
| 33 |
Vertex disjoint paths on clique-width bounded graphs
|
Gurski, Frank
|
|
2006
|
359 |
1-3 |
p. 188-199
12 p.
|
artikel
|
| 34 |
Word assembly through minimal forbidden words
|
Fici, Gabriele
|
|
2006
|
359 |
1-3 |
p. 214-230
17 p.
|
artikel
|
Tijdschrift beschrijving