On the List Size in the Levenshtein’s Sequence Reconstruction Problem

Tietueen suppeat tiedot
dc.contributor.authorJunnila Ville
dc.contributor.authorLaihonen Tero
dc.contributor.authorLehtilä Tuomo
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id175871892
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/175871892
dc.date.accessioned2022-11-29T15:45:52Z
dc.date.available2022-11-29T15:45:52Z
dc.format.pagerange515
dc.identifier.eisbn978-1-6654-2159-1
dc.identifier.isbn978-1-6654-2160-7
dc.identifier.issn2157-8095
dc.identifier.jour-issn2157-8095
dc.identifier.olddbid190132
dc.identifier.oldhandle10024/173223
dc.identifier.urihttps://www.utupub.fi/handle/11111/32546
dc.identifier.urlhttps://ieeexplore.ieee.org/document/9834612
dc.identifier.urnURN:NBN:fi-fe2022112967680
dc.language.isoen
dc.okm.affiliatedauthorJunnila, Ville
dc.okm.affiliatedauthorLaihonen, Tero
dc.okm.discipline113 Computer and information sciencesen_GB
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA4 Conference Article
dc.publisher.countryUnited Statesen_GB
dc.publisher.countryYhdysvallat (USA)fi_FI
dc.publisher.country-codeUS
dc.relation.conferenceIEEE International Symposium on Information Theory
dc.relation.doi10.1109/ISIT50566.2022.9834612
dc.relation.ispartofjournalIEEE International Symposium on Information Theory
dc.relation.ispartofseriesIEEE International Symposium on Information Theory
dc.source.identifierhttps://www.utupub.fi/handle/10024/173223
dc.titleOn the List Size in the Levenshtein’s Sequence Reconstruction Problem
dc.title.book2022 IEEE International Symposium on Information Theory (ISIT)
dc.year.issued2022

Tiedostot

Näytetään 1 - 1 / 1
Name:
On-the-List-Size.pdf
Size:
456.41 KB
Format:
Adobe Portable Document Format
Lataa

Kokoelmat

Rinnakkaistallenteet