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: Series=LNCS AND Volume=1423

• Formal power series and their continued fraction expansion
  Alf van der Poorten
  Lecture Notes in Computer Science 1423, 1998, pp. 358-371
• Imprimitive octic fields with small discriminants
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1423, 1998, pp. 372-380
• A table of totally complex number fields of small discriminats
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1423, 1998, pp. 381-391
• Generating arithmetically equivalent number fields with elliptic curves
  Bart de Smit
  Lecture Notes in Computer Science 1423, 1998, pp. 392-399
• Computing the lead term of an Abelian L-function
  David S. Dummit, Brett A. Tangedal
  Lecture Notes in Computer Science 1423, 1998, pp. 400-411
• Timing analysis of targeted Hunter searches
  John W. Jones, David P. Roberts
  Lecture Notes in Computer Science 1423, 1998, pp. 412-423
• On successive minima of rings of algebraic integers
  Jacques Martinet
  Lecture Notes in Computer Science 1423, 1998, pp. 424-432
• Computation of relative quadratic class groups
  Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
  Lecture Notes in Computer Science 1423, 1998, pp. 433-440
• Generating class fields using Shimura reciprocity
  Alice Gee, Peter Stevenhagen
  Lecture Notes in Computer Science 1423, 1998, pp. 441-453
• Irregularity of prime numbers over real quadratic fields
  Joshua Holden
  Lecture Notes in Computer Science 1423, 1998, pp. 454-462
• Experimental results on class groups of real quadratic fields
  Michael J., Jr. Jacobson
  Lecture Notes in Computer Science 1423, 1998, pp. 463-474
• Computation of relative class numbers of imaginary cyclic fields of 2-power degrees
  Stéphane Louboutin
  Lecture Notes in Computer Science 1423, 1998, pp. 475-481
• Formal groups, elliptic curves, and some theorems of Couveignes
  Antonia W. Bluher
  Lecture Notes in Computer Science 1423, 1998, pp. 482-501
• A comparison of direct and indirect methods for computing Selmer groups of an elliptic curve
  Z. Djabri, N.P. Smart
  Lecture Notes in Computer Science 1423, 1998, pp. 502-513
• An algorithm for approximate counting of points on algebraic sets over finite fields
  Ming-Deh Huang, Yiu-Chung Wong
  Lecture Notes in Computer Science 1423, 1998, pp. 514-527
• S-integral points on elliptic curves and Fermat's triple equations
  A. Peth\Ho, E. Herrmann, H.G. Zimmer
  Lecture Notes in Computer Science 1423, 1998, pp. 528-540
• Speeding up Pollard's rho method for computing discrete logarithms
  Edlyn Teske
  Lecture Notes in Computer Science 1423, 1998, pp. 541-554
• A general method of constructing global function fields with many rational places
  Harald Niederreiter, Chaoping Xing
  Lecture Notes in Computer Science 1423, 1998, pp. 555-566
• Lattice basis reduction in function fields
  Sachar Paulus
  Lecture Notes in Computer Science 1423, 1998, pp. 567-575
• Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves
  Sachar Paulus, Andreas Stein
  Lecture Notes in Computer Science 1423, 1998, pp. 576-591
• Unit computation in purely cubic function fields of unit rank 1
  Renate Scheidler, Andreas Stein
  Lecture Notes in Computer Science 1423, 1998, pp. 592-606
• An improved method of computing the regulator of a real quadratic function field
  Andreas Stein, Hugh C. Williams
  Lecture Notes in Computer Science 1423, 1998, pp. 607-620
• The equivalence between elliptic curve and quadratic function field discrete logarithms in characteristic 2
  Robert J. Zuccherato
  Lecture Notes in Computer Science 1423, 1998, pp. 621-638