Search for Author All Reviews
	Prodinger, Helmut     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       The register function for t-ary trees Drmota M., Prodinger H. ACM Transactions on Algorithms 2(3): 318-334, 2006.  Type: Article This paper deals with register functions, which were introduced by Ershov. This function is equivalent to the Strahler number introduced by hydrogeologists. The function is recursively defined by reg[root] = 0, and, if a binary tree ... May 8 2007     The scientific works of Rainer Kemp (1949-2004) Flajolet P., Nebel M., Prodinger H. Theoretical Computer Science 355(3): 371-381, 2006.  Type: Article From the enumeration of leftist trees [1] to the basics of parsing context-free grammars, Rainer Kemp (1949--2004) had a major role in shaping the grounding of the analysis of algorithms. His research in the theory of formal l...... Aug 16 2006     Sorting algorithms for broadcast communications: mathematical analysis Grabner P., Prodinger H. Theoretical Computer Science 289(1): 51-67, 2002.  Type: Article The use of distributed databases and Internet communication has many of the features of parallel processing, so can be expected to yield faster algorithms for problems than those yielded by serial computation. The authors have analyzed...... Jul 22 2003     Mellin transforms and asymptotics Flajolet P., Grabner P., Kirschenhofer P., Prodinger H., Tichy R. Theoretical Computer Science 123(2): 291-314, 1994.  Type: Article A digital sum is the number of occurrences of the digit 1, or some other pattern of digits, in the codes (for some type of code) of 0 , 1 ,..., n - 1. A well-known digital sum is the number of occurrences of the digi...... Jan 1 1996     The path length of random skip lists Kirschenhofer P., Prodinger H. Acta Informatica 31(9): 775-792, 1994.  Type: Article The authors analyze search costs in random skip lists. They give formulations of expected values of the horizontal, vertical, and total path lengths. These formulations, as they observe, could also be derived from estimates given by &a...... Jan 1 1996
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy