A frame for general divide-and-conquer recurrences

DOI10.1016/0020-0190(96)00076-2zbMath1046.68977OpenAlexW23674635MaRDI QIDQ1847368

Qingxiang Fu, Xiao-dong Wang

Publication date: 24 June 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00076-2

zbMATH Keywords

divide-and-conquer algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (4)

Generating all permutations by context-free grammars in Chomsky normal form ⋮ Generating all permutations by context-free grammars in Greibach normal form ⋮ On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms ⋮ A Real Elementary Approach to the Master Recurrence and Generalizations

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient output-sensitive hidden-surface removal algorithm for polyhedral terrains
• Constant Depth Reducibility
• A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
• Time and tape complexity of pushdown automaton languages

This page was built for publication: A frame for general divide-and-conquer recurrences