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
Hilfe
Suche: Series=LNCS AND Volume=5011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Running time predictions for factoring algorithms
Ernie Croot
,
Andrew Granville
,
Robin Pemantle
,
Prasad Tetali
Lecture Notes in Computer Science
5011
, 2008, pp. 1-36
A new look at an old equation
R.E. Sawilla
,
A.K. Silvester
,
H.C. Williams
Lecture Notes in Computer Science
5011
, 2008, pp. 37-59
Abelian varieties with prescribed embedding degree
David Freeman
,
Peter Stevenhagen
,
Marco Streng
Lecture Notes in Computer Science
5011
, 2008, pp. 60-73
Almost prime orders of CM elliptic curves modulo
p
Jorge Jiménez Urroz
Lecture Notes in Computer Science
5011
, 2008, pp. 74-87
Efficiently computable distortion maps for supersingular curves
Katsuyuki Takashima
Lecture Notes in Computer Science
5011
, 2008, pp. 88-101
On prime-order elliptic curves with embedding degrees
k=3, 4,
and
6
Koray Karabina
,
Edlyn Teske
Lecture Notes in Computer Science
5011
, 2008, pp. 102-117
Computing in component groups of elliptic curves
J.E. Cremona
Lecture Notes in Computer Science
5011
, 2008, pp. 118-124
Some improvements to 4-descent on an elliptic curve
Tom Fisher
Lecture Notes in Computer Science
5011
, 2008, pp. 125-138
Computing a lower bound for the canonical height on elliptic curves over totally real number fields
Thotsaphon Thongjunthug
Lecture Notes in Computer Science
5011
, 2008, pp. 139-152
Faster multiplication in GF(2)
[x]
Richard P. Brent
,
Pierrick Gaudry
,
Emmanuel Thomé
,
Paul Zimmermann
Lecture Notes in Computer Science
5011
, 2008, pp. 153-166
Predicting the sieving effort for the number field sieve
Willemien Ekkelkamp
Lecture Notes in Computer Science
5011
, 2008, pp. 167-179
Improved stage 2 to P
\pm
1 factoring algorithms
Peter L. Montgomery
,
Alexander Kruppa
Lecture Notes in Computer Science
5011
, 2008, pp. 180-195
Shimura curve computations via K3 surfaces of Néron-Severi rank at least 19
Noam D. Elkies
Lecture Notes in Computer Science
5011
, 2008, pp. 196-211
K3 surfaces of Picard rank one and degree two
Andreas-Stephan Elsenhans
,
Jörg Jahnel
Lecture Notes in Computer Science
5011
, 2008, pp. 212-225
Number fields ramified at one prime
John W. Jones
,
David P. Roberts
Lecture Notes in Computer Science
5011
, 2008, pp. 226-239
An explicit construction of initial perfect quadratic forms over some families of totally real number fields
Alar Leibak
Lecture Notes in Computer Science
5011
, 2008, pp. 240-252
Functorial properties of Stark units in multiquadratic extensions
Jonathan W. Sands
,
Brett A. Tangedal
Lecture Notes in Computer Science
5011
, 2008, pp. 253-267
Enumeration of totally real number fields of bounded root discriminant
John Voight
Lecture Notes in Computer Science
5011
, 2008, pp. 268-281
Computing Hilbert class polynomials
Juliana Belding
,
Reinier Bröker
,
Andreas Enge
,
Kristin Lauter
Lecture Notes in Computer Science
5011
, 2008, pp. 282-295
Computing zeta functions in families of
C_{a,b}
curves using deformation
Wouter Castryck
,
Hendrik Hubrechts
,
Frederik Vercauteren
Lecture Notes in Computer Science
5011
, 2008, pp. 296-311
Computing
L
-series of hyperelliptic curves
Kiran S. Kedlaya
,
Andrew V. Sutherland
Lecture Notes in Computer Science
5011
, 2008, pp. 312-326
Point counting on singular hypersurfaces
Remke Kloosterman
Lecture Notes in Computer Science
5011
, 2008, pp. 327-341
Efficient hyperelliptic arithmetic using balanced representation for divisors
Steven D. Galbraith
,
Michael Harrison
,
David J. Mireles Morales
Lecture Notes in Computer Science
5011
, 2008, pp. 342-356
Tabulation of cubic function fields with imaginary and unusual Hessian
Pieter Rozenhart
,
Renate Scheidler
Lecture Notes in Computer Science
5011
, 2008, pp. 357-370
Computing Hilbert modular forms over fields with nontrivial class group
Lassina Dembélé
,
Steve Donnelly
Lecture Notes in Computer Science
5011
, 2008, pp. 371-386
Seiten 1
2
>