Methods in Algorithmic Analysis

Bibliography

[1] Abramowitz, Milton and Stegun, Irene A., Handbook of Mathematical Functions.

Dover, New York, 1974.

[2] Adel’son-Vel’skii, G. M. and Landis, E. M., An algorithm for the organization of infor-

mation, Soviet Mathematics Doklady, 3, 1259 – 1263, 1962.

[3] Aldous, David J. Probability Approximations via the Poisson Clumping H euristic.

Springer-Verlag, New York, 1989.

[4] Aldous, D. and Diaconis, P., Shuffling cards and stopping times,

The American Mathe-

matical Monthly

, 93, No. 5, 333 – 348, 1986.

[5] Aldous,, D., Flannery,, B., and Palacios, J. L., Two applications of urn processes — the

fringe analysis of search trees and the simulation of quasi-stationary distributions of

Markov chains. Probability in Engineering and and Informational Sciences, 2, 293 –

307, 1988.

[6] Andrews, George E., The Theory of Partitions.

Encyclopedia of Mathematics and its

Applications

, Vol. 2. Addison-Wesley, Reading, MA, 1976.

[7] Apostol, Tom M., An elementary view of Euler’s summation formula, The American

Mathematical Monthly, 106, N o. 5, 409 – 418, 1999.

[8] Apostol, Tom M. and Mnatsakanian, Mamikon A., Surprisingly accurate rational ap-

proximations, Mathematics M agazine, 75, No. 4, 307–310, 2002.

[9] Arden, D. N., Delayed Logic and Finite State Machine, In

Theory of Computing Ma-

chine Design

, 1 – 33, University of Michigan Press, Ann Arbor, 1960.

[10] Atallah, Mikhail J., (Editor), Algorithms and Theory of Computation Handbook, CRC

Press, Boca Raton, FL, 1998.

[11] Avidon, Michael, Mabry, Richard, and Sisson, Paul, Enumerating row arrangements of

three species, Mathematics Magazine, 74, No. 2, 130 – 134, 2001.

773

774

Bibliography

[12] Bailey, David H. , Borwein, Jonathan M ., and Girgensohn, Roland, Experimental eval-

uation of Euler sums, Experimental Mathematics, 3, No. 1 17 – 30 (1994)

[13] Bailey, Herb, M onty Hall uses a mixed strategy, Mathematics Magazine, 73, No. 2, 135

– 141 (2000).

[14] Bender, Edward A., Asymptotic methods in enumeration, SIAM Review, 16, No. 4, 485

– 515, 1974.

[15] Bender, Edward A. and Williamson, S. Gill, Foundations of Applied Combinatorics,

Dover, New York, 2007.

[16] Bentley, J. L., The whys and wherefores of algorithm design. In Proceedings of the 11th

International Conference on Computer Science and Statistics: The Interface, 1978.

[17] Berry, Donald A., Statistics, a Bayesian Perspective. Duxbury Press, Pacific Grove, CA,

1995.

[18] Birkhoff, G. D. and Trjitzinsky, W. J., Analytic theory of singular difference equations,

Acta Mathematica, 60, No. 1-2, 1 – 89, 1932.

[19] Blom, Gunnar and Thorburn, Daniel, H ow many random digits are required until given

sequences are obtained?, Journal of Applied Probability, 19, 518 – 531, 1982.

[20] Boneh, Arnon and Hofri, M., The coupon-collector problem revisited—a survey of en-

gineering problems and computational methods, Stochastic Models, 13, No. 1, 39–66,

1997.

[21] Brawner, J. N., D inner, dancing, and tennis, anyone? Mathematics Magazine, 74,

No. 1, 29 – 36, 2000.

[22] Borwein, Jonathan M., Borwein, Peter B. and Dilcher, K., Pi, Euler numbers, and

asymptotic expansions,

The American Mathematical Monthly

, 96, N o. 8 681 – 687

(1989).

[23] Borwein, Jonathan M., Calkin, Neil J. and Manna, Dante, E uler-Boole summation re-

visited,

The American Mathematical Monthly

, 116 No. 5, 387 – 412 (2009)

[24] de Bruijn, N. G., Asymptotic Methods in Analysis. Dover, New York, 1981.

[25] Callan, David, Pair them up! A visual approach to the Chung-Feller theorem, The

College Mathematics Journal, 26, No. 3, 196 – 198, 1995.

[26] Charalambides, C. A., Enumerative Combinatorics. CRC Press, Boca Raton, FL, 2002.

[27] Chebyshev, P. L., Sur deux th´eor`emes relatifs aux probabilit´es, Acta Mathematica, 14,

305 – 315, 1890.