page 1  (32 pages)
2to next section

EIDGEN?OSSISCHE TECHNISCHE HOCHSCHULE LAUSANNE
POLITECNICO FEDERALE DI LOSANNA
SWISS FEDERAL INSTITUTE OF TECHNOLOGY LAUSANNE

DEPARTMENT OF COMPUTER SCIENCE
COMPUTER SCIENCE THEORY LABORATORY

?COLEPOLYTECHNIQUEF?D?RALEDELAUSANNE

A Survey on Minimax Trees and

Associated Algorithms?

Claude G. Diderich and Marc Gengler
Swiss Federal Institute of Technology, Lausanne
Computer Science Theory Laboratory
CH-1015 Lausanne
Switzerland
fdiderich,[email protected]

May 1994
Technical report 94/50

LIMITED DISTRIBUTION NOTICE
This report has been submitted for publication and will probably be copyrighted if accepted for publication. It has been issued as a research report for early dissemination of its contents and will be distributed outside of the EPFL up to one year after the date indicated on this page. In view of the transfer of copyright to the outside publisher, its distribution outside the EPFL prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article.
?Research partly supported by Swiss National Science Foundation grant SPP-IF 5003-034349.