| 2009 |
|---|
| 15 | EE | Jan Arpe,
Bodo Manthey:
Approximability of Minimum AND-Circuits.
Algorithmica 53(3): 337-357 (2009) |
| 2008 |
|---|
| 14 | EE | Jan Arpe,
Elchanan Mossel:
Multiple Random Oracles Are Better Than One
CoRR abs/0804.3817: (2008) |
| 13 | EE | Jan Arpe,
Elchanan Mossel:
Agnostically Learning Juntas from Random Walks
CoRR abs/0806.4210: (2008) |
| 2007 |
|---|
| 12 | EE | Jan Arpe,
Rüdiger Reischuk:
When Does Greedy Learning of Relevant Attributes Succeed?
COCOON 2007: 296-306 |
| 11 | EE | Jan Arpe,
Rüdiger Reischuk:
Learning juntas in the presence of noise.
Theor. Comput. Sci. 384(1): 2-21 (2007) |
| 2006 |
|---|
| 10 | EE | Jan Arpe,
Bodo Manthey:
Approximability of Minimum AND-Circuits.
Complexity of Boolean Functions 2006 |
| 9 | EE | Jan Arpe,
Rüdiger Reischuk:
On the Complexity of Optimal Grammar-Based Compression.
DCC 2006: 173-182 |
| 8 | EE | Jan Arpe,
Bodo Manthey:
Approximability of Minimum AND-Circuits.
SWAT 2006: 292-303 |
| 7 | EE | Jan Arpe,
Rüdiger Reischuk:
Learning Juntas in the Presence of Noise.
TAMC 2006: 387-398 |
| 6 | EE | Jan Arpe,
Bodo Manthey:
Approximability of Minimum AND-Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 13(045): (2006) |
| 5 | EE | Jan Arpe,
Rüdiger Reischuk:
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---.
Electronic Colloquium on Computational Complexity (ECCC) 13(065): (2006) |
| 2005 |
|---|
| 4 | EE | Jan Arpe:
Learning Juntas in the Presence of Noise
Electronic Colloquium on Computational Complexity (ECCC)(088): (2005) |
| 2003 |
|---|
| 3 | EE | Jan Arpe,
Rüdiger Reischuk:
Robust Inference of Relevant Attributes.
ALT 2003: 99-113 |
| 2 | EE | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions.
FCT 2003: 158-170 |
| 1 | EE | Jan Arpe,
Andreas Jakoby,
Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions
Electronic Colloquium on Computational Complexity (ECCC)(083): (2003) |
