Volume 206; Issue 5

Information and Computation

Volume 206; Issue 5
1

The boolean hierarchy of NP-partitions

Year:
2008
Language:
english
File:
PDF, 448 KB
english, 2008
3

On finite alphabets and infinite bases

Year:
2008
Language:
english
File:
PDF, 361 KB
english, 2008
4

When unlearning helps

Year:
2008
Language:
english
File:
PDF, 234 KB
english, 2008
5

Trees with exponentially growing costs

Year:
2008
Language:
english
File:
PDF, 143 KB
english, 2008
6

Termination of just/fair computations in term rewriting

Year:
2008
Language:
english
File:
PDF, 384 KB
english, 2008
7

Preemptive scheduling on a small number of hierarchical machines

Year:
2008
Language:
english
File:
PDF, 452 KB
english, 2008
8

Special issue: CONCUR 2006

Year:
2008
Language:
english
File:
PDF, 48 KB
english, 2008
9

Deciding expressive description logics in the framework of resolution

Year:
2008
Language:
english
File:
PDF, 294 KB
english, 2008
10

Graph connectivity, partial words, and a theorem of Fine and Wilf

Year:
2008
Language:
english
File:
PDF, 348 KB
english, 2008
11

Generalizing the Paige–Tarjan algorithm by abstract interpretation

Year:
2008
Language:
english
File:
PDF, 876 KB
english, 2008
12

Inside Front Cover: Editorial Board

Year:
2008
Language:
english
File:
PDF, 1.42 MB
english, 2008
13

Editorial Board (continued)

Year:
2008
Language:
english
File:
PDF, 1.42 MB
english, 2008