default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnja Becker 0001
Person information
- affiliation: EPFL, Lausanne, Switzerland
- affiliation: University of Versailles, PRiSM Lab, France
Other persons with the same name
- Anja Becker 0002 — Humboldt-Universität zu Berlin, Institute of Psychology, Germany
- Anja Becker 0003 — Saxon Academy of Sciences and Humanities, Leipzig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i7]Anja Becker, Dusan Kostic:
Speeding up lattice sieve with Xeon Phi coprocessor. IACR Cryptol. ePrint Arch. 2017: 592 (2017)- 2016
- [c5]Anja Becker, Thijs Laarhoven
:
Efficient (Ideal) Lattice Sieving Using Cross-Polytope LSH. AFRICACRYPT 2016: 3-23 - [c4]Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven:
New directions in nearest neighbor searching with applications to lattice sieving. SODA 2016: 10-24 - 2015
- [i6]Anja Becker, Nicolas Gama, Antoine Joux:
Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. IACR Cryptol. ePrint Arch. 2015: 522 (2015) - [i5]Anja Becker, Thijs Laarhoven:
Efficient (ideal) lattice sieving using cross-polytope LSH. IACR Cryptol. ePrint Arch. 2015: 823 (2015) - [i4]Anja Becker, Léo Ducas, Nicolas Gama, Thijs Laarhoven:
New directions in nearest neighbor searching with applications to lattice sieving. IACR Cryptol. ePrint Arch. 2015: 1128 (2015) - 2014
- [j1]Anja Becker, Nicolas Gama, Antoine Joux:
A sieve algorithm based on overlattices. LMS J. Comput. Math. 17(Theory): 49-70 (2014) - 2013
- [i3]Anja Becker, Nicolas Gama, Antoine Joux:
Solving shortest and closest vector problems: The decomposition approach. IACR Cryptol. ePrint Arch. 2013: 685 (2013) - 2012
- [c3]Anja Becker, Antoine Joux, Alexander May, Alexander Meurer:
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding. EUROCRYPT 2012: 520-536 - [i2]Anja Becker, Antoine Joux, Alexander May, Alexander Meurer:
Decoding Random Binary Linear Codes in 2n/20: How 1+1=0 Improves Information Set Decoding. IACR Cryptol. ePrint Arch. 2012: 26 (2012) - 2011
- [c2]Anja Becker, Jean-Sébastien Coron, Antoine Joux:
Improved Generic Algorithms for Hard Knapsacks. EUROCRYPT 2011: 364-385 - [i1]Anja Becker, Jean-Sébastien Coron, Antoine Joux:
Improved Generic Algorithms for Hard Knapsacks. IACR Cryptol. ePrint Arch. 2011: 474 (2011)
2000 – 2009
- 2008
- [c1]Anja Becker, Alapan Arnab, Mercè Serra:
Assessing privacy criteria for drm using eu privacy legislation. Digital Rights Management Workshop 2008: 77-86
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-04-29 20:31 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:
