|
|
|
|
LEADER |
03208cam a22003493u 4500 |
001 |
10101062 |
003 |
upatras |
005 |
20210309093818.0 |
008 |
991022s1990 eng |
020 |
|
|
|a 0 8176 3515 7
|
040 |
|
|
|a Βιβλιοθήκη ΕΑΙΤΥ
|c Βιβλιοθήκη ΕΑΙΤΥ
|
041 |
0 |
|
|a eng
|
082 |
0 |
4 |
|a 005.1
|
245 |
1 |
0 |
|a Mathematics for the analysis of algorithms
|c Daniel H. Greene, Donald E. Knuth
|
250 |
|
|
|a 3rd ed.
|
260 |
|
|
|a Boston
|b Birkhauser
|c 1990
|
300 |
|
|
|a viii, 132p.
|
490 |
0 |
|
|a Progress in Computer Science and Applied Logic : 3rd ed / John C Cherniavsky, Georgetown University
|v 1
|
504 |
|
|
|a περιεχει βιβλιογραφια περιέχει προβλήματα
|
505 |
1 |
|
|a 1. Binomial Identities
|a 1.1 Summary of Useful Identities
|a 1.2 Deriving the Identities
|a 1.3 Inverse Relations
|a 1.4 Operator Calculus
|a 1.5 Hypergeometric Series
|a 1.6 Identities with thw Harmonic Numbers
|a 2. Recurrence Relations
|a 2.1 Linear Recurrence Relations
|a 2.1.1 Finite History
|a 2.1.1.1 Constant Coefficients
|a 2.1.1.2 Variable Coefficients
|a 2.1.2 Full History
|a 2.1.2.1 Differencing
|a 2.1.2.2 By Repertoire
|a 2.2 Nonlinear Recurrence Relations
|a 2.2.1 Relations with Maximum or Minimum Functions
|a 2.2.2 Continued Fractions and Hidden Linear Recurrences
|a 2.2.3 Doubly Exponential Sequences
|a 3. Operator Methods
|a 3.1 The Cookie Monster
|a 3.2 Coalesced Hashing
|a 3.3 Open Addressing : Uniform Hashing
|a 3.4 Open Addressing : Secondary Clustering
|a 4. Asymptotic Analysis
|a 4.1 Basic Concepts
|a 4.1.1 Notation
|a 4.1.2 Bootstrapping
|a 4.1.3 Dissecting
|a 4.1.4 Limits of Limits
|a 4.1.5 Summary of Useful Asymptotic Expansions
|a 4.1.6 An Example from Factorization Theory
|a 4.2 Stieltjes Integration and Asymptotics
|a 4.2.1 O - notation and Integrals
|a 4.2.2 Euler's Summation Formula
|a 4.2.3 An Example from Number Theory
|a 4.3 Asymptotics from Generating Functions
|a 4.3.1 Darboux's Method
|a 4.3.2 Residue Calculus
|a 4.3.3. The Saddle Point Method
|a Bibliography
|a Appendices
|a A. Schedule of lectures, 1980
|a B. Homework Assignments
|a C. Midterm Exam I and Solutions
|a D. Final Exam II and Solutions
|a E. Midterm Exam II and Solutions
|a F. Final Exam II and Solutions
|a G. Midterm Exam III and Solutions
|a H. Final Exam III and Solutions
|a I. A Qualifying Exam Problem and Solution
|a Index
|
650 |
|
4 |
|a ALGORITHMS
|9 24371
|
650 |
|
4 |
|a COMPUTER PROGRAMMING
|9 24276
|
650 |
|
4 |
|a ΕΣΑ
|9 113671
|
700 |
1 |
|
|a Greene, Daniel H.
|4 aut
|9 114095
|
700 |
1 |
|
|a Knuth, Donald Ervin,
|d 1938-
|4 aut
|9 4458
|
760 |
0 |
|
|a Progress in computer science and applied logic
|g 1
|
852 |
|
|
|a GR-PaULI
|b ΠΑΤΡΑ
|b ΤΜΗΥΠ
|h 005.1
|t 1
|
852 |
|
|
|a GR-PaULI
|b ΠΑΤΡΑ
|b ΤΜΗΥΠ
|h 005.1
|t 2
|
942 |
|
|
|2 ddc
|
952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 005_100000000000000
|7 0
|8 NFIC
|9 123934
|a LISP
|b LISP
|c ALFe
|d 2016-04-24
|l 0
|o 005.1
|p 025000285448
|r 2016-04-24 00:00:00
|t 1
|w 2016-04-24
|y BK15
|x Μεταφορά από Τμ. Μηχανικών ΗΥ & Πληροφορικής
|
952 |
|
|
|0 0
|1 0
|2 ddc
|4 0
|6 005_100000000000000
|7 0
|8 NFIC
|9 123935
|a LISP
|b LISP
|c ALFe
|d 2016-04-24
|l 0
|o 005.1
|p 025000285452
|r 2016-04-24 00:00:00
|t 2
|w 2016-04-24
|y BK15
|x Μεταφορά από Τμ. Μηχανικών ΗΥ & Πληροφορικής
|
999 |
|
|
|c 81423
|d 81423
|