The Query Complexity of Finding a Hidden Permutation - Research - Aarhus University

Aarhus University Seal

For students
For PhDs
For employees
Departments and faculties
AU Library

The Query Complexity of Finding a Hidden Permutation

Research output: Contribution to book/anthology/report/proceeding › Book chapter › Research › peer-review

DOI

https://doi.org/10.1007/978-3-642-40273-9_1

Peyman Afshani
Manindra Agrawal, Indian Institute of Technology Kanpur , India
Doerr Benjamin, Max Planck Institute for Informatics, Germany
Carola Doerr, Max Planck Institute for Informatics, LIAFA, Université Paris Diderot, Germany
Kasper Green Larsen
Kurt Mehlhorn, Max Planck Institute for Informatics, Germany

Original language	English
Title of host publication	Space-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday
Editors	Andrej Brodnik, Alejandro López-Ortiz, Venkatesh Raman, Alfredo Viola
Number of pages	11
Publisher	Springer VS
Publication year	2013
Pages	1-11
ISBN (print)	978-3-642-40272-2
ISBN (Electronic)	978-3-642-40273-9
DOIs	https://doi.org/10.1007/978-3-642-40273-9_1
Publication status	Published - 2013

Series	Lecture Notes in Computer Science
Volume	8066
ISSN	0302-9743

See relations at Aarhus University Citationformats

ID: 79643177