Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 16 matches
- 2010
- Karen I. Aardal, Friedrich Eisenbrand:
The LLL Algorithm and Integer Programming. The LLL Algorithm 2010: 293-314 - Craig Gentry:
The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance. The LLL Algorithm 2010: 391-426 - Guillaume Hanrot:
LLL: A Tool for Effective Diophantine Approximation. The LLL Algorithm 2010: 215-263 - Jeffrey Hoffstein, Nick Howgrave-Graham, Jill Pipher, William Whyte:
Practical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign. The LLL Algorithm 2010: 349-390 - Subhash Khot:
Inapproximability Results for Computational Problems on Lattices. The LLL Algorithm 2010: 453-473 - Jürgen Klüners:
The van Hoeij Algorithm for Factoring Polynomials. The LLL Algorithm 2010: 283-291 - Alexander May:
Using LLL-Reduction for Solving RSA and Factorization Problems. The LLL Algorithm 2010: 315-348 - Daniele Micciancio:
Cryptographic Functions from Worst-Case Complexity Assumptions. The LLL Algorithm 2010: 427-452 - Phong Q. Nguyen:
Hermite's Constant and Lattice Algorithms. The LLL Algorithm 2010: 19-69 - Oded Regev:
On the Complexity of Lattice Problems with Polynomial Approximation Factors. The LLL Algorithm 2010: 475-496 - Claus-Peter Schnorr:
Progress on LLL and Lattice Reduction. The LLL Algorithm 2010: 145-178 - Denis Simon:
Selected Applications of LLL in Number Theory. The LLL Algorithm 2010: 265-282 - Ionica Smeets, Arjen K. Lenstra, Hendrik Lenstra, László Lovász, Peter van Emde Boas:
The History of the LLL-Algorithm. The LLL Algorithm 2010: 1-17 - Damien Stehlé:
Floating-Point LLL: Theoretical and Practical Aspects. The LLL Algorithm 2010: 179-213 - Brigitte Vallée, Antonio Vera:
Probabilistic Analyses of Lattice Reduction Algorithms. The LLL Algorithm 2010: 71-143 - Phong Q. Nguyen, Brigitte Vallée:
The LLL Algorithm - Survey and Applications. Information Security and Cryptography, Springer 2010, ISBN 978-3-642-02294-4 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-28 08:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint