 |
Tenth Algorithmic Number Theory Symposium ANTS-X
|
- Deterministic elliptic curve primality proving for a special sequence of numbers, by Alexander Abatzoglou, Alice Silverberg, Andrew V. Sutherland, and Angela Wong
- Imaginary quadratic fields with isomorphic abelian Galois groups, by Athanasios Angelakis and Peter Stevenhagen
- Iterated Coleman integration for hyperelliptic curves, by Jennifer S. Balakrishnan
- Finding ECM-friendly curves through a study of Galois properties, by Răzvan Bărbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, and Peter L. Montgomery
- Two grumpy giants and a baby, by Daniel J. Bernstein and Tanja Lange
- New techniques for computing the ideal class group and a system of fundamental units in number fields, by Jean-François Biasse and Claus Fieker
- Conditionally bounding analytic ranks of elliptic curves, by Jonathan Bober
- A database of elliptic curves over Q(sqrt(5)) -- First report, by Jonathan Bober, Alyson Deines, Ariah Klages-Mundt, Benjamin LeVeque, R. Andrew Ohana, Ashwath Rabindranath, Paul Sharaba, and William Stein
- Finding simultaneous diophantine approximations with prescribed quality, by Wieb Bosma and Ionica Smeets
- Solving quadratic equations in dimension 5 or more without factoring, by Pierre Castel
- Counting value sets: algorithm and complexity, by Qi Cheng, Joshua E. Hill, and Daqing Wan
- Haberland's formula and numerical computation of Petersson scalar products, by Henri Cohen
- Approximate common divisors via lattices, by Henry Cohn and Nadia Heninger
- Explicit descent in the Picard group of a cyclic cover of the projective line, by Brendan Creutz
- Computing equations of curves with many points, by Virgile Ducet and Claus Fieker
- Computing the unit group, class group and compact representations in algebraic function fields, by Kirsten Eisenträger and Sean Hallgren
- The complex polynomials P(x) with Gal(P(x)-t) \cong M_{23}, by Noam D. Elkies
- Experiments with the transcendental Brauer-Manin obstruction, by Andreas-Stephan Elsenhans and Jörg Jahnel
- Explicit 5-descent on elliptic curves, by Tom Fisher
- On the density of non-square order Tate-Shafarevich groups, by Stefan Keil and Remke Kloosterman
- Improved CRT Algorithm for class polynomials in genus 2, by Kristin Lauter and Damien Robert
- Fast computation of isomorphisms of hyperelliptic curves and explicit descent, by Reynard Lercier, Christophe Ritzenthaler, and Jeroen Sijsling
- Elliptic factors in Jacobians of hyperelliptic curves with certain automorphism groups, by Jennifer Paulhus
- Constructing and tabulating dihedral function fields, by Renate Scheidler and Colin Weir
- On the evaluation of modular polynomials, by Andrew V. Sutherland
© 2011-12 Kiran S. Kedlaya (with thanks to Pierrick Gaudry and Emmanuel Thomé)
XHTML 1.1 valid, CSS valid
XHTML 1.1 valid, CSS valid