nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Deciding expressive description logics in the framework of resolution
|
Hustadt, Ullrich |
|
2008 |
206 |
5 |
p. 579-601 23 p. |
artikel |
2 |
Editorial Board (continued)
|
|
|
2008 |
206 |
5 |
p. i- 1 p. |
artikel |
3 |
Generalizing the Paige–Tarjan algorithm by abstract interpretation
|
Ranzato, Francesco |
|
2008 |
206 |
5 |
p. 620-651 32 p. |
artikel |
4 |
Graph connectivity, partial words, and a theorem of Fine and Wilf
|
Blanchet-Sadri, F. |
|
2008 |
206 |
5 |
p. 676-693 18 p. |
artikel |
5 |
Inside Front Cover: Editorial Board
|
|
|
2008 |
206 |
5 |
p. IFC- 1 p. |
artikel |
6 |
On finite alphabets and infinite bases
|
Chen, Taolue |
|
2008 |
206 |
5 |
p. 492-519 28 p. |
artikel |
7 |
Preemptive scheduling on a small number of hierarchical machines
|
Dósa, György |
|
2008 |
206 |
5 |
p. 602-619 18 p. |
artikel |
8 |
Reachability in recursive Markov decision processes
|
Brázdil, Tomáš |
|
2008 |
206 |
5 |
p. 520-537 18 p. |
artikel |
9 |
Special issue: CONCUR 2006
|
Baier, Christel |
|
2008 |
206 |
5 |
p. 491- 1 p. |
artikel |
10 |
Termination of just/fair computations in term rewriting
|
Lucas, Salvador |
|
2008 |
206 |
5 |
p. 652-675 24 p. |
artikel |
11 |
The boolean hierarchy of NP-partitions
|
Kosub, Sven |
|
2008 |
206 |
5 |
p. 538-568 31 p. |
artikel |
12 |
Trees with exponentially growing costs
|
Schulz, Frank |
|
2008 |
206 |
5 |
p. 569-578 10 p. |
artikel |
13 |
When unlearning helps
|
Baliga, Ganesh |
|
2008 |
206 |
5 |
p. 694-709 16 p. |
artikel |