Show simple item record

AuthorOhlebusch, Ennodc.contributor.author
AuthorGog, Simondc.contributor.author
Date of accession2020-10-26T07:55:57Zdc.date.accessioned
Available in OPARU since2020-10-26T07:55:57Zdc.date.available
Date of first publication2010dc.date.issued
Languageendc.language.iso
PublisherUniversität Ulmdc.publisher
KeywordAlgorithmsdc.subject
KeywordSuffix arraydc.subject
KeywordSuffix-prefix matchingdc.subject
Dewey Decimal GroupDDC 000 / Computer science, information & general worksdc.subject.ddc
TitleEfficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problemdc.title
Resource typeWissenschaftlicher Artikeldc.type
FacultyFakultät für Ingenieurwissenschaften, Informatik und Psychologieuulm.affiliationGeneral
InstitutionInstitut für Theoretische Informatikuulm.affiliationSpecific
DCMI TypeTextuulm.typeDCMI
CategoryPublikationsnachweiseuulm.category
DOI (external)10.1016/j.ipl.2009.10.015dc.identifier.doiExternal
Source - Title of sourceInformation Processing Letterssource.title
Source - Place of publicationElseviersource.publisher
Source - Volume110source.volume
Source - Issue3source.issue
Source - Year2010source.year
Source - From page123source.fromPage
Source - To page128source.toPage
Source - ISSN0020-0190source.identifier.issn
Source - eISSN1872-6119source.identifier.eissn
Suitable communityFakultät für Ingenieurwissenschaften, Informatik und Psychologieuulm.community
WoS000274077500009uulm.identifier.wos
University Bibliographyjauulm.unibibliographie


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record