English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time

Cheraghchi, M., & Nakos, V. (2021). Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time. In FOCS 2020 (pp. 1203-1213). Piscataway, NJ: IEEE. doi:10.1109/FOCS46700.2020.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0007-56C6-9 Version Permalink: https://hdl.handle.net/21.11116/0000-0008-1CE7-5
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Cheraghchi, Mahdi1, Author
Nakos, Vasileios2, 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: 202020212021
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Cheraghchi_FOCS2020
DOI: 10.1109/FOCS46700.2020
 Degree: -

Event

show
hide
Title: 61st Annual IEEE Symposium on Foundations of Computer Science
Place of Event: Durham, NC, USA (Virtual Conference)
Start-/End Date: 2020-11-16 - 2020-11-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: FOCS 2020
  Subtitle : IEEE 61st Annual Symposium on Foundations of Computer Science ; Proceedings
  Abbreviation : FOCS 2020
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Piscataway, NJ : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1203 - 1213 Identifier: ISBN: 978-1-7281-9621-3