Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Alphabetic Minimax Trees - MaRDI portal

Alphabetic Minimax Trees

From MaRDI portal

Publication:3680759

Jump to:navigation, search

DOI10.1137/0214039zbMath0565.94025OpenAlexW2093223499MaRDI QIDQ3680759

David G. Kirkpatrick, Maria M. Klawe

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1137/0214039

zbMATH Keywords

upper bound rooted tree minimax value linear algorithm logical circuits alphabetic tree fan-out constraints fanout reduction optimal weighted tree t-ary tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Related Items (5)

Operations research applications of dichotomous search ⋮ Online binary minimax trees ⋮ Minimax trees in linear time with applications ⋮ Tight bounds for online stable sorting ⋮ Optimal binary search trees

This page was built for publication: Alphabetic Minimax Trees

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3680759&oldid=17150883"