|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
8 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A Faster Algorithm for Finding Minimum Tucker Submatrices |
Blin, Guillaume |
2012 |
51 | 3 |
p. 270-281 |
article |
|
| 2 | Approximate Self-Assembly of the Sierpinski Triangle |
Lutz, Jack H. |
2011 |
51 | 3 |
p. 372-400 |
article |
|
| 3 | Avoiding Simplicity is Complex |
Allender, Eric |
2011 |
51 | 3 |
p. 282-296 |
article |
|
| 4 | Computability of Countable Subshifts in One Dimension |
Cenzer, Douglas |
2011 |
51 | 3 |
p. 352-371 |
article |
|
| 5 | How Powerful Are Integer-Valued Martingales? |
Bienvenu, Laurent |
2011 |
51 | 3 |
p. 330-351 |
article |
|
| 6 | Programs, Proofs, Processes |
Ferreira, Fernando |
2012 |
51 | 3 |
p. 267-269 |
article |
|
| 7 | Proofs, Programs, Processes |
Berger, Ulrich |
2011 |
51 | 3 |
p. 313-329 |
article |
|
| 8 | The Complexity of Explicit Constructions |
Santhanam, Rahul |
2011 |
51 | 3 |
p. 297-312 |
article |
8 results found