scientific article; zbMATH DE number 7651106

DOI10.4230/LIPICS.CPM.2020.15MaRDI QIDQ5874443FDOQ5874443

Authors: Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat 

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2004.12881

Title of this publication is not available (Why is that?)

Recommendations

• The streaming \(k\)-mismatch problem
• Streaming \(k\)-mismatch with error correcting and applications
• A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs
• Better bounds for matchings in the streaming model
• An almost space-optimal streaming algorithm for coresets in fixed dimensions
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions
• Approximate Maximum Matching in Random Streams
• Time bounds for streaming problems
• Streaming algorithms for estimating the matching size in planar graphs and beyond
• Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond

zbMATH Keywords

Hamming distancestreaming pattern matching\(k\)-mismatch

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited In (1)

• Streaming dictionary matching with mismatches

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874443)