Search the dblp DataBase

Publications of Author

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