English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  The Query Complexity of Finding a Hidden Permutation

Afshani, P., Agrawal, M., Doerr, B., Doerr, C., Larsen, K. G., & Mehlhorn, K. (2013). The Query Complexity of Finding a Hidden Permutation. In A. Brodnik, A. López-Ortiz, V. Raman, & A. Viola (Eds.), Space-Efficient Data Structures, Streams, and Algorithms (pp. 1-11). Berlin: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Afshani, Peyman1, Author
Agrawal, Manindra1, Author
Doerr, Benjamin2, Author           
Doerr, Carola2, Author           
Larsen, Kasper Green1, Author
Mehlhorn, Kurt2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2013
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: Other: Local_ID: 20EA14F7E5BB5FE7C1257C53007A351B-Afshani2013
BibTex Citekey: Afshani2013
DOI: 10.1007/978-3-642-40273-9_1
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Space-Efficient Data Structures, Streams, and Algorithms
  Subtitle : Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday
Source Genre: Book
 Creator(s):
Brodnik, Andrej1, Editor
López-Ortiz, Alejandro1, Editor
Raman, Venkatesh1, Editor
Viola, Alfredo1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1 - 11 Identifier: ISBN: 978-3-642-40272-2

Source 2

show
hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 8066 Sequence Number: - Start / End Page: - Identifier: -