| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An improved time-space lower bound for tautologies
|
Diehl, Scott
|
|
2009
|
22 |
3 |
p. 325-338
|
artikel
|
| 2 |
A polynomial-time perfect sampler for the Q-Ising with a vertex-independent noise
|
Yamamoto, Masaki
|
|
2010
|
22 |
3 |
p. 392-408
|
artikel
|
| 3 |
Convex partitions with 2-edge connected dual graphs
|
Al-Jubeh, Marwan
|
|
2010
|
22 |
3 |
p. 409-425
|
artikel
|
| 4 |
Honeynet games: a game theoretic approach to defending network monitors
|
Cai, Jin-Yi
|
|
2009
|
22 |
3 |
p. 305-324
|
artikel
|
| 5 |
Online tree node assignment with resource augmentation
|
Chan, Joseph Wun-Tat
|
|
2010
|
22 |
3 |
p. 359-377
|
artikel
|
| 6 |
On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries
|
Bezáková, Ivona
|
|
2010
|
22 |
3 |
p. 457-468
|
artikel
|
| 7 |
On the performances of Nash equilibria in isolation games
|
Bilò, Vittorio
|
|
2010
|
22 |
3 |
p. 378-391
|
artikel
|
| 8 |
On the readability of monotone Boolean formulae
|
Elbassioni, Khaled
|
|
2010
|
22 |
3 |
p. 293-304
|
artikel
|
| 9 |
Popular matchings: structure and algorithms
|
McDermid, Eric
|
|
2010
|
22 |
3 |
p. 339-358
|
artikel
|
| 10 |
Separating NE from some nonuniform nondeterministic complexity classes
|
Fu, Bin
|
|
2010
|
22 |
3 |
p. 482-493
|
artikel
|
| 11 |
Strongly chordal and chordal bipartite graphs are sandwich monotone
|
Heggernes, Pinar
|
|
2010
|
22 |
3 |
p. 438-456
|
artikel
|
| 12 |
Sublinear-time algorithms for tournament graphs
|
Dantchev, Stefan
|
|
2010
|
22 |
3 |
p. 469-481
|
artikel
|
| 13 |
Why locally-fair maximal flows in client-server networks perform well
|
Berman, Kenneth A.
|
|
2010
|
22 |
3 |
p. 426-437
|
artikel
|
Tijdschrift beschrijving