Nearly Tight Bounds for Discrete Search under Outlier Noise

De, Anindya; Khanna, Sanjeev; Li, Huan; Nikpey, Hesam

doi:10.1137/1.9781611977066.11

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 10:00 PM ET on Friday, December 8 until 2:00 AM ET on Saturday, December 9 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

+ Advanced Search

Citation Details

Nearly Tight Bounds for Discrete Search under Outlier Noise

Award ID(s):: 2045128 1910534 1926872 2008305

NSF-PAR ID:: 10331551

Author(s) / Creator(s):: De, Anindya; Khanna, Sanjeev; Li, Huan; Nikpey, Hesam

Date Published:: 2022-01-01

Journal Name:: Symposium on Simplicity in Algorithms

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1137/1.9781611977066.11

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this