Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Haystack hunting hints and locker room communication

Tools
- Tools
+ Tools

Czumaj, Artur, Kontogeorgiou, George and Paterson, Mike (2022) Haystack hunting hints and locker room communication. Random Structures & Algorithms . doi:10.1002/rsa.21114 ISSN 1042-9832. (In Press)

[img]
Preview
PDF
WRAP-Haystack-hunting-hints-and-locker-room-communication-Kontogeogiou-2022.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution 4.0.

Download (1446Kb) | Preview
Official URL: http://dx.doi.org/10.1002/rsa.21114

Request Changes to record.

Abstract

We want to efficiently find a specific object in a large unstructured set, which we model by a randomn-permutation, and we have to do it by revealing just a single element. Clearly, without any help this task is hopeless and the best one can do is to select the element at random, and achieve the success probability 1/n. Can we do better with some small amount of advice about the permutation, even without knowing the target object? We show that by providing advice of just one integer in {0,1,...,n-1}, one can improve the success probability considerably, by a θ(logn/loglogn) factor. We study this and related problems, and show asymptotically matching upper and lower bounds for their optimal probability of success. Our analysis relies on a close relationship of such problems to some intrinsic properties of random permutations related to the rencontres number.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Faculty of Science, Engineering and Medicine > Science > Mathematics
Library of Congress Subject Headings (LCSH): Permutations, Mathematical analysis , Computer programming, Algorithms
Journal or Publication Title: Random Structures & Algorithms
Publisher: John Wiley & Sons, Inc.
ISSN: 1042-9832
Official Date: 2022
Dates:
DateEvent
2022Published
31 August 2022Available
6 June 2022Accepted
28 May 2021Submitted
Number of Pages: 25
DOI: 10.1002/rsa.21114
Status: Peer Reviewed
Publication Status: In Press
Access rights to Published version: Open Access (Creative Commons)
Date of first compliant deposit: 19 October 2022
Date of first compliant Open Access: 19 October 2022
RIOXX Funder/Project Grant:
Project/Grant IDRIOXX Funder NameFunder ID
UNSPECIFIEDUniversity of Warwickhttp://dx.doi.org/10.13039/501100000741
UNSPECIFIEDIBM Center for the Business of Governmenthttp://dx.doi.org/10.13039/100014026
EP/V01305X/1[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266
Doctoral Training Partnership[EPSRC] Engineering and Physical Sciences Research Councilhttp://dx.doi.org/10.13039/501100000266

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us