| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Average complexity of Moore’s and Hopcroft’s algorithms
|
David, Julien
|
|
2012
|
417 |
C |
p. 50-65
16 p.
|
artikel
|
| 2 |
Counting and sampling minimum ( s , t ) -cuts in weighted planar graphs in polynomial time
|
Bezáková, Ivona
|
|
2012
|
417 |
C |
p. 2-11
10 p.
|
artikel
|
| 3 |
Counting classes and the fine structure between N C 1 and L
|
Datta, Samir
|
|
2012
|
417 |
C |
p. 36-49
14 p.
|
artikel
|
| 4 |
Editorial Board
|
|
|
2012
|
417 |
C |
p. iii-viii
nvt p.
|
artikel
|
| 5 |
Faster approximation schemes and parameterized algorithms on (odd-) H -minor-free graphs
|
Tazari, Siamak
|
|
2012
|
417 |
C |
p. 95-107
13 p.
|
artikel
|
| 6 |
Improved approximability and non-approximability results for graph diameter decreasing problems
|
Bilò, Davide
|
|
2012
|
417 |
C |
p. 12-22
11 p.
|
artikel
|
| 7 |
Improved simulation of nondeterministic Turing machines
|
Kalyanasundaram, Subrahmanyam
|
|
2012
|
417 |
C |
p. 66-73
8 p.
|
artikel
|
| 8 |
Preface
|
Hliněný, Petr
|
|
2012
|
417 |
C |
p. 1-
1 p.
|
artikel
|
| 9 |
Strong normalization of ML F via a calculus of coercions
|
Manzonetto, Giulio
|
|
2012
|
417 |
C |
p. 74-94
21 p.
|
artikel
|
| 10 |
Toward a deterministic polynomial time algorithm with optimal additive query complexity
|
Bshouty, Nader H.
|
|
2012
|
417 |
C |
p. 23-35
13 p.
|
artikel
|
Tijdschrift beschrijving