Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Kohel, David R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Classification of genus 3 curves in special strata of the moduli space
Martine Girard
,
David R. Kohel
Lecture Notes in Computer Science
4076
, 2006, pp. 346-360
Efficiently computable endomorphisms for hyperelliptic curves
David R. Kohel
,
Benjamin A. Smith
Lecture Notes in Computer Science
4076
, 2006, pp. 495-509
Some genus 3 curves with many points
Roland Auer
,
Jaap Top
Lecture Notes in Computer Science
2369
, 2002, pp. 163-171
Gauss composition and generalizations
Manjul Bhargava
Lecture Notes in Computer Science
2369
, 2002, pp. 1-8
On arithmetically equivalent number fields of small degree
Wieb Bosma
,
Bart de Smit
Lecture Notes in Computer Science
2369
, 2002, pp. 67-79
Trinomials
ax^7 + bx + c
and
ax^8 + bx + c
with Galois groups of order 168 and
8\cdot168
Nils Bruin
,
Noam D. Elkies
Lecture Notes in Computer Science
2369
, 2002, pp. 172-188
Elliptic curves - The crossroads of theory and computation
John Coates
Lecture Notes in Computer Science
2369
, 2002, pp. 9-19
A survey of discriminant counting
Henri Cohen
,
Francisco Diaz y Diaz
,
Michel Olivier
Lecture Notes in Computer Science
2369
, 2002, pp. 80-94
Action of modular correspondences around CM points
Jean-Marc Couveignes
,
Thierry Henocq
Lecture Notes in Computer Science
2369
, 2002, pp. 234-243
An extension of Kedlaya's algorithm to Artin-Schreier curves in characteristic 2
Jan Denef
,
Frederik Vercauteren
Lecture Notes in Computer Science
2369
, 2002, pp. 308-323
Factoring
N = pq^2
with the elliptic curve method
Peter Ebinger
,
Edlyn Teske
Lecture Notes in Computer Science
2369
, 2002, pp. 475-490
Curves
Dy^2 = x^3-x
of odd analytic rank
Noam D. Elkies
Lecture Notes in Computer Science
2369
, 2002, pp. 244-251
Comparing invariants for class fields of imaginary quadratic fields
Andreas Enge
,
François Morain
Lecture Notes in Computer Science
2369
, 2002, pp. 252-266
A higher-rank Mersenne problem
Graham Everest
,
Peter Rogers
,
Thomas Ward
Lecture Notes in Computer Science
2369
, 2002, pp. 95-107
Isogeny volcanoes and the SEA algorithm
Mireille Fouquet
,
François Morain
Lecture Notes in Computer Science
2369
, 2002, pp. 276-291
An application of Siegel modular functions to Kronecker's limit formula
Takashi Fukuda
,
Keiichi Komatsu
Lecture Notes in Computer Science
2369
, 2002, pp. 108-119
Implementing the Tate pairing
Steven D. Galbraith
,
Keith Harrison
,
David Soldera
Lecture Notes in Computer Science
2369
, 2002, pp. 324-337
Computations on modular Jacobian surfaces
Enrique González-Jiménez
,
Josep González
,
Jordi Guàrdia
Lecture Notes in Computer Science
2369
, 2002, pp. 189-197
An algorithm for computing Weierstrass points
Florian Hess
Lecture Notes in Computer Science
2369
, 2002, pp. 357-371
Fixed points and two-cycles of the discrete logarithm
Joshua Holden
Lecture Notes in Computer Science
2369
, 2002, pp. 405-415
Random Cayley digraphs and the discrete logarithm
Jeremy Horwitz
,
Ramarathnam Venkatesan
Lecture Notes in Computer Science
2369
, 2002, pp. 416-430
Computational aspects of NUCOMP
Michael J., Jr. Jacobson
,
Alfred J. van der Poorten
Lecture Notes in Computer Science
2369
, 2002, pp. 120-133
The function field sieve is quite special
Antoine Joux
,
Reynald Lercier
Lecture Notes in Computer Science
2369
, 2002, pp. 431-445
The Weil and Tate pairings as building blocks for public key cryptosystems
Antoine Joux
Lecture Notes in Computer Science
2369
, 2002, pp. 20-32
Fast elliptic curve point counting using Gaussian normal basis
Hae Young Kim
,
Jung Youl Park
,
Jung Hee Cheon
,
Je Hong Park
,
Jae Heon Kim
,
Sang Geun Hahn
Lecture Notes in Computer Science
2369
, 2002, pp. 292-307
Seiten 1
2
>