On the weak prefix-search problem

DOI10.1016/J.TCS.2012.06.011zbMATH Open1292.68181OpenAlexW2119246514MaRDI QIDQ390882FDOQ390882

Authors: Paolo Ferragina 

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.011

Recommendations

• On the weak prefix-search problem
• On the Monotonicity of Weak Searching
• Fast prefix search in little space, with applications
• Efficient weakest preconditions
• On the Comparison Complexity of the String Prefix-Matching Problem
• Tight comparison bounds for the string prefix-matching problem
• On the Fast Searching Problem
• scientific article; zbMATH DE number 1256702
• The complexity of parallel prefix problems on small domains
• Strong-mixed searching and pathwidth

zbMATH Keywords

compressed indexes for string dictionariesenergy-efficient data structuresprefix searchweighted data structures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Data structures (68P05) Algorithms on strings (68W32)

Cites Work

• Title not available (Why is that?)
• The string B-tree
• Cache-Oblivious Algorithms
• Fast prefix search in little space, with applications
• Cache-oblivious string dictionaries
• Obtaining Provably Good Performance from Suffix Trees in Secondary Storage

Cited In (4)

• On the weak prefix-search problem
• Weakly adaptive comparison searching
• Fast prefix search in little space, with applications
• A new linear-time algorithm for centroid decomposition

This page was built for publication: On the weak prefix-search problem

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