English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts

Bringmann, K., Künnemann, M., & Wellnitz, P. (2019). Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1126-1145). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975482.69.

Item is

Basic

show hide
Genre: Conference Paper
Latex : Few Matches or Almost Periodicity: {F}aster Pattern Matching with Mismatches in Compressed Texts

Files

show Files

Locators

show

Creators

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

Content

show

Details

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

Event

show
hide
Title: 30th Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: San Diego, CA, USA
Start-/End Date: 2019-01-06 - 2019-01-09

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2019
Source Genre: Proceedings
 Creator(s):
Chan, Timothy M.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 1126 - 1145 Identifier: ISBN: 978-1-61197-548-2