nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A general technique to establish the asymptotic conditional diagnosability of interconnection networks
|
Stewart, Iain A. |
|
2012 |
452 |
C |
p. 132-147 16 p. |
artikel |
2 |
An algorithm approach to bounding aggregations of multidimensional Markov chains
|
Castel-Taleb, Hind |
|
2012 |
452 |
C |
p. 12-20 9 p. |
artikel |
3 |
An algorithmic analysis of the Honey-Bee game
|
Fleischer, Rudolf |
|
2012 |
452 |
C |
p. 75-87 13 p. |
artikel |
4 |
An O ( n m ) -time certifying algorithm for recognizing HHD-free graphs
|
Nikolopoulos, Stavros D. |
|
2012 |
452 |
C |
p. 117-131 15 p. |
artikel |
5 |
Bayesian ignorance
|
Alon, Noga |
|
2012 |
452 |
C |
p. 1-11 11 p. |
artikel |
6 |
Computing optimal contracts in combinatorial agencies
|
Emek, Yuval |
|
2012 |
452 |
C |
p. 56-74 19 p. |
artikel |
7 |
Editorial Board
|
|
|
2012 |
452 |
C |
p. iii-viii nvt p. |
artikel |
8 |
Game-theoretic analysis of Internet switching with selfish users
|
Kesselman, Alex |
|
2012 |
452 |
C |
p. 107-116 10 p. |
artikel |
9 |
On families of categorial grammars of bounded value, their learnability and related complexity questions
|
Costa Florêncio, Christophe |
|
2012 |
452 |
C |
p. 21-38 18 p. |
artikel |
10 |
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
|
Damaschke, Peter |
|
2012 |
452 |
C |
p. 39-46 8 p. |
artikel |
11 |
Process and truth-table characterisations of randomness
|
Day, Adam R. |
|
2012 |
452 |
C |
p. 47-55 9 p. |
artikel |
12 |
The checkpoint problem
|
Hajiaghayi, MohammadTaghi |
|
2012 |
452 |
C |
p. 88-99 12 p. |
artikel |
13 |
The index of a binary word
|
Ilić, Aleksandar |
|
2012 |
452 |
C |
p. 100-106 7 p. |
artikel |