nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Burnside Approach to the Finite Substitution Problem
|
Kirsten, Daniel |
|
|
39 |
1 |
p. 15-50 |
artikel |
2 |
A Burnside Approach to the Finite Substitution Problem
|
Kirsten, Daniel |
|
2005 |
39 |
1 |
p. 15-50 |
artikel |
3 |
Active Context-Free Games
|
Muscholl, Anca |
|
|
39 |
1 |
p. 237-276 |
artikel |
4 |
Active Context-Free Games
|
Muscholl, Anca |
|
2005 |
39 |
1 |
p. 237-276 |
artikel |
5 |
Algebraic Results on Quantum Automata
|
Ambainis, Andris |
|
|
39 |
1 |
p. 165-188 |
artikel |
6 |
Algebraic Results on Quantum Automata
|
Ambainis, Andris |
|
2005 |
39 |
1 |
p. 165-188 |
artikel |
7 |
Approximation Algorithms for Minimizing Average Distortion
|
Dhamdhere, Kedar |
|
|
39 |
1 |
p. 93-111 |
artikel |
8 |
Approximation Algorithms for Minimizing Average Distortion
|
Dhamdhere, Kedar |
|
2005 |
39 |
1 |
p. 93-111 |
artikel |
9 |
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms
|
Bala, Sebastian |
|
|
39 |
1 |
p. 137-163 |
artikel |
10 |
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms
|
Bala, Sebastian |
|
2005 |
39 |
1 |
p. 137-163 |
artikel |
11 |
Constant Width Planar Computation Characterizes ACC0
|
Hansen, Kristoffer Arnsfelt |
|
|
39 |
1 |
p. 79-92 |
artikel |
12 |
Constant Width Planar Computation Characterizes ACC0
|
Hansen, Kristoffer Arnsfelt |
|
2005 |
39 |
1 |
p. 79-92 |
artikel |
13 |
Foreword
|
, |
|
|
39 |
1 |
p. 1 |
artikel |
14 |
Foreword
|
|
|
2006 |
39 |
1 |
p. 1 |
artikel |
15 |
Local Limit Properties for Pattern Statistics and Rational Models
|
Bertoni, Alberto |
|
|
39 |
1 |
p. 209-235 |
artikel |
16 |
Local Limit Properties for Pattern Statistics and Rational Models
|
Bertoni, Alberto |
|
2005 |
39 |
1 |
p. 209-235 |
artikel |
17 |
Matching Algorithms Are Fast in Sparse Random Graphs
|
Bast, Holger |
|
|
39 |
1 |
p. 3-14 |
artikel |
18 |
Matching Algorithms Are Fast in Sparse Random Graphs
|
Bast, Holger |
|
2005 |
39 |
1 |
p. 3-14 |
artikel |
19 |
Simpler Computation of Single-Source Shortest Paths in Linear Average Time
|
Hagerup, Torben |
|
|
39 |
1 |
p. 113-120 |
artikel |
20 |
Simpler Computation of Single-Source Shortest Paths in Linear Average Time
|
Hagerup, Torben |
|
2005 |
39 |
1 |
p. 113-120 |
artikel |
21 |
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
|
Tholey, Torsten |
|
|
39 |
1 |
p. 51-78 |
artikel |
22 |
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
|
Tholey, Torsten |
|
2005 |
39 |
1 |
p. 51-78 |
artikel |
23 |
The Expected Competitive Ratio for Weighted Completion Time Scheduling
|
Souza, Alexander |
|
|
39 |
1 |
p. 121-136 |
artikel |
24 |
The Expected Competitive Ratio for Weighted Completion Time Scheduling
|
Souza, Alexander |
|
2005 |
39 |
1 |
p. 121-136 |
artikel |
25 |
Time-Space Tradeoff in Derandomizing Probabilistic Logspace
|
Cai, Jin-Yi |
|
|
39 |
1 |
p. 189-208 |
artikel |
26 |
Time-Space Tradeoff in Derandomizing Probabilistic Logspace
|
Cai, Jin-Yi |
|
2005 |
39 |
1 |
p. 189-208 |
artikel |