Tight tradeoffs for real-time approximation of longest palindromes in streams

Paweł Gawrychowski, Oleg Merkurev, Arseny M. Shur, Przemysław Uznański

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Citations (Scopus)
Original languageEnglish
Title of host publication27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages18.1-18.13
Volume54
ISBN (Electronic)9783959770125
DOIs
Publication statusPublished - 1 Jun 2016
Event27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 - Tel Aviv, Israel
Duration: 27 Jun 201629 Jun 2016

Conference

Conference27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
Country/TerritoryIsrael
CityTel Aviv
Period27/06/201629/06/2016

Keywords

  • Monte Carlo algorithms
  • Palindromes
  • Real-time algorithms
  • Space lower bounds
  • Streaming algorithms

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Tight tradeoffs for real-time approximation of longest palindromes in streams'. Together they form a unique fingerprint.

Cite this