![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Benoit Monin
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Benoit Monin, Ludovic Patey
:
Partition Genericity and Pigeonhole Basis theorems. J. Symb. Log. 89(2): 829-857 (2024) - 2021
- [j7]Benoit Monin, Ludovic Patey:
The weakness of the pigeonhole principle under hyperarithmetical reductions. J. Math. Log. 21(3): 2150013:1-2150013:41 (2021) - [j6]Benoit Monin, André Nies:
Muchnik Degrees and cardinal characteristics. J. Symb. Log. 86(2): 471-498 (2021)
2010 – 2019
- 2019
- [j5]Benoit Monin, Ludovic Patey
:
Π1-Encodability and Omniscient Reductions. Notre Dame J. Formal Log. 60(1): 1-12 (2019) - 2018
- [j4]Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen:
Algorithmic identification of probabilities is hard. J. Comput. Syst. Sci. 95: 98-108 (2018) - [j3]Noam Greenberg, Joseph S. Miller
, Benoit Monin, Daniel Turetsky:
Two More Characterizations of K-Triviality. Notre Dame J. Formal Log. 59(2): 189-195 (2018) - [c6]Benoit Monin:
An answer to the Gamma question. LICS 2018: 730-738 - 2017
- [j2]Laurent Bienvenu, Noam Greenberg, Benoit Monin:
Continuous higher randomness. J. Math. Log. 17(1): 1750004:1-1750004:53 (2017) - [j1]Benoit Monin:
Higher Randomness and Forcing with Closed Sets. Theory Comput. Syst. 60(3): 421-437 (2017) - 2015
- [c5]Benoit Monin, André Nies
:
A Unifying Approach to the Gamma Question. LICS 2015: 585-596 - 2014
- [b1]Benoit Monin:
Higher computability and Randomness. (Aléatoire et calculabilité d'ordre supérieur). Paris Diderot University, France, 2014 - [c4]Laurent Bienvenu, Benoit Monin, Alexander Shen:
Algorithmic Identification of Probabilities Is Hard. ALT 2014: 85-95 - [c3]Benoit Monin:
Higher randomness and forcing with closed sets. STACS 2014: 566-577 - 2012
- [c2]Laurent Bienvenu, Benoit Monin:
Von Neumann's Biased Coin Revisited. LICS 2012: 145-154
2000 – 2009
- 2009
- [c1]Kathryn Y. Segovia, Jeremy N. Bailenson, Benoit Monin:
Morality in tele-immersive environments. IMMERSCOM 2009: 17
Coauthor Index
![](https://dblp1.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-07-20 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint