English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons225687

Ray Chaudhury,  Bhaskar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., & Ray Chaudhury, B. (2018). Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. In S. Ganguly, & P. Pandya (Eds.), 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.FSTTCS.2018.40.


Cite as: https://hdl.handle.net/21.11116/0000-0002-9D0B-2
Abstract
There is no abstract available