Your search returned the following 2 documents:

2. The Query Complexity of Finding a Hidden Permutation
   Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, and Carola Winzen
   Electronic Colloquium on Computational Complexity (ECCC): Report Series 87 (Revision 1): 1-36, 2012
   
1. Succinct Sampling from Discrete Distributions
   Karl Bringmann and Kasper Green Larsen
   In: 45th ACM Symposium on Theory of Computing (STOC-13), Palo Alto, USA, 2013, 775-782