Simple view

Full metadata view

Authors

Statistics

Tight conditional lower bounds for longest common increasing subsequence

2018
book section
conference proceedings
10.4230/LIPIcs.IPEC.2017.1
Author
Duraj Lech

Künnemann Marvin

Polak Adam
Editor
Lokshtanov Daniel

Nishimura Naomi
Book title / Journal title
12th International Symposium on Parameterized and Exact Computation : IPEC 2017, September 6-8, 2017, Vienna, Austria
Place of publication: Publisher
SaarbrückenWadern : Dagstuhl Publishing
Pages
15:1-15:13
ISBN
978-3-95977-051-4
Series
Leibniz International Proceedings in Informatics (LIPIcs)
Serie's ISSN
1868-8969
Number of serie
89
Keywords in English

fine-grained complexity

combinatorial pattern matching

sequence alignments

parameterized complexity

SETH

Language
English
Book language / Journal language
English
Conference
12th International Symposium on Parameterized and Exact Computation IPEC
Conference short name
IPEC
Conference start date
2017-09-06
End date conference
2017-09-08
Conference city
Wiedeń
Conference country
Austria
Conference type
international
Affiliation
Wydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznej
Scopus© citations
1
dc.affiliationWydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznejpl
dc.conference12th International Symposium on Parameterized and Exact Computation IPEC
dc.conference.cityWiedeń
dc.conference.countryAustria
dc.conference.datefinish2017-09-08
dc.conference.datestart2017-09-06
dc.conference.indexscopustrue
dc.conference.shortcutIPEC
dc.contributor.authorDuraj, Lech - 133967 pl
dc.contributor.authorKünnemann, Marvinpl
dc.contributor.authorPolak, Adam - 177165 pl
dc.contributor.editorLokshtanov, Danielpl
dc.contributor.editorNishimura, Naomipl
dc.date.accessioned2019-04-10T11:46:18Z
dc.date.available2019-04-10T11:46:18Z
dc.date.issued2018pl
dc.date.openaccess0
dc.description.accesstimew momencie opublikowania
dc.description.conftypeinternationalpl
dc.description.physical15:1-15:13pl
dc.description.seriesLeibniz International Proceedings in Informatics (LIPIcs)
dc.description.seriesnumber89
dc.description.versionostateczna wersja wydawcy
dc.identifier.doi10.4230/LIPIcs.IPEC.2017.1pl
dc.identifier.isbn978-3-95977-051-4pl
dc.identifier.projectROD UJ / OPpl
dc.identifier.seriesissn1868-8969
dc.identifier.urihttps://ruj.uj.edu.pl/xmlui/handle/item/72708
dc.languageengpl
dc.language.containerengpl
dc.pubinfoSaarbrückenpl
dc.pubinfoWadern : Dagstuhl Publishingpl
dc.rightsUdzielam licencji. Uznanie autorstwa 3.0*
dc.rights.licenceCC-BY
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/legalcode*
dc.share.typeinne
dc.subject.enfine-grained complexitypl
dc.subject.encombinatorial pattern matchingpl
dc.subject.ensequence alignmentspl
dc.subject.enparameterized complexitypl
dc.subject.enSETHpl
dc.subtypeConferenceProceedingspl
dc.titleTight conditional lower bounds for longest common increasing subsequencepl
dc.title.container12th International Symposium on Parameterized and Exact Computation : IPEC 2017, September 6-8, 2017, Vienna, Austriapl
dc.typeBookSectionpl
dspace.entity.typePublication
dc.affiliationpl
Wydział Matematyki i Informatyki : Zespół Katedr i Zakładów Informatyki Matematycznej
dc.conference
12th International Symposium on Parameterized and Exact Computation IPEC
dc.conference.city
Wiedeń
dc.conference.country
Austria
dc.conference.datefinish
2017-09-08
dc.conference.datestart
2017-09-06
dc.conference.indexscopus
true
dc.conference.shortcut
IPEC
dc.contributor.authorpl
Duraj, Lech - 133967
dc.contributor.authorpl
Künnemann, Marvin
dc.contributor.authorpl
Polak, Adam - 177165
dc.contributor.editorpl
Lokshtanov, Daniel
dc.contributor.editorpl
Nishimura, Naomi
dc.date.accessioned
2019-04-10T11:46:18Z
dc.date.available
2019-04-10T11:46:18Z
dc.date.issuedpl
2018
dc.date.openaccess
0
dc.description.accesstime
w momencie opublikowania
dc.description.conftypepl
international
dc.description.physicalpl
15:1-15:13
dc.description.series
Leibniz International Proceedings in Informatics (LIPIcs)
dc.description.seriesnumber
89
dc.description.version
ostateczna wersja wydawcy
dc.identifier.doipl
10.4230/LIPIcs.IPEC.2017.1
dc.identifier.isbnpl
978-3-95977-051-4
dc.identifier.projectpl
ROD UJ / OP
dc.identifier.seriesissn
1868-8969
dc.identifier.uri
https://ruj.uj.edu.pl/xmlui/handle/item/72708
dc.languagepl
eng
dc.language.containerpl
eng
dc.pubinfopl
Saarbrücken
dc.pubinfopl
Wadern : Dagstuhl Publishing
dc.rights*
Udzielam licencji. Uznanie autorstwa 3.0
dc.rights.licence
CC-BY
dc.rights.uri*
http://creativecommons.org/licenses/by/3.0/legalcode
dc.share.type
inne
dc.subject.enpl
fine-grained complexity
dc.subject.enpl
combinatorial pattern matching
dc.subject.enpl
sequence alignments
dc.subject.enpl
parameterized complexity
dc.subject.enpl
SETH
dc.subtypepl
ConferenceProceedings
dc.titlepl
Tight conditional lower bounds for longest common increasing subsequence
dc.title.containerpl
12th International Symposium on Parameterized and Exact Computation : IPEC 2017, September 6-8, 2017, Vienna, Austria
dc.typepl
BookSection
dspace.entity.type
Publication
Affiliations
Wydział Matematyki i Informatyki
Duraj, Lech
Polak, Adam
No affiliation
Künnemann, Marvin
Lokshtanov, Daniel
Nishimura, Naomi

* The migration of download and view statistics prior to the date of April 8, 2024 is in progress.

Views
2
Views per month
Views per city
Bühl
1
Downloads
duraj_kunnemann_polak_tight_conditional_lower_boinds_for_longest_common_2019.pdf
9
duraj_kunnemann_polak_tight_conditional_lower_boinds_for_longest_common_2019.odt
5

Open Access

Thumbnail Image
License
CC-BY

Except as otherwise noted, this item is licensed under : Udzielam licencji. Uznanie autorstwa 3.0

Collections
Research publications
Exact sciences
ROD UJ