The Query Complexity of Finding a Hidden Permutation

Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Doerr, Carola and Larsen, Kasper Green and Mehlhorn, Kurt
(2013) The Query Complexity of Finding a Hidden Permutation.
In: Space-Efficient Data Structures, Streams, and Algorithms.

Full text not available from this repository.
Item Type: Conference or Workshop Item (A Paper) (Paper)
Depositing User: Sebastian Weisgerber
Date Deposited: 22 Feb 2018 11:11
Last Modified: 22 Feb 2018 16:22
URI: https://publications.cispa.saarland/id/eprint/1677

Actions

Actions (login required)

View Item View Item
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.