WorldCat Identities

Greene, Daniel H. 1955-

Overview
Works: 9 works in 78 publications in 3 languages and 1,199 library holdings
Genres: History 
Roles: Author
Classifications: QA76.6, 519.4
Publication Timeline
.
Most widely held works by Daniel H Greene
Mathematics for the analysis of algorithms by Daniel H Greene( Book )

37 editions published between 1981 and 2009 in English and German and held by 1,033 WorldCat member libraries worldwide

"A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford."--Publisher's website
Mathematics for the Analysis of Algorithms by Daniel H Greene( )

2 editions published between 1990 and 2010 in English and held by 57 WorldCat member libraries worldwide

A quantitative study of the efficiency of computer methods requires an in-depth understanding of both mathematics and computer science. This monograph, derived from an advanced computer science course at Stanford University, builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is terse enough for easy reference yet detailed enough for those with little background. Approximately half the book is devoted to original problems and solutions from examinations given at Stanford." ... a very valuable collection of mathematical techniques for the analysis of algorithms ..."--Mathematical Reviews "The book covers the important mathematical tools used in computer science, especially in the exact analysis of algorithms. A wide range of topics are covered, from the binomial theorem to the saddle point method and Laplace's techniques for asymptotic analysis ... The book is very well written. The style and the mathematical exposition make the book pleasant to read ... It covers many of the major paradigms used in the analysis of algorithms in its one hundred plus pages." -- SIAM Review "The book presents a welcome selection and careful exposition of material that can be (and is) covered in a single course ... In this reviewer's opinion, this would be an interesting text to use with a group of advanced students well-grounded in undergraduate mathematics and computer science, and would produce a valuable course for the participating students." -- Computing Reviews
Mathematics for the analysis of algorithms by Daniel H Greene( Book )

12 editions published between 1981 and 1982 in English and held by 50 WorldCat member libraries worldwide

Mathematics for the analysis of algorithms by Daniel H Greene( Book )

6 editions published between 1990 and 2008 in English and held by 22 WorldCat member libraries worldwide

Labelled formal languages and their uses by Daniel H Greene( Book )

11 editions published between 1983 and 1991 in English and Undetermined and held by 19 WorldCat member libraries worldwide

This research augments formal languages with the machinery necessary to describe labelled combinatorial objects such as trees, permutations, and networks. The most attractive feature of this method of describing combinatorial objects is the direct translation to generating functions, treating the grammar of an ordinary formal language as a set of equations and then solving these equations yields an enumerating generating function. This is still true of labelled formal languages although the equations are usually differential rather than rational or algebraic. There are two promising applications for labelled formal languages. In the analysis of algorithms one often identifies combinatorial quantities that can be described with labelled formal languages and, using the translation mentioned about, these quantities can be easily computed. The other application uses labelled formal languages to control a general-purpose system for the ranking, sequencing, and selection of combinatorial objects. Both of these applications demonstrate the value of labelled formal languages as a descriptive and analytic tool
Matematičeskie metody analiza algoritmov by Daniel H Greene( Book )

5 editions published in 1987 in Russian and held by 9 WorldCat member libraries worldwide

Data compression with finite windows by E. R Fiala( Book )

3 editions published in 1989 in English and held by 8 WorldCat member libraries worldwide

This paper includes a graph-theoretic analysis of the compression penalty incurred by our codeword selection policy in comparison with an optimal policy, and it includes empirical studies of the performance of various compressors from the literature."
History of the town of East Greenwich and adjacent territory, from 1677-1877 by Daniel H Greene( Book )

1 edition published in 1877 in English and held by 1 WorldCat member library worldwide

Mathematics for the analysis of algorithms by Daniel H Greene( Book )

1 edition published in 1986 in English and held by 0 WorldCat member libraries worldwide

 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.58 (from 0.32 for History of ... to 1.00 for Mathematic ...)

Mathematics for the analysis of algorithms Mathematics for the analysis of algorithms
Covers
Mathematics for the Analysis of AlgorithmsMathematics for the analysis of algorithms
Alternative Names
Greene, D.

Grin, D.

Grin, D. 1955-

Grin, Deniel Ch.

Грин, Д 1955-

Грин Дэниел Х.

Languages