Scanning multiple sequences via cache memory

DOI10.1007/S00453-002-0993-2MaRDI QIDQ1566375zbMATH OpenOpenAlexFDO

Authors K. Mehlhorn, Peter Sanders

Publication date 2 June 2003

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-002-0993-2

zbMATH Keywords

memory hierarchydata distributioncache memoryexternal memory algorithmmulti-mergeset associative cache

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Publication:4938915
• scientific article; zbMATH DE number 1945797
• Quickest Search Over Multiple Sequences
• scientific article; zbMATH DE number 1947388
• Euro-Par 2004 Parallel Processing
• Parallel Sorting with Serial Memories
• Efficient reconstruction of sequences

Cited in

(3)

• scientific article; zbMATH DE number 1947388 (Why is no real title available?)
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• Engineering parallel string sorting

This page was built for publication: Scanning multiple sequences via cache memory

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