A New Algorithm for Building Alphabetic Minimax Trees

DOI10.3233/FI-2009-204zbMath1200.68078arXiv0810.5064OpenAlexW1581014825MaRDI QIDQ3400581

Travis Gagie

Publication date: 5 February 2010

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0810.5064

zbMATH Keywords

data structuresalphabetic minimax trees

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Related Items (2)

Operations research applications of dichotomous search ⋮ Minimax trees in linear time with applications

This page was built for publication: A New Algorithm for Building Alphabetic Minimax Trees