Using fractal geometry for solving divide-and-conquer recurrences

DOI10.1017/S0334270000007633MaRDI QIDQ4886318zbMATH OpenFDO

Authors Simant Dube

Publication date 11 December 1996

Published in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0334270000007633

zbMATH Keywords

fractal image

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Fractal geometry, Turing machines and divide-and-conquer recurrences
• Asymptotics of divide-and-conquer recurrences via iterated function systems
• A frame for general divide-and-conquer recurrences
• Exact asymptotics of divide-and-conquer recurrences
• scientific article; zbMATH DE number 125863

Cited in

(2)

• scientific article; zbMATH DE number 3911764 (Why is no real title available?)
• Fractal geometry, Turing machines and divide-and-conquer recurrences

This page was built for publication: Using fractal geometry for solving divide-and-conquer recurrences

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