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=2369

• Gauss composition and generalizations
  Manjul Bhargava
  Lecture Notes in Computer Science 2369, 2002, pp. 1-8
• Elliptic curves - The crossroads of theory and computation
  John Coates
  Lecture Notes in Computer Science 2369, 2002, pp. 9-19
• The Weil and Tate pairings as building blocks for public key cryptosystems
  Antoine Joux
  Lecture Notes in Computer Science 2369, 2002, pp. 20-32
• Using elliptic curves of rank one towards the undecidability of Hilbert's Tenth Problem over rings of algebraic integers
  Bjorn Poonen
  Lecture Notes in Computer Science 2369, 2002, pp. 33-42
• On p-adic point counting algorithms for elliptic curves over finite fields
  Takakazu Satoh
  Lecture Notes in Computer Science 2369, 2002, pp. 43-66
• On arithmetically equivalent number fields of small degree
  Wieb Bosma, Bart de Smit
  Lecture Notes in Computer Science 2369, 2002, pp. 67-79
• A survey of discriminant counting
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 2369, 2002, pp. 80-94
• A higher-rank Mersenne problem
  Graham Everest, Peter Rogers, Thomas Ward
  Lecture Notes in Computer Science 2369, 2002, pp. 95-107
• 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
• Computational aspects of NUCOMP
  Michael J., Jr. Jacobson, Alfred J. van der Poorten
  Lecture Notes in Computer Science 2369, 2002, pp. 120-133
• Efficient computation of class numbers of real Abelian number fields
  Stéphane R. Louboutin
  Lecture Notes in Computer Science 2369, 2002, pp. 134-147
• An accelerated Buchmann algorithm for regulator computation in real quadratic fields
  Ulrich Vollmer
  Lecture Notes in Computer Science 2369, 2002, pp. 148-162
• Some genus 3 curves with many points
  Roland Auer, Jaap Top
  Lecture Notes in Computer Science 2369, 2002, pp. 163-171
• 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
• 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
• Integral points on punctured Abelian surfaces
  Andrew Kresch, Yuri Tschinkel
  Lecture Notes in Computer Science 2369, 2002, pp. 198-204
• Genus 2 curves with (3, 3)-split Jacobian and large automorphism group
  Tony Shaska
  Lecture Notes in Computer Science 2369, 2002, pp. 205-218
• Transportable modular symbols and the intersection pairing
  Helena A. Verrill
  Lecture Notes in Computer Science 2369, 2002, pp. 219-233
• Action of modular correspondences around CM points
  Jean-Marc Couveignes, Thierry Henocq
  Lecture Notes in Computer Science 2369, 2002, pp. 234-243
• 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 database of elliptic curves - First report
  William A. Stein, Mark Watkins
  Lecture Notes in Computer Science 2369, 2002, pp. 267-275
• Isogeny volcanoes and the SEA algorithm
  Mireille Fouquet, François Morain
  Lecture Notes in Computer Science 2369, 2002, pp. 276-291
• 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
• 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