Digital search trees and chaos game representation*

Author： Cénac Peggy   Chauvin Brigitte   Ginouillac Stéphane   Pouyanne Nicolas  

Publisher： Edp Sciences

E-ISSN： 1262-3318|13|issue|15-37

ISSN： 1292-8100

Source： ESAIM: Probability and Statistics, Vol.13, Iss.issue, 2009-02, pp. : 15-37

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the representation of simply generated trees by leftist trees

By Kemp R.  

European Journal of Combinatorics, Vol. 24, Iss. 5, 2003-07 ,pp. : 581-605

Elsevier

Access to resources Recommend Favorite

The Pessimistic Search and the Straightening Involution for Trees

By Chen W.Y.C.  

European Journal of Combinatorics, Vol. 19, Iss. 5, 1998-07 ,pp. : 553-558

Elsevier

Access to resources Recommend Favorite

On the distribution of winning moves in random game trees

By  

Bulletin of the Australian Mathematical Society, Vol. 24, Iss. 2, 1981-10 ,pp. : 227-237

Cambridge University Press

Access to resources Recommend Favorite

Some Finiteness Results in the Representation Theory of Isometry Groups of Regular Trees

By Demir Selçuk  

Geometriae Dedicata, Vol. 105, Iss. 1, 2004-04 ,pp. : 189-207

Springer Publishing Company

Access to resources Recommend Favorite

Dissection of solutions in cooperative game theory using representation techniques

By Hernández-Lamoneda L.   Juárez R.   Sánchez-Sánchez F.  

International Journal of Game Theory, Vol. 35, Iss. 3, 2007-02 ,pp. : 395-426

Springer Publishing Company

Access to resources Recommend Favorite