English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Multivariate Fine-Grained Complexity of Longest Common Subsequence

Bringmann, K., & Künnemann, M. (2018). Multivariate Fine-Grained Complexity of Longest Common Subsequence. In A. Czumaj (Ed.), SODA'18 (pp. 1216-1235). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975031.79.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0000-3F0E-C Version Permalink: https://hdl.handle.net/21.11116/0000-0000-3F0F-B
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bringmann, Karl1, Author           
Künnemann, Marvin1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20182018
 Publication Status: Issued
 Pages: 22 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bringmann_SODA18
DOI: 10.1137/1.9781611975031.79
 Degree: -

Event

show
hide
Title: Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: New Orleans, LA, USA
Start-/End Date: 2018-01-07 - 2018-01-10

Legal Case

show

Project information

show

Source 1

show
hide
Title: SODA'18
  Subtitle : Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2018
Source Genre: Proceedings
 Creator(s):
Czumaj, Artur1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1216 - 1235 Identifier: ISBN: 978-1-61197-503-1