skip to main content

Explore Research Products in the NSF-PAR

Title: Nearly Tight Bounds for Discrete Search under Outlier Noise
Award ID(s):
2045128 1910534 1926872 2008305
NSF-PAR ID:
10331551
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Symposium on Simplicity in Algorithms
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email