| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A calculus for collective-adaptive systems and its behavioural theory
|
Abd Alrahman, Yehia
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 2 |
Characterising tree-like Frege proofs for QBF
|
Beyersdorff, Olaf
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 3 |
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras
|
Bulatov, Andrei A.
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 4 |
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
|
Huang, Mingzhang
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 5 |
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence
|
Fokkink, Wan
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 6 |
Editorial Board
|
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 7 |
Introducing article numbering to Information and Computation
|
Amato, Mike
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 8 |
Logical characterization of branching metrics for nondeterministic probabilistic transition systems
|
Castiglioni, Valentina
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 9 |
On the relative expressiveness of higher-order session processes
|
Kouzapas, Dimitrios
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 10 |
On t-revealing codes in binary Hamming spaces
|
Laihonen, Tero
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 11 |
Optimal bounds for computing α-gapped repeats
|
Crochemore, Maxime
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 12 |
Optimal prefix codes with fewer distinct codeword lengths are faster to construct
|
Belal, Ahmed
|
|
2019
|
268 |
C |
p.
|
artikel
|
| 13 |
Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
|
Dachman-Soled, Dana
|
|
2019
|
268 |
C |
p.
|
artikel
|
Tijdschrift beschrijving