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

• Hecke operators and Hilbert modular forms
  Paul E. Gunnells, Dan Yasaki
  Lecture Notes in Computer Science 5011, 2008, pp. 387-401
• A birthday paradox for Markov chains, with an optimal bound for collision in the Pollard Rho algorithm for discrete logarithm
  Jeong Han Kim, Ravi Montenegro, Yuval Peres, Prasad Tetali
  Lecture Notes in Computer Science 5011, 2008, pp. 402-415
• An improved multi-set algorithm for the dense subset sum problem
  Andrew Shallue
  Lecture Notes in Computer Science 5011, 2008, pp. 416-429
• On the diophantine equation x^2+2^\alpha5^\beta13^\gamma = y^n
  Edray Goins, Florian Luca, Alain Togbé
  Lecture Notes in Computer Science 5011, 2008, pp. 430-442
• Non-vanishing of Dirichlet L-functions at the central point
  Sami Omar
  Lecture Notes in Computer Science 5011, 2008, pp. 443-453