Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Flajolet, Philippe Add to Alert Profile  
 
Options:
Date Reviewed  
  1 - 5 of 11 reviews    
  Analytic combinatorics
Flajolet P., Sedgewick R., Cambridge University Press, New York, NY, 2009. 824 pp.  Type: Book (9780521898065)

This book is an encyclopedic treatment of the mathematics known as analytic combinatorics. Analytic combinatorics is a combination of enumerative combinatorics and the art and science of approximation. The goal of enumerative combinato...
...
May 20 2009  
  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  
  Continued fraction algorithms, functional operators, and structure constants
Flajolet P., Vallée B. Theoretical Computer Science 194(1-2): 1-34, 1998.  Type: Article

The techniques applied in the analysis of algorithms are described through the example of the classical continued fraction expansion of real numbers....
...
Aug 1 1998  
  An introduction to the analysis of algorithms
Sedgewick R., Flajolet P., Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1996.  Type: Book (9780201400090)

Some books take longer to review than others. When two eminent practitioners with a lot of experience in writing for various audiences produce a book of this length on the analysis of algorithms, it is unlikely that the critical reade...
...
Mar 1 1997  
  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  

 
Display per column
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy