English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve

Abboud, A., Backurs, A., Bringmann, K., & Künnemann, M. (2017). Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve. In 58th Annual IEEE Symposium on Foundations of Computer Science (pp. 192-203). Piscataway, NJ: IEEE. doi:10.1109/FOCS.2017.26.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Fine-Grained Complexity of Analyzing Compressed Data: {Q}uantifying Improvements over Decompress-And-Solve

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Abboud, Amir1, Author
Backurs, Arturs1, Author
Bringmann, Karl2, Author           
Künnemann, Marvin2, 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: 20172017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Abboud_FOCS2017
DOI: 10.1109/FOCS.2017.26
 Degree: -

Event

show
hide
Title: 58th Annual IEEE Symposium on Foundations of Computer Science
Place of Event: Berkeley, CA, USA
Start-/End Date: 2017-10-15 - 2017-10-17

Legal Case

show

Project information

show

Source 1

show
hide
Title: 58th Annual IEEE Symposium on Foundations of Computer Science
  Subtitle : FOCS 2017 ; Proceedings ; 15–17 October 2017, Berkeley, CA, USA
  Abbreviation : FOCS 2017
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Piscataway, NJ : IEEE
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 192 - 203 Identifier: ISBN: 978-1-5386-3464-6