Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve

Article Details
Title:	Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve
Article URLs:	https://doi.org/10.1109/FOCS.2017.26 http://doi.ieeecomputersociety.org/10.1109/FOCS.2017.26
Alternative Article URLs:
Authors:	Amir Abboud	Stanford University, Computer Science Department
	Arturs Backurs	MIT, EECS
	Karl Bringmann	Max Planck Institute for Informatics, Saarland Informatics Campus
	Marvin Künnemann	Max Planck Institute for Informatics, Saarland Informatics Campus
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:	1417238, 1514339
DBLP Key:	conf/focs/AbboudBBK17
Author Comments:

IEEE Foundations of Computer Science, FOCS 2017