Free access
Proceedings
Symposium on Simplicity in Algorithms (SOSA)

Generalized Sorting with Predictions

Abstract

Generalized sorting problem, also known as sorting with forbidden comparisons, was first introduced by Huang et al. [HKK11] together with a randomized algorithm which requires Õ(n3/2) probes. We study this problem with additional predictions for all pairs of allowed comparisons as input. We propose a randomized algorithm which uses O(n log n + w) probes with high probability and a deterministic algorithm which uses O(nw) probes, where w is the number of mistakes made by prediction.

Formats available

You can view the full content in the following formats:

Information & Authors

Information

Published In

cover image Proceedings
Symposium on Simplicity in Algorithms (SOSA)
Pages: 111 - 117
Editors: King Valerie, University of Victoria, Canada and Le Hung Viet, University of Massachusetts, Amherst, Massachusetts, USA
ISBN (Online): 978-1-61197-649-6

History

Published online: 7 January 2021

Authors

Affiliations

Notes

This work was done while the authors were visiting Huawei TCS Lab.

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options

PDF

View PDF

Get Access

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

On May 28, 2024, our site will enter Read Only mode for a limited time in order to complete a platform upgrade. As a result, the following functions will be temporarily unavailable: registering new user accounts, any updates to existing user accounts, access token activations, and shopping cart transactions. Contact [email protected] with any questions.