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 40 matches
- 2002
- Roland Auer, Jaap Top:
Some Genus 3 Curves with Many Points. ANTS 2002: 163-171 - Manjul Bhargava:
Gauss Composition and Generalizations. ANTS 2002: 1-8 - Wieb Bosma, Bart de Smit:
On Arithmetically Equivalent Number Fields of Small Degree. ANTS 2002: 67-79 - Nils Bruin, Noam D. Elkies:
Trinomials ax and ax with Galois Groups of Order 168 and 8·168. ANTS 2002: 172-188 - John Coates:
Elliptic Curves - The Crossroads of Theory and Computation. ANTS 2002: 9-19 - Henri Cohen, Francisco Diaz y Diaz, Michel Olivier:
A Survey of Discriminant Counting. ANTS 2002: 80-94 - Jean Marc Couveignes, Thierry Henocq:
Action of Modular Correspondences around CM Points. ANTS 2002: 234-243 - Jan Denef, Frederik Vercauteren:
An Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2. ANTS 2002: 308-323 - Peter Ebinger, Edlyn Teske:
Factoring N = pq with the Elliptic Curve Method. ANTS 2002: 475-490 - Noam D. Elkies:
Curves Dy=x-x of Odd Analytic Rank. ANTS 2002: 244-251 - Andreas Enge, François Morain:
Comparing Invariants for Class Fields of Imaginary Quadratic Fields. ANTS 2002: 252-266 - Graham Everest, Peter Rogers, Thomas Ward:
A Higher-Rank Mersenne Problem. ANTS 2002: 95-107 - Mireille Fouquet, François Morain:
Isogeny Volcanoes and the SEA Algorithm. ANTS 2002: 276-291 - Takashi Fukuda, Keiichi Komatsu:
An Application of Siegel Modular Functions to Kronecker's Limit Formula. ANTS 2002: 108-119 - Steven D. Galbraith, Keith Harrison, David Soldera:
Implementing the Tate Pairing. ANTS 2002: 324-337 - Enrique González-Jiménez, Josep González, Jordi Guàrdia:
Computations on Modular Jacobian Surfaces. ANTS 2002: 189-197 - Florian Hess:
An Algorithm for Computing Weierstrass Points. ANTS 2002: 357-371 - Joshua Holden:
Fixed Points and Two-Cycles of the Discrete Logarithm. ANTS 2002: 405-415 - Jeremy Horwitz, Ramarathnam Venkatesan:
Random Cayley Digraphs and the Discrete Logarithm. ANTS 2002: 416-430 - Michael J. Jacobson Jr., Alfred J. van der Poorten:
Computational Aspects of NUCOMP. ANTS 2002: 120-133 - Antoine Joux:
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems. ANTS 2002: 20-32 - Antoine Joux, Reynald Lercier:
The Function Field Sieve Is Quite Special. ANTS 2002: 431-445 - Hae Young Kim, Jung Youl Park, Jung Hee Cheon, Je Hong Park, Jae Heon Kim, Sang Geun Hahn:
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis. ANTS 2002: 292-307 - Andrew Kresch, Yuri Tschinkel:
Integral Points on Punctured Abelian Surfaces. ANTS 2002: 198-204 - Paul C. Leyland, Arjen K. Lenstra, Bruce Dodson, Alec Muffett, Samuel S. Wagstaff Jr.:
MPQS with Three Large Primes. ANTS 2002: 446-460 - Wen-Ching W. Li, Hiren Maharaj, Henning Stichtenoth, Noam D. Elkies:
New Optimal Tame Towers of Function Fields over Small Finite Fields. ANTS 2002: 372-389 - Stéphane Louboutin:
Efficient Computation of Class Numbers of Real Abelian Number Fields. ANTS 2002: 134-147 - Kazuto Matsuo, Jinhui Chao, Shigeo Tsujii:
An Improved Baby Step Giant Step Algorithm for Point Counting of Hyperelliptic Curves over Finite Fields. ANTS 2002: 461-474 - Carl Pomerance, Igor E. Shparlinski:
Smooth Orders and Cryptographic Applications. ANTS 2002: 338-348 - Bjorn Poonen:
Using Elliptic Curves of Rank One towards the Undecidability of Hilbert's Tenth Problem over Rings of Algebraic Integers. ANTS 2002: 33-41
skipping 10 more matches
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-11-22 04:31 CET 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