Kings, name days, lazy servants and magic

DOI10.4230/LIPICS.FUN.2018.10MaRDI QIDQ3305728zbMATH OpenOpenAlexFDO

Authors Paolo Boldi, Sebastiano Vigna

Publication date 11 August 2020

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2018/8801/pdf/LIPIcs-FUN-2018-10.pdf

zbMATH Keywords

prefix searchsuffix arrayssuffix treesz-fast tries

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Once upon an algorithm. How stories explain computing
• Kings and serfs in oriented graphs
• Smullyan's Vizier Problem
• Searching for Sorted Sequences of Kings in Tournaments
• Finding kings in tournaments

Cites work

• Cache-oblivious algorithms
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• Compressed suffix trees with full functionality
• Efficient randomized pattern-matching algorithms
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 7051248 (Why is no real title available?)
• Indexing compressed text
• Linear work suffix array construction
• Replacing suffix trees with enhanced suffix arrays
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Two Efficient Algorithms for Linear Time Suffix Array Construction

This page was built for publication: Kings, name days, lazy servants and magic

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