![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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 31 matches
- 2008
- Juliana Belding, Reinier Bröker, Andreas Enge, Kristin E. Lauter:
Computing Hilbert Class Polynomials. ANTS 2008: 282-295 - Richard P. Brent
, Pierrick Gaudry, Emmanuel Thomé, Paul Zimmermann:
Faster Multiplication in GF(2)[x]. ANTS 2008: 153-166 - Wouter Castryck
, Hendrik Hubrechts, Frederik Vercauteren
:
Computing Zeta Functions in Families of Ca, b. ANTS 2008: 296-311 - J. E. Cremona
:
Computing in Component Groups of Elliptic Curves. ANTS 2008: 118-124 - Ernie Croot, Andrew Granville
, Robin Pemantle, Prasad Tetali:
Running Time Predictions for Factoring Algorithms. ANTS 2008: 1-36 - Lassina Dembélé
, Steve Donnelly:
Computing Hilbert Modular Forms over Fields with Nontrivial Class Group. ANTS 2008: 371-386 - Willemien Ekkelkamp:
Predicting the Sieving Effort for the Number Field Sieve. ANTS 2008: 167-179 - Noam D. Elkies:
Shimura Curve Computations Via K3 Surfaces of Néron-Severi Rank at Least 19. ANTS 2008: 196-211 - Andreas-Stephan Elsenhans, Jörg Jahnel:
K3 Surfaces of Picard Rank One and Degree Two. ANTS 2008: 212-225 - Tom Fisher:
Some Improvements to 4-Descent on an Elliptic Curve. ANTS 2008: 125-138 - David Freeman, Peter Stevenhagen, Marco Streng
:
Abelian Varieties with Prescribed Embedding Degree. ANTS 2008: 60-73 - Steven D. Galbraith
, Michael Harrison, David J. Mireles Morales:
Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors. ANTS 2008: 342-356 - Edray Goins, Florian Luca, Alain Togbé:
On the Diophantine Equation x2+2alpha5beta13gamma=yn. ANTS 2008: 430-442 - Paul E. Gunnells
, Dan Yasaki
:
Hecke Operators and Hilbert Modular Forms. ANTS 2008: 387-401 - John W. Jones, David P. Roberts:
Number Fields Ramified at One Prime. ANTS 2008: 226-239 - Koray Karabina, Edlyn Teske:
On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6. ANTS 2008: 102-117 - Kiran S. Kedlaya
, Andrew V. Sutherland
:
Computing L-Series of Hyperelliptic Curves. ANTS 2008: 312-326 - Jeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali:
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm. ANTS 2008: 402-415 - Remke Kloosterman
:
Point Counting on Singular Hypersurfaces. ANTS 2008: 327-341 - Alar Leibak:
An Explicit Construction of Initial Perfect Quadratic Forms over Some Families of Totally Real Number Fields. ANTS 2008: 240-252 - Peter L. Montgomery, Alexander Kruppa:
Improved Stage 2 to P±1 Factoring Algorithms. ANTS 2008: 180-195 - Sami Omar
:
Non-vanishing of Dirichlet L-functions at the Central Point. ANTS 2008: 443-453 - Pieter Rozenhart, Renate Scheidler
:
Tabulation of Cubic Function Fields with Imaginary and Unusual Hessian. ANTS 2008: 357-370 - Jonathan W. Sands, Brett A. Tangedal:
Functorial Properties of Stark Units in Multiquadratic Extensions. ANTS 2008: 253-267 - Reginald E. Sawilla, Alan K. Silvester, Hugh C. Williams:
A New Look at an Old Equation. ANTS 2008: 37-59 - Andrew Shallue:
An Improved Multi-set Algorithm for the Dense Subset Sum Problem. ANTS 2008: 416-429 - Katsuyuki Takashima:
Efficiently Computable Distortion Maps for Supersingular Curves. ANTS 2008: 88-101 - Thotsaphon Thongjunthug
:
Computing a Lower Bound for the Canonical Height on Elliptic Curves over Totally Real Number Fields. ANTS 2008: 139-152 - Jorge Jiménez Urroz
:
Almost Prime Orders of CM Elliptic Curves Modulo p. ANTS 2008: 74-87 - John Voight
:
Enumeration of Totally Real Number Fields of Bounded Root Discriminant. ANTS 2008: 268-281
skipping 1 more match
loading more results
failed to load more results, please try again later
![](https://dblp.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.
retrieved on 2024-08-20 13:12 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