Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?

Michael Waechter, Kay Hamacher, Franziska Hoffgaard, Sven Widmer, Michael Goesele. Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?. In Roman Wyrzykowski, Jack Dongarra, Konrad Karczewski, Jerzy Wasniewski, editors, Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Torun, Poland, September 11-14, 2011. Revised Selected Papers, Part I. Volume 7203 of Lecture Notes in Computer Science, pages 297-306, Springer, 2011. [doi]

@inproceedings{WaechterHHWG11,
  title = {Is Your Permutation Algorithm Unbiased for n ≠ 2 m ?},
  author = {Michael Waechter and Kay Hamacher and Franziska Hoffgaard and Sven Widmer and Michael Goesele},
  year = {2011},
  doi = {10.1007/978-3-642-31464-3_30},
  url = {http://dx.doi.org/10.1007/978-3-642-31464-3_30},
  researchr = {https://researchr.org/publication/WaechterHHWG11},
  cites = {0},
  citedby = {0},
  pages = {297-306},
  booktitle = {Parallel Processing and Applied Mathematics - 9th International Conference, PPAM 2011, Torun, Poland, September 11-14, 2011. Revised Selected Papers, Part I},
  editor = {Roman Wyrzykowski and Jack Dongarra and Konrad Karczewski and Jerzy Wasniewski},
  volume = {7203},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-31463-6},
}