default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThibaut Horel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Alessandro Bonatti
, Munther A. Dahleh, Thibaut Horel, Amir Nouripour:
Selling information in competitive environments. J. Econ. Theory 216: 105779 (2024)- [i15]Munther A. Dahleh, Thibaut Horel, M. Umar B. Niazi:
Mitigating Information Asymmetry in Two-Stage Contracts with Non-Myopic Agents. CoRR abs/2406.12648 (2024) - 2023
- [c13]Alessandro Bonatti, Munther A. Dahleh, Thibaut Horel, Mardavij Roozbehani:
Information Asymmetry and Contract Design with Applications to Agriculture. CDC 2023: 3257-3261 - [c12]Maryann Rui, Thibaut Horel, Munther A. Dahleh:
Estimation of Models with Limited Data by Leveraging Shared Structure. CDC 2023: 6616-6621 - [i14]Alessandro Bonatti, Munther A. Dahleh, Thibaut Horel, Amir Nouripour:
Coordination via Selling Information. CoRR abs/2302.12223 (2023) - [i13]Maryann Rui, Thibaut Horel, Munther A. Dahleh:
Estimation of Models with Limited Data by Leveraging Shared Structure. CoRR abs/2310.02864 (2023) - 2022
- [j2]Julien Fageot, Alireza Fallah, Thibaut Horel:
Entropic Compressibility of Lévy Processes. IEEE Trans. Inf. Theory 68(8): 4949-4963 (2022) - [i12]Alessandro Bonatti, Munther A. Dahleh, Thibaut Horel, Amir Nouripour:
Selling Information in Competitive Environments. CoRR abs/2202.08780 (2022) - 2021
- [j1]Rohit Agrawal, Thibaut Horel:
Optimal Bounds between f-Divergences and Integral Probability Metrics. J. Mach. Learn. Res. 22: 128:1-128:59 (2021) - [c11]Thibaut Horel, Lorenzo Masoero, Raj Agrawal, Daria Roithmayr, Trevor Campbell:
The CPD Data Set: Personnel, Use of Force, and Complaints in the Chicago Police Department. NeurIPS Datasets and Benchmarks 2021 - 2020
- [c10]Rohit Agrawal, Thibaut Horel:
Optimal Bounds between f-Divergences and Integral Probability Metrics. ICML 2020: 115-124 - [c9]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
Data structures meet cryptography: 3SUM with preprocessing. STOC 2020: 294-307 - [i11]Anish Agarwal, Munther A. Dahleh, Thibaut Horel, Maryann Rui:
Towards Data Auctions with Externalities. CoRR abs/2003.08345 (2020) - [i10]Rohit Agrawal, Thibaut Horel:
Optimal Bounds between $f$-Divergences and Integral Probability Metrics. CoRR abs/2006.05973 (2020) - [i9]Julien Fageot, Alireza Fallah, Thibaut Horel:
Entropic Compressibility of Lévy Processes. CoRR abs/2009.10753 (2020)
2010 – 2019
- 2019
- [c8]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying Computational Entropies via Kullback-Leibler Divergence. CRYPTO (2) 2019: 831-858 - [c7]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. ITCS 2019: 42:1-42:20 - [i8]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying computational entropies via Kullback-Leibler divergence. CoRR abs/1902.11202 (2019) - [i7]Alexander Golovnev, Siyao Guo, Thibaut Horel, Sunoo Park, Vinod Vaikuntanathan:
3SUM with Preprocessing: Algorithms, Lower Bounds and Cryptographic Applications. CoRR abs/1907.08355 (2019) - [i6]Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel, Salil P. Vadhan:
Unifying computational entropies via Kullback-Leibler divergence. IACR Cryptol. ePrint Arch. 2019: 264 (2019) - 2018
- [i5]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. CoRR abs/1802.07381 (2018) - [i4]Thibaut Horel, Sunoo Park, Silas Richelson, Vinod Vaikuntanathan:
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. IACR Cryptol. ePrint Arch. 2018: 212 (2018) - 2016
- [c6]Thibaut Horel, Yaron Singer:
Maximization of Approximately Submodular Functions. NIPS 2016: 3045-3053 - 2015
- [c5]Jean Pouget-Abadie, Thibaut Horel:
Inferring Graphs from Cascades: A Sparse Recovery Framework. ICML 2015: 977-986 - [c4]Thibaut Horel, Yaron Singer:
Scalable Methods for Adaptively Seeding a Social Network. WWW 2015: 441-451 - [c3]Thibaut Horel, Yaron Singer:
Scalable Methods for Adaptively Seeding a Social Network. WWW (Companion Volume) 2015: 623-624 - [c2]Jean Pouget-Abadie, Thibaut Horel:
Inferring Graphs from Cascades: A Sparse Recovery Framework. WWW (Companion Volume) 2015: 625-626 - [i3]Thibaut Horel, Yaron Singer:
Scalable Methods for Adaptively Seeding a Social Network. CoRR abs/1503.01438 (2015) - [i2]Jean Pouget-Abadie, Thibaut Horel:
Inferring Graphs from Cascades: A Sparse Recovery Framework. CoRR abs/1505.05663 (2015) - 2014
- [c1]Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan:
Budget Feasible Mechanisms for Experimental Design. LATIN 2014: 719-730 - 2013
- [i1]Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan:
Budget Feasible Mechanisms for Experimental Design. CoRR abs/1302.5724 (2013)
Coauthor Index
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-09-13 00:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
