TU Darmstadt / ULB / TUbiblio

Is your permutation algorithm unbiased for n<>2^m?

Waechter, Michael and Hamacher, Kay and Hoffgaard, Franziska and Widmer, Sven and Goesele, Michael (2011):
Is your permutation algorithm unbiased for n<>2^m?
In: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), pp. 297-306,
Springer, International Conference on Parallel Processing and Applied Mathematics (PPAM), Torun, Poland, 12-14 Sept. 2011, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2011
Creators: Waechter, Michael and Hamacher, Kay and Hoffgaard, Franziska and Widmer, Sven and Goesele, Michael
Title: Is your permutation algorithm unbiased for n<>2^m?
Language: English
Title of Book: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)
Publisher: Springer
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Graphics, Capture and Massively Parallel Computing
Event Title: International Conference on Parallel Processing and Applied Mathematics (PPAM)
Event Location: Torun, Poland
Event Dates: 12-14 Sept. 2011
Date Deposited: 28 Sep 2016 14:34
Corresponding Links:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details