default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrédéric Didier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Toby O. Davies, Frédéric Didier, Laurent Perron:
ViolationLS: Constraint-Based Local Search in CP-SAT. CPAIOR (1) 2024: 243-258- 2023
- [c9]Laurent Perron, Frédéric Didier, Steven Gay:
The CP-SAT-LP Solver (Invited Talk). CP 2023: 3:1-3:2
2010 – 2019
- 2015
- [c8]Carlos Ansótegui, Frédéric Didier, Joel Gabàs:
Exploiting the Structure of Unsatisfiable Cores in MaxSAT. IJCAI 2015: 283-289 - 2012
- [j2]Mahdi Cheraghchi
, Frédéric Didier, Amin Shokrollahi:
Invertible Extractors and Wiretap Protocols. IEEE Trans. Inf. Theory 58(2): 1254-1274 (2012) - 2011
- [j1]Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf:
Approximation of event probabilities in noisy cellular processes. Theor. Comput. Sci. 412(21): 2128-2141 (2011) - 2010
- [c7]Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf:
SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks. QEST 2010: 193-194 - [i6]Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf:
SABRE: A Tool for Stochastic Analysis of Biochemical Reaction Networks. CoRR abs/1005.2819 (2010)
2000 – 2009
- 2009
- [c6]Frédéric Didier, Thomas A. Henzinger, Maria Mateescu, Verena Wolf:
Approximation of Event Probabilities in Noisy Cellular Processes. CMSB 2009: 173-188 - [c5]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible extractors and wiretap protocols. ISIT 2009: 1934-1938 - [i5]Frédéric Didier:
Efficient erasure decoding of Reed-Solomon codes. CoRR abs/0901.1886 (2009) - [i4]Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible Extractors and Wiretap Protocols. CoRR abs/0901.2120 (2009) - [i3]Frédéric Didier, Yann Laigle-Chapuy:
Attacking the combination generator. CoRR abs/0907.0971 (2009) - 2007
- [b1]Frédéric Didier:
Codes de Reed-Muller et cryptanalyse du registre filtré. École Polytechnique, Palaiseau, France, 2007 - [c4]Frédéric Didier:
Attacking the Filter Generator by Finding Zero Inputs of the Filtering Function. INDOCRYPT 2007: 404-413 - [c3]Frédéric Didier, Yann Laigle-Chapuy:
Finding low-weight polynomial multiples using discrete logarithm. ISIT 2007: 1036-1040 - [i2]Frédéric Didier, Yann Laigle-Chapuy:
Finding low-weight polynomial multiples using discrete logarithm. CoRR abs/cs/0701069 (2007) - 2006
- [c2]Frédéric Didier, Jean-Pierre Tillich:
Computing the Algebraic Immunity Efficiently. FSE 2006: 359-374 - [c1]Frédéric Didier:
Using Wiedemann's Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks. INDOCRYPT 2006: 236-250 - [i1]Frédéric Didier:
Using Wiedemann's algorithm to compute the immunity against algebraic and fast algebraic attacks. IACR Cryptol. ePrint Arch. 2006: 261 (2006)
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-06-05 20:41 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:
