Robust Inference of Relevant Attributes. - Jan Arpe; Rüdiger Reischuk (ALT, 2003)

One-Way Communication Complexity of Symmetric Boolean Functions - Jan Arpe; Andreas Jakoby; Maciej Liskiewicz (Electron. Colloquium Comput. Complex., 2003)

Learning Juntas in the Presence of Noise - Jan Arpe (Electron. Colloquium Comput. Complex., 2005)

On the Complexity of Optimal Grammar-Based Compression. - Jan Arpe; Rüdiger Reischuk (DCC, 2006)

Approximability of Minimum AND-Circuits. - Jan Arpe; Bodo Manthey (Electron. Colloquium Comput. Complex., 2006)

When Does Greedy Learning of Relevant Features Succeed? — A Fourier-based Characterization —. - Jan Arpe; Rüdiger Reischuk (Electron. Colloquium Comput. Complex., 2006)

Learning concepts with few unknown relevant attributes from noisy data. - Jan Arpe (2006)

When Does Greedy Learning of Relevant Attributes Succeed? - Jan Arpe; Rüdiger Reischuk (COCOON, 2007)

Learning juntas in the presence of noise. - Jan Arpe; Rüdiger Reischuk (Theor. Comput. Sci., 2007)

Multiple Random Oracles Are Better Than One - Jan Arpe; Elchanan Mossel (CoRR, 2008)

Agnostically Learning Juntas from Random Walks - Jan Arpe; Elchanan Mossel (CoRR, 2008)

Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. - Jan Arpe; Elchanan Mossel (Comb. Probab. Comput., 2010)