| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of free pairs of upper triangular free monoid morphisms
|
Honkala, Juha
|
|
2019
|
267 |
C |
p. 110-115
|
artikel
|
| 2 |
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
|
Boros, Endre
|
|
2019
|
267 |
C |
p. 74-95
|
artikel
|
| 3 |
Completeness and expressiveness of pointer program verification by separation logic
|
Tatsuta, Makoto
|
|
2019
|
267 |
C |
p. 1-27
|
artikel
|
| 4 |
Complexity of the dynamics of reaction systems
|
Dennunzio, Alberto
|
|
2019
|
267 |
C |
p. 96-109
|
artikel
|
| 5 |
Corrigendum to “Iterated stack automata and complexity classes” [Inf. Comput. 95 (1) (1991) 21–75]
|
Engelfriet, Joost
|
|
2019
|
267 |
C |
p. 164-167
|
artikel
|
| 6 |
Editorial Board
|
|
|
2019
|
267 |
C |
p. ii
|
artikel
|
| 7 |
Expressiveness of probabilistic modal logics: A gradual approach
|
Clerc, Florence
|
|
2019
|
267 |
C |
p. 145-163
|
artikel
|
| 8 |
Faster FPTASes for counting and random generation of Knapsack solutions
|
Rizzi, Romeo
|
|
2019
|
267 |
C |
p. 135-144
|
artikel
|
| 9 |
Max-flow min-cut theorems on dispersion and entropy measures for communication networks
|
Riis, Søren
|
|
2019
|
267 |
C |
p. 49-73
|
artikel
|
| 10 |
On store languages and applications
|
Ibarra, Oscar H.
|
|
2019
|
267 |
C |
p. 28-48
|
artikel
|
| 11 |
Some lower bounds in parameterized AC0
|
Chen, Yijia
|
|
2019
|
267 |
C |
p. 116-134
|
artikel
|
Tijdschrift beschrijving