Alphabetic Minimax Trees in Linear Time

DOI10.1007/978-3-642-38536-0_4zbMath1381.68070OpenAlexW1698882794MaRDI QIDQ4928471

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

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

Related Items (1)

Operations research applications of dichotomous search

This page was built for publication: Alphabetic Minimax Trees in Linear Time