Related content

Minimal path length of trees with known fringe

By De Prisco R.   Parlati G.   Persiano G.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 175-188

Elsevier

Access to resources Recommend Favorite

On the variance of the internal path length of generalized digital trees - The Mellin convolution approach

By Hubalek  

Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. : 143-168

Elsevier

Access to resources Recommend Favorite

Optimal Mappings of q-ary and Binomial Trees into Parallel Memory Modules for Fast and Conflict-Free Access to Path and Subtree Templates

By Das S.K.   Pinotti M.C.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 8, 2000-08 ,pp. : 998-1027

Academic Press

Access to resources Recommend Favorite

On enumeration of q -ary sequences with a fixed number of occurrences of the subblock 00

By Lebedev V.  

Problems of Information Transmission, Vol. 46, Iss. 4, 2010-12 ,pp. : 376-381

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Randomized path coloring on binary trees

By Auletta V.   Caragiannis I.   Kaklamanis C.   Persiano P.  

Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. : 355-399

Elsevier

Access to resources Recommend Favorite