General Techniques for Analyzing Recursive Algorithms with Applications

DOI10.1137/S0097539792240583zbMath0874.68141MaRDI QIDQ4337634

Rakesh M. Verma

Publication date: 26 May 1997

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

analysis of algorithmsgraph algorithmsdivide-and-conquerrecurrencesproblem complexitysubtree isomorphismassociative-commutative (AC) matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Recurrences (11B37) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (2)

Packing tripods: narrowing the density gap ⋮ An improved master theorem for divide-and-conquer recurrences

This page was built for publication: General Techniques for Analyzing Recursive Algorithms with Applications