nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms to Compute Minimum Cycle Basis in Directed Graphs
|
Kavitha, Telikepalli |
|
2007 |
40 |
4 |
p. 485-505 |
artikel |
2 |
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods
|
Poupet, Victor |
|
2007 |
40 |
4 |
p. 409-421 |
artikel |
3 |
Characterizing TC0 in Terms of Infinite Groups
|
Krebs, Andreas |
|
2007 |
40 |
4 |
p. 303-325 |
artikel |
4 |
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard
|
Malajovich, Gregorio |
|
2007 |
40 |
4 |
p. 553-570 |
artikel |
5 |
Dynamic Complexity Theory Revisited
|
Weber, Volker |
|
2007 |
40 |
4 |
p. 355-377 |
artikel |
6 |
Foreword
|
|
|
2007 |
40 |
4 |
p. 301 |
artikel |
7 |
Robust Polynomials and Quantum Algorithms
|
Buhrman, Harry |
|
2007 |
40 |
4 |
p. 379-395 |
artikel |
8 |
Roundings Respecting Hard Constraints
|
Doerr, Benjamin |
|
2007 |
40 |
4 |
p. 467-483 |
artikel |
9 |
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves
|
Franceschini, Gianni |
|
2007 |
40 |
4 |
p. 327-353 |
artikel |
10 |
The Power of Commuting with Finite Sets of Words
|
Kunc, Michal |
|
2007 |
40 |
4 |
p. 521-551 |
artikel |
11 |
The Variable Hierarchy of the μ-Calculus Is Strict
|
Berwanger, Dietmar |
|
2007 |
40 |
4 |
p. 437-466 |
artikel |
12 |
Topological Automata
|
Jeandel, Emmanuel |
|
2007 |
40 |
4 |
p. 397-407 |
artikel |
13 |
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
|
Andelman, Nir |
|
2007 |
40 |
4 |
p. 423-436 |
artikel |
14 |
Varieties of Codes and Kraft Inequality
|
Burderi, F. |
|
2007 |
40 |
4 |
p. 507-520 |
artikel |