A note on alternating sums

Electronic Journal of Combinatorics

Volumn 3, Issue 2 R, 1996, Pages 1-10

  Kirschenhofer, Peter ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002179571     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. Ph. Flajolet. Approximate counting: a detailed analysis. BIT 25(1985), 113-134.
2. Ph. Flajolet and R. Sedgewick. Digital search trees revisited. SIAM J. Comput. 15(1986), 748-767.
3. Ph. Flajolet and R. Sedgewick. Mellin transforms and asymptotics: Finite differences and Rice's integrals. Theoretical Computer Science, 1995. To appear.
4. I. Goulden and D. Jackson. Combinatorial Enumeration. J. Wiley, 1983.
5. R.L. Graham, D.E. Knuth and O. Patashnik. Concrete Mathematics, 2nd Edition. Addison Wesley, 1994.
6. P. Henrici. Applied and Computational Complex Analysis, Vol.1. J. Wiley, 1988.
7. D. E. Knuth. The Art of Computer Programming, Vol.3. Addison Wesley, 1973.
8. P. Kirschenhofer and H. Prodinger. Approximate counting: an alternative approach. Informatique théorique et Appl. 25(1991), 43-48.
9. P. Kirschenhofer and H. Prodinger. The path length of random skip lists. Acta Informatica 31(1994), 775-792.
10. P. Kirschenhofer, H. Prodinger and W. Szpankowski. Digital search trees again revisited: the internal path length perspective. SIAM J. Comput. 23(1994), 598-616.
11. R. Morris. Counting large numbers of events in small registers. Comm. A.C.M. 21(1978), 840-842.
12. N. E. Nörlund. Vorlesungen über Differenzenrechnung. Chelsea, 1954.
13. H. Prodinger. Combinatorics of geometrically distributed random variables: Left-to-right maxima. Discrete Mathematics, 1995. To appear.
14. H. Prodinger. Approximate Counting via Euler Transform. Mathematica Slovaca. To appear.