Alphabetic minimax trees in linear time

DOI10.1007/978-3-642-38536-0_4MaRDI QIDQ4928471zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski

Publication date 14 June 2013

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38536-0_4

zbMATH Keywords

linear decision treeminimax treeYeung's inequality

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms (68W40)

Recommendations

• Minimax trees in linear time with applications
• Minimax Trees in Linear Time with Applications
• scientific article; zbMATH DE number 1947386
• Alphabetic Minimax Trees
• A new algorithm for building alphabetic minimax trees

Cited in

(9)

• Operations research applications of dichotomous search
• Minimax trees in linear time with applications
• Online binary minimax trees
• A new algorithm for building alphabetic minimax trees
• Minimax Trees in Linear Time with Applications
• Alphabetic Minimax Trees
• The Optimal Alphabetic Tree problem revisited
• Upper and Lower Bounds on Constructing Alphabetic Binary Trees
• Old and new results on alphabetic codes

This page was built for publication: Alphabetic minimax trees in linear time

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