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

• Computing pro-P Galois groups
  Nigel Boston, Harris Nover
  Lecture Notes in Computer Science 4076, 2006, pp. 1-10
• The elliptic curve database for conductors to 130000
  John Cremona
  Lecture Notes in Computer Science 4076, 2006, pp. 11-29
• On the computation of the coefficients of a modular form
  Bas Edixhoven
  Lecture Notes in Computer Science 4076, 2006, pp. 30-39
• Cohen-Lenstra heuristics of quadratic number fields
  Étienne Fouvry, Jürgen Klüners
  Lecture Notes in Computer Science 4076, 2006, pp. 40-55
• An algorithm for computing p-class groups of Abelian number fields
  Miho Aoki, Takashi Fukuda
  Lecture Notes in Computer Science 4076, 2006, pp. 56-71
• Computation of locally free class groups
  Werner Bley, Robert Boltje
  Lecture Notes in Computer Science 4076, 2006, pp. 72-86
• Numerical results on class groups of imaginary quadratic fields
  Michael J., Jr. Jacobson, Shantha Ramachandran, Hugh Williams
  Lecture Notes in Computer Science 4076, 2006, pp. 87-101
• Cyclic polynomials arising from Kummer theory of norm algebraic tori
  Masanari Kida
  Lecture Notes in Computer Science 4076, 2006, pp. 102-113
• The totally real primitive number fields of discriminant at most 10^9
  Gunter Malle
  Lecture Notes in Computer Science 4076, 2006, pp. 114-123
• A modular method for computing the splitting field of a polynomial
  Guénaël Renault, Kazuhiro Yokoyama
  Lecture Notes in Computer Science 4076, 2006, pp. 124-140
• On the density of sums of three cubes
  Jean-Marc Deshouillers, François Hennecart, Bernard Landreau
  Lecture Notes in Computer Science 4076, 2006, pp. 141-155
• The Mertens conjecture revisited
  Tadej Kotnik, Herman te Riele
  Lecture Notes in Computer Science 4076, 2006, pp. 156-167
• Fast bounds on the distribution of smooth numbers
  Scott T. Parsell, Jonathan P. Sorenson
  Lecture Notes in Computer Science 4076, 2006, pp. 168-181
• Use of extended Euclidean algorithm in solving a system of linear diophantine equations with bounded variables
  Parthasarathy Ramachandran
  Lecture Notes in Computer Science 4076, 2006, pp. 182-192
• The pseudosquares prime sieve
  Jonathan P. Sorenson
  Lecture Notes in Computer Science 4076, 2006, pp. 193-207
• Doubly-focused enumeration of pseudosquares and pseudocubes
  Kjell Wooding, Hugh C. Williams
  Lecture Notes in Computer Science 4076, 2006, pp. 208-221
• Practical lattice basis sampling reduction
  Johannes Buchmann, Christoph Ludwig
  Lecture Notes in Computer Science 4076, 2006, pp. 222-237
• LLL on the average
  Phong Q. Nguyen, Damien Stehlé
  Lecture Notes in Computer Science 4076, 2006, pp. 238-256
• On the randomness of bits generated by sufficiently smooth functions
  Damien Stehlé
  Lecture Notes in Computer Science 4076, 2006, pp. 257-274
• Computing a lower bound for the canonical height on elliptic curves over \mathbb {Q}
  John Cremona, Samir Siksek
  Lecture Notes in Computer Science 4076, 2006, pp. 275-286
• Points of low height on elliptic curves and surfaces - I: Elliptic surfaces over \mathbb {P}^1 with small d
  Noam D. Elkies
  Lecture Notes in Computer Science 4076, 2006, pp. 287-301
• Shimura curves for level-3 subgroups of the (2,3,7) triangle group, and some other examples
  Noam D. Elkies
  Lecture Notes in Computer Science 4076, 2006, pp. 302-316
• The asymptotics of points of bounded height on diagonal cubic and quartic threefolds
  Andreas-Stephan Elsenhans, Jörg Jahnel
  Lecture Notes in Computer Science 4076, 2006, pp. 317-332
• Testing equivalence of ternary cubics
  Tom Fisher
  Lecture Notes in Computer Science 4076, 2006, pp. 333-345
• 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