@TechReport{vdH:sparsemult:old,
  author = 	 {J. van der Hoeven and G. Lecerf},
  title = 	 {On the bit-complexity of sparse polynomial multiplication},
  institution =  {Arxiv},
  year = 	 {2009},
  number = 	 {{\tt http://arxiv.org/abs/0901.4323v1}}
}

@TechReport{vdH:sparsemult:pre,
  author = 	 {Hoeven, J. van der and G. Lecerf},
  title = 	 {On the bit-complexity of sparse polynomial multiplication},
  institution =  {HAL},
  year = 	 {2010},
  note = 	 {\verb|http://hal.archives-ouvertes.fr/hal-00476223|}
}

@Article{vdH:sparsemult,
  author =       {Hoeven, J. van der and G. Lecerf},
  title =        {On the bit-complexity of sparse polynomial multiplication},
  journal =      {JSC},
  year =         {2013},
  volume =       {50},
  pages =        {227--254}
}