nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Cluster computing and the power of edge recognition
|
Hemaspaandra, Lane A. |
|
2007 |
205 |
8 |
p. 1274-1293 20 p. |
artikel |
2 |
Complementing two-way finite automata
|
Geffert, Viliam |
|
2007 |
205 |
8 |
p. 1173-1187 15 p. |
artikel |
3 |
Controlling information release in the π -calculus
|
Crafa, Silvia |
|
2007 |
205 |
8 |
p. 1235-1273 39 p. |
artikel |
4 |
Editorial Board (continued)
|
|
|
2007 |
205 |
8 |
p. i- 1 p. |
artikel |
5 |
Generalizing DPLL and satisfiability for equalities
|
Badban, Bahareh |
|
2007 |
205 |
8 |
p. 1188-1211 24 p. |
artikel |
6 |
Hardness of fully dense problems
|
Ailon, Nir |
|
2007 |
205 |
8 |
p. 1117-1129 13 p. |
artikel |
7 |
Inside Front Cover: Editorial Board
|
|
|
2007 |
205 |
8 |
p. IFC- 1 p. |
artikel |
8 |
Inverse monoids: Decidability and complexity of algebraic questions
|
Lohrey, Markus |
|
2007 |
205 |
8 |
p. 1212-1234 23 p. |
artikel |
9 |
Task automata: Schedulability, decidability and undecidability
|
Fersman, Elena |
|
2007 |
205 |
8 |
p. 1149-1172 24 p. |
artikel |
10 |
When not losing is better than winning: Abstraction and refinement for the full μ-calculus
|
Grumberg, Orna |
|
2007 |
205 |
8 |
p. 1130-1148 19 p. |
artikel |