![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jan Arpe
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j4]Jan Arpe, Elchanan Mossel
:
Application of a Generalization of Russo's Formula to Learning from Multiple Random Oracles. Comb. Probab. Comput. 19(2): 183-199 (2010)
2000 – 2009
- 2009
- [j3]Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Algorithmica 53(3): 337-357 (2009) - 2008
- [i7]Jan Arpe, Elchanan Mossel:
Multiple Random Oracles Are Better Than One. CoRR abs/0804.3817 (2008) - [i6]Jan Arpe, Elchanan Mossel:
Agnostically Learning Juntas from Random Walks. CoRR abs/0806.4210 (2008) - 2007
- [j2]Jan Arpe, Rüdiger Reischuk:
Learning juntas in the presence of noise. Theor. Comput. Sci. 384(1): 2-21 (2007) - [c6]Jan Arpe, Rüdiger Reischuk:
When Does Greedy Learning of Relevant Attributes Succeed? COCOON 2007: 296-306 - 2006
- [b1]Jan Arpe:
Learning concepts with few unknown relevant attributes from noisy data. University of Lübeck, 2006 - [c5]Jan Arpe, Rüdiger Reischuk:
On the Complexity of Optimal Grammar-Based Compression. DCC 2006: 173-182 - [c4]Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. SWAT 2006: 292-303 - [c3]Jan Arpe, Rüdiger Reischuk:
Learning Juntas in the Presence of Noise. TAMC 2006: 387-398 - [i5]Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Complexity of Boolean Functions 2006 - [i4]Jan Arpe, Bodo Manthey:
Approximability of Minimum AND-Circuits. Electron. Colloquium Comput. Complex. TR06 (2006) - [i3]Jan Arpe, Rüdiger Reischuk:
When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j1]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-way communication complexity of symmetric Boolean functions. RAIRO Theor. Informatics Appl. 39(4): 687-706 (2005) - [i2]Jan Arpe:
Learning Juntas in the Presence of Noise. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [c2]Jan Arpe, Rüdiger Reischuk:
Robust Inference of Relevant Attributes. ALT 2003: 99-113 - [c1]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. FCT 2003: 158-170 - [i1]Jan Arpe, Andreas Jakoby, Maciej Liskiewicz:
One-Way Communication Complexity of Symmetric Boolean Functions. Electron. Colloquium Comput. Complex. TR03 (2003)
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint