An improved master theorem for divide-and-conquer recurrences

DOI10.1007/3-540-63165-8_201zbMath1401.68056OpenAlexW1516314780MaRDI QIDQ4571976

Salvador Roura

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_201

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items (4)

A Real Elementary Approach to the Master Recurrence and Generalizations ⋮ Unnamed Item ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ QuickXsort: a fast sorting scheme in theory and practice

Uses Software

• Quicksort
• Find

Cites Work

• Unnamed Item
• Unnamed Item
• Analytic variations on quadtrees
• A General Method and a Master Theorem for Divide-and-Conquer Recurrences with Applications
• General Techniques for Analyzing Recursive Algorithms with Applications
• Increasing the efficiency of quicksort
• Quicksort

This page was built for publication: An improved master theorem for divide-and-conquer recurrences