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 [2]	Hilfe

Suche: Series=LNCS AND Volume=1838

• Fast computation of relative class numbers of CM-fields
  Stéphane Louboutin
  Lecture Notes in Computer Science 1838, 2000, pp. 413-422
• On probable prime testing and the computation of square roots mod n
  Siguna Müller
  Lecture Notes in Computer Science 1838, 2000, pp. 423-437
• Improving group law algorithms for Jacobians of hyperelliptic curves
  Koh-ichi Nagao
  Lecture Notes in Computer Science 1838, 2000, pp. 439-447
• Central values of Artin L-functions for quaternion fields
  Sami Omar
  Lecture Notes in Computer Science 1838, 2000, pp. 449-458
• The pseudoprimes up to 10^{13}
  Richard G.E. Pinch
  Lecture Notes in Computer Science 1838, 2000, pp. 459-473
• Computing the number of Goldbach partitions up to 5 \cdot 10^8
  Jörg Richstein
  Lecture Notes in Computer Science 1838, 2000, pp. 474-490
• Numerical verification of the Brumer-Stark conjecture
  Xavier-François Roblot, Brett A. Tangedal
  Lecture Notes in Computer Science 1838, 2000, pp. 491-503
• Explicit models of genus 2 curves with split CM
  Fernando Rodriguez-Villegas
  Lecture Notes in Computer Science 1838, 2000, pp. 505-513
• Reduction in purely cubic function fields of unit rank one
  Renate Scheidler
  Lecture Notes in Computer Science 1838, 2000, pp. 515-532
• Factorization in the composition algebras
  Derek A. Smith
  Lecture Notes in Computer Science 1838, 2000, pp. 533-537
• A fast algorithm for approximately counting smooth numbers
  Jonathan P. Sorenson
  Lecture Notes in Computer Science 1838, 2000, pp. 539-549
• Computing all integer solutions of a general elliptic equation
  Roel J. Stroeker, Nikolaos Tzanakis
  Lecture Notes in Computer Science 1838, 2000, pp. 551-561
• A note on Shanks's chains of primes
  Edlyn Teske, Hugh C. Williams
  Lecture Notes in Computer Science 1838, 2000, pp. 563-580
• Asymptotically fast discrete logarithms in quadratic number fields
  Ulrich Vollmer
  Lecture Notes in Computer Science 1838, 2000, pp. 581-594
• Asymptotically fast GCD computation in \mathbb{Z}[i]
  André Weilert
  Lecture Notes in Computer Science 1838, 2000, pp. 595-613