Jan Arpe

	2010
18		Jan Arpe, Elchanan Mossel: Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. Combinatorics, Probability & Computing 19(2): 183-199 (2010)
	2009
17		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Algorithmica 53(3): 337-357 (2009)
	2008
16		Jan Arpe, Elchanan Mossel: Multiple Random Oracles Are Better Than One CoRR abs/0804.3817: (2008)
15		Jan Arpe, Elchanan Mossel: Agnostically Learning Juntas from Random Walks CoRR abs/0806.4210: (2008)
	2007
14		Jan Arpe, Rüdiger Reischuk: When Does Greedy Learning of Relevant Attributes Succeed? COCOON 2007: 296-306
13		Jan Arpe, Rüdiger Reischuk: Learning juntas in the presence of noise. Theor. Comput. Sci. 384(1): 2-21 (2007)
	2006
12		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Complexity of Boolean Functions 2006
11		Jan Arpe, Rüdiger Reischuk: On the Complexity of Optimal Grammar-Based Compression. DCC 2006: 173-182
10		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. SWAT 2006: 292-303
9		Jan Arpe, Rüdiger Reischuk: Learning Juntas in the Presence of Noise. TAMC 2006: 387-398
8		Jan Arpe, Bodo Manthey: Approximability of Minimum AND-Circuits. Electronic Colloquium on Computational Complexity (ECCC) 13(045): (2006)
7		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)
6		Jan Arpe: Learning concepts with few unknown relevant attributes from noisy data. University of Lübeck 2006
	2005
5		Jan Arpe: Learning Juntas in the Presence of Noise Electronic Colloquium on Computational Complexity (ECCC)(088): (2005)
4		Jan Arpe, Andreas Jakoby, Maciej Liskiewicz: One-way communication complexity of symmetric Boolean functions. ITA 39(4): 687-706 (2005)
	2003
3		Jan Arpe, Rüdiger Reischuk: Robust Inference of Relevant Attributes. ALT 2003: 99-113
2		Jan Arpe, Andreas Jakoby, Maciej Liskiewicz: One-Way Communication Complexity of Symmetric Boolean Functions. FCT 2003: 158-170
1		Jan Arpe, Andreas Jakoby, Maciej Liskiewicz: One-Way Communication Complexity of Symmetric Boolean Functions Electronic Colloquium on Computational Complexity (ECCC)(083): (2003)

Coauthor Index

1	Andreas Jakoby	[1] [2] [4]
2	Maciej Liskiewicz	[1] [2] [4]
3	Bodo Manthey (Bodo Siebert)	[8] [10] [12] [17]
4	Elchanan Mossel	[15] [16] [18]
5	Rüdiger Reischuk	[3] [7] [9] [11] [13] [14]

Colors in the list of coauthors

Last update Sat May 26 04:23:17 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page