English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Alphabetic Minimax Trees in Linear Time

MPS-Authors
/persons/resource/persons118149

Gawrychowski,  Pawel
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Gawrychowski, P. (2013). Alphabetic Minimax Trees in Linear Time. In A. A. Bulatov, & A. M. Shur (Eds.), Computer Science - Theory and Applications (pp. 36-48). Berlin: Springer. doi:10.1007/978-3-642-38536-0_4.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0015-78D1-1
Abstract
There is no abstract available