Your search returned the following 3 documents:

3. The Query Complexity of Finding a Hidden Permutation
   Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, and Kurt Mehlhorn
   In: Space-Efficient Data Structures, Streams, and Algorithms, 2013, 1-11
   
2. The Engineering of Some Bipartite Matching Programs
   Kurt Mehlhorn
   In: Foundations of software technology and theoretical computer science : 19th conference, Chennai, India, December 16-18, 1999, 1999, 446-449
   
1. On the Kernelization Complexity of Colorful Motifs
   Abhimanyu M. Ambalath, Radheshyam Balasundaram, Chintan Rao H., Venkata Koppula, Neeldhara Misra, Geevarghese Philip, and M. S. Ramanujan
   In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, Chennai, India, 2010, 14-25
   [PDF: Download: cm-ipec.pdf]