Luc's Library

Books on the analysis of algorithms

Last update: Mon Apr 15 11:08:59 EDT 2013

	Luc's library has now opened its web doors to all McGill University students. The library is in fact my office (room 300N, McConnell Engineering Building), and the books are a subset of my private collection. Any McGill student may borrow any book at any time!

Martin Aigner	Combinatorial Search John Wiley, Chichester, 1988.
Jin Akiyama Mikio Kano (eds)	Discrete and Computational Geometry JCDCG 2002 Springer-Verlag, Berlin, 2003.
Jin Akiyama Mikio Kano (eds)	Discrete and Computational Geometry JCDCG 2002 Springer-Verlag, Berlin, 2003.
D. Aldous P. Diaconis J. Spencer J.M. Steele (eds)	Discrete Probability and Algorithms Springer-Verlag, New York, 1995.
D. Aldous R. Pemantle (eds)	Random Discrete Structures Springer-Verlag, New York, 1996.
D. Aldous J. Propp (eds)	Microsurveys in Discrete Probability The American Mathematical Society, Providence, RI, 1998.
Jean-Paul Allouche Jeffrey Shallit	Automatic Sequences Theory, Applications, Generalizations Cambridge University Press, Cambridge, 2003.
N. Alon J. Spencer P. Erdös	The Probabilistic Method John Wiley, New York, 1992.
Noga Alon Joel H. Spencer	The Probabilistic Method Second Edition John Wiley, New York, 2000.
Noga Alon Joel H. Spencer	The Probabilistic Method Third Edition Wiley Interscience, Hoboken, NJ, 2008.
L. Alonso R. Schott	Random Generation of Trees Kluwer Academic Publishers, 1995.
David Applegate Gerth Stolting Brodal Daniel Panario Robert Sedgewick (eds)	Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics SIAM, Philadelphia, 2007.
Eric Bach Jeffrey Shallit	Algorithmic Number Theory, Vol. 1: Efficient Algorithms MIT Press, Cambridge, 1996.
F. Bergeron G. Labelle P. Leroux	Théorie des espèces et combinatoire des structures arborescentes LACIM, Montréal, 1994.
F. Bergeron G. Labelle P. Leroux	Combinatorial Species and Tree-like Structures Cambridge University Press, 1997.
Francine Blanchet-Sadri	Algorithmic Combinatorics on Partial Words Chapman & Hall, Boca Raton, FL, 2008.
Anthony Bonato	A Course on the Web Graph American Mathematical Society, Providence, RI, 2008.
R.B. Boppana J.F. Lynch (eds)	Logic and Random Structures The American Mathematical Society, Providence, RI, 1997.
K.H. Borgwardt	The Simplex Method---A Probabilistic Analysis Springer-Verlag, Berlin, 1987.
P. Bose P. Morin (eds)	Algorithms and Computation 13th International Symposium ISAAC 2002 Springer-Verlag, Berlin, 2002.
David M. Bressoud	Factorization and Primality Testing Springer-Verlag, New York, 1989.
Russ Bubley	Randomized Algorithms: Approximation, Generation, and Counting Springer-Verlag, London, 2001.
J.P. Buhler P. Stevenhagen	Algorithmic Number Theory MSRI / Cambridge University Press, New York, NY, 2008.
Rainer Burkard Mauro dell'Amico Silvano Martello	Assignment Problems SIAM, Philadelphia, 2009.
Philippe Chassaing (ed.)	Proceedings of the 4th Colloquium on Mathematics and Computer Science Institut Elie Cartan, Nancy, France, 2006.
B. Chauvin S. Cohen A. Rouault (eds)	Trees: Workshop in Versailles, June 14-16, 1995 Birkhäuser, 1996.
B. Chauvin P. Flajolet D. Gardy A. Mokkadem (eds)	Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities Birkhäuser, Basel, 2002.
B. Chazelle	The Discrepancy Method Cambridge University Press, Cambridge, 2000.
E.G. Coffman G.S. Lueker	Probabilistic Analysis of Packing and Partitioning Algorithms John Wiley, New York, 1991.
E.G. Coffman G.S. Lueker	Probabilistic Analysis of Packing and Partitioning Algorithms John Wiley, New York, 1991.
Maxime Crochemore Christophe Hancart Thierry Lecroq	Algorithms on Strings Cambridge University Press, Cambridge, MA, 2007.
Sanjoy Dasgupta Christos Papadimitriou Umesh Vazirani	Algorithms McGraw Hill, New York, 2008.
L. Devroye	Lecture Notes on Bucket Algorithms Birkhäuser, Boston, MA, 1986.
L. Devroye	Lecture Notes on Bucket Algorithms Birkhäuser, Boston, MA, 1986.
G. Di Battista P. Eades R. Tamassia I.G. Tollis	Graph Drawing Prentice-Hall, Upper Saddle River, NJ, 1999.
Vladimir A. Dobrushkin	Methods in Algorithmic Analysis CRC Press, Boca Raton, FL, 2010.
Michael Drmota Philippe Flajolet Danièle Gardy Bernhard Gittenberger (eds)	Mathematics and Computer Science III Algorithms, Trees, Combinatorics and Probabilities Birkhäuser, Basel, 2004.
Michael Drmota	Random Trees Springer, Vienna, 2009.
Michael Drmota Bernhard Gittenberger	Proceedings of AofA'10 Technical University of Vienna, Vienna, Austria, 2010.
Devdatt P. Dubhashi Alessandro Panconesi	Concentration of Measure for the Analysis of Randomized Algorithms Cambridge University Press, Cambridge, 2009.
Dingzhu Du Xiaodong Hu	Steiner Tree Problems in Computer Communication Networks World Scientific, 2009.
Dingzhu Du Xiaodong Hu	Steiner Tree Problems in Computer Communication Networks World Scientific, 2009.
Linda Farczadi	Connectivity for line-of-sight networks in higher dimensions 2010.
Philippe Flajolet Robert Sedgewick	Analytic Combinatorics Cambridge University Press, Cambridge, 2008.
Philippe Flajolet Robert Sedgewick	Analytic Combinatorics Cambridge University Press, Cambridge, 2008.
Nicola Galli	Search processes and their average case analysis Ph.D. dissertation, Swiss Federal Institute of Technology, Zurich, 1998.
D. Gardy A. Mokkadem (eds)	Algorithms, Trees, Combinatorics and Probabilities Birkhäuser, Basel, 2000.
D. Gardy A. Mokkadem (eds)	Algorithms, Trees, Combinatorics and Probabilities Birkhäuser, Basel, 2000.
Danièle Gardy	Bases de données, allocations aléatoires: quelques analyses de performances(thèse de doctorat) Université de Paris-Sud, Paris, 1989.
W.R. Gilks S. Richardson D.J. Spiegelhalter (eds)	Markov Chain Monte Carlo in Practice Chapman and Hall/CRC, Boca Raton, 1996.
Teofilo F. Gonzalez	Handbook of Approximation Algorithms and Metaheuristics Chapman & Hall/CRC, Boca Raton, FL, 2007.
Teofilo F. Gonzalez	Handbook of Approximation Algorithms and Metaheuristics Chapman & Hall/CRC, Boca Raton, FL, 2007.
R.L. Graham D.E. Knuth O. Patashnik	Concrete Mathematics---A Foundation for Computer Science Addison-Wesley, Reading, MA, 1989.
Dan Gusfield	Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology Cambridge University Press, New York, 1997.
M. Habib C. McDiarmid J. Ramirez-Alfonsin B. Reed (eds)	Probabilistic Methods for Algorithmic Discrete Mathematics Springer-Verlag, Berlin, 1998.
M. Habib C. McDiarmid J. Ramirez-Alfonsin B. Reed (eds)	Probabilistic Methods for Algorithmic Discrete Mathematics Springer-Verlag, Berlin, 1998.
O. Häggstr\:om	Finite Markov Chains and Algorithmic Applications Cambridge University Press, Cambridge, UK, 2002.
Israat Tanzeena Haque	Randomized Routing Algorithms in Mobile Ad Hoc Networks Verlag Dr. Müller, Saarbrücken, 2009.
Moritz Hardt	Testing Polynomial Identities with Fewer Random Bits: Can You Fool a Polynomial without Rolling Dice? VDM Verlag Dr. Müller, Saarbrücken, 2008.
Sariel Har-Peled	Geometric Approximation Algorithms American Mathematical Society, Providence, RI, 2011.
D.S. Hochbaum (ed.)	Approximation Algorithms for NP-hard Problems PWS Publishing Co, Boston, 1997.
M. Hofri	Probabilistic Analysis of Algorithms Springer-Verlag, New York, 1987.
M. Hofri	Analysis of Algorithms: Computational Methods and Mathematical Tools Oxford University Press, New York, 1995.
Cecilia Holmgren	Split Trees, Cuttings and Explosions 2010.
Juraj Hromkovic	Design and Analysis of Randomized Algorithms Springer-Verlag, Berlin, 2005.
Juraj Hromkovic	Algorithmics for Hard Problems Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (2nd ed.) Springer-Verlag, New York, 2005.
Juraj Hromkovic Richard Kralovic Marc Nunkesser Peter Widmayer (eds)	Stochastic Algorithms: Foundations and Applications: 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings Springer, Berlin, 2007.
Philippe Jacquet (ed.)	International Conferencve on Analysis of Algorithms DMTCS Proceedings Series Volume XX 2007.
Mark Jerrum	Counting, Sampling and Integrating: Algorithms and Complexity Birkhäuser, Basel, 2003.
Neil C. Jones Pavel A. Pevzner	An Introduction to Bioinformatics and Algorithms MIT Press, Cambridge, MA, 2004.
R. Kemp	Fundamentals of the Average Case Analysis of Particular Algorithms B.G.~Teubner, Stuttgart, 1984.
Peter E. Kloeden Eckhard Platen	Numerical Solution of Stochastic Differential Equations Springer, Heidelberg, 2010.
D. Knuth	The Art of Computer Programming, Vol. I, 3rd Ed. Addison-Wesley, Reading, MA, 1997.
D. Knuth	The Art of Computer Programming, Vol. II, 3rd Ed. Addison-Wesley, Reading, MA, 1997.
D. Knuth	The Art of Computer Programming, Vol. III, 2nd Ed. Addison-Wesley, Reading, MA, 1997.
D.E. Knuth	The Art of Computer Programming, Vol. 1. Fundamental Algorithms Addison-Wesley, Reading, Mass., 1968.
D.E. Knuth	The Art of Computer Programming, Vol. 2: Seminumerical Algorithms Addison-Wesley, Reading, MA, 1969.
D.E. Knuth	The Art of Computer Programming, Vol. 3: Searching and Sorting Addison-Wesley, Reading, MA, 1973.
D.E. Knuth	The Art of Computer Programming Volume 4 Fascicle 2 Addison-Wesley, Upper Saddle River, NJ, 2005.
D.E. Knuth	The Art of Computer Programming Volume 4A Combinatorial Algorithms Addison-Wesley, Westford, MA, 2011.
Donald E. Knuth	The Art of Computer Programming Volume 4 Introduction to Combinatorial Algorithms and Boolean Functions Pearson Education Inc, Upper Saddle River, NJ, 2008.
William Kocay Donald L. Kreher	Graphs, Algorithms and Optimization Chapman & Hall, Boca Raton, FL, 2005.
V.F. Kolchin B.A. Sevast'yanov V.P. Chistyakov	Random Allocations V.H. Winston and Sons, Washington, D.C., 1978.
V.F. Kolchin	Random Mappings Optimization Software Inc., New York, 1986.
L. Laforest	Etude des arbres hyperquaternaires (thèse de doctorat) McGill University, Montréal, 1990.
L. Laforest	Etude des arbres hyperquaternaires Université du Québec à Montréal, Montréal, 1990.
C. Lemaire	Triangulation de Delaunay et arbres multidimensionnels (thèse de doctorat) Université Jean Monnet, Saint-Etienne, France, 1997.
David A. Levin Yuval Peres Elizabeth L. Wilmer	Markov Chains and Mixing Times American Mathematical Society, Providence, RI, 2008.
G. Louchard G. Latouche (eds)	Probability Theory and Computer Science Academic Press, New York, 1983.
L. Lovász A. Steger M.F. Sagot Y. Wakabayashi Y. Kohayakawa V. Rödl	Brazilian Summer School on Combinatorics and Algorithms 2001.
H.M. Mahmoud	Evolution of Random Search Trees John Wiley, New York, 1992.
H.M. Mahmoud	Sorting: A Distribution Theory John Wiley, New York, 2000.
Hosam M. Mahmoud	Polya Urn Models CRC Press, Boca Raton, FL, 2009.
Jiri Matousek Bernd Gärtner	Understanding and Using Linear Programming Springer-Verlag, Berlin, 2007.
Ernst W. Mayr Hans Jürgen Prömel Angelika Steger (eds)	Lectures on Proof Verification and Approximation Algorithms Springer-Verlag, Berlin, 1998.
Dinesh P. Mehta Sartaj Sahni	Handbook of Data Structures and Applications Chapman & Hall, Boca Raton, FL, 2005.
Dinesh P. Mehta Sartaj Sahni	Handbook of Data Structures and Applications Chapman & Hall, Boca Raton, FL, 2005.
Michael Mitzenmacher Eli Upfal	Probability and Computing Randomized Algorithms and Probabilistic Analysis Cambridge University Press, Cambridge, UK, 2005.
Hanène Mohamed	Etude probabiliste d'algorithmes en arbre France, 2007.
M. Molloy B. Reed	Graph Coloring and the Probabilistic Method Springer-Verlag, Berlin, 2002.
Ravi Montenegro Prasad Tetali	Mathematical Aspects of Mixing Times in Markov Chains Now Publishers, Hanover, MA, 2006.
Rajeev Motwani Prabhakar Raghavan	Randomized Algorithms Cambridge University Press, Cambridge, MA, 1995.
K. Mulmuley	Computational Geometry: An Introduction Through Randomized Algorithms Prentice-Hall, Englewood Cliffs, NJ, 1994.
Noam Nisan T. Roughgarden E. Tardos V.J. Vazirani (eds.)	Algorithmic Game Theory Cambridge University Press, Cambridge, 2007.
Noam Nisan T. Roughgarden E. Tardos V.J. Vazirani (eds.)	Algorithmic Game Theory Cambridge University Press, Cambridge, 2007.
E.M. Palmer	Graphical Evolution John Wiley, New York, 1985.
Ian Parberrry	Problems on Algorithms Prentice Hall, 1999.
Sriram Pemmaraju Steven Skiena	Computational Discrete Mathematics Cambridge University Press, Cambridge, UK, 2003.
P.A. Pevzner	Computational Molecular Biology MIT Press, Cambridge, MA, 2000.
P.A. Pevzner	Computational Molecular Biology MIT Press, Cambridge, MA, 2000.
G. Pflug	Stochastische Modelle in der Informatik B.G.Teubner, Stuttgart, Germany, 1986.
H. Prodinger W. Szpankowski (eds)	Average-Case Analysis of Algorithms (volume 22(4) of Algorithmica) Springer-Verlag, New York, 1998.
P.W. Purdom C.A. Brown	The Analysis of Algorithms Holt, Rinehart and Winston, New York, 1985.
Sanguthevar Rajasekaran Panos M. Pardalos John H. Reif José Rolim (eds)	Handbook of Randomized Computing Volume II Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.
Sanguthevar Rajasekaran Panos M. Pardalos John H. Reif José Rolim (eds)	Handbook of Randomized Computing Volume I Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.
Bruce A. Reed Claudia Linhares-Sales (eds)	Recent Advances in Algorithmic Combinatorics Springer-Verlag, New York, 2003.
Vladimir N. Sachkov	Probabilistic Methods in Combinatorial Analysis Cambridge University Press, Cambridge, 1997.
R. Sedgewick P. Flajolet	An Introduction to the Analysis of Algorithms Addison-Wesley, Reading, MA, 1996.
R. Sedgewick P. Flajolet	An Introduction to the Analysis of Algorithms Second Edition Addison-Wesley, Westford, MA, 2013.
A. Sinclair	Randomised Algorithms for Counting and Generating Combinatorial Structures (Ph.D. dissertation) University of Edinburgh, Edinburgh, 1988.
Alistair Sinclair	Algorithms for Random Generation and Counting Birkhäuser, Boston, 1993.
J. Spencer	Ten Lectures on the Probabilistic Method SIAM Lecture Notes, Philadelphia, 1987.
Wojcieh Szpankowski	Average Case Analysis of Algorithms on Sequences Wiley, New York, 2001.
K.S. Trivedi	Probability and Statistics, with Reliability, Queuing, and Computer Science Applications Prentice Hall, Englewood Cliffs, NJ, 1982.
K.S. Trivedi	Probability and Statistics, with Reliability, Queuing, and Computer Science Applications John Wiley, New York, 2002.
K.S. Trivedi	Probability and Statistics, with Reliability, Queuing, and Computer Science Applications John Wiley, New York, 2002.
J. Van Leeuwen (ed)	Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity Elsevier Science and MIT Press, Cambridge, MA, 1990.
Vijay V. Vazirani	Approximation Algorithms Springer-Verlag, Heidelberg, 2001.
Vijay V. Vazirani	Approximation Algorithms Springer-Verlag, Heidelberg, 2001.
Santosh S. Vempala	The Random Projection Method American Mathematical Society, Providence, RI, 2004.
J.S. Vitter W.-C. Chen	Design and Analysis of Coalesced Hashing Oxford University Press, New York, 1986.
Joachim von zur Gathen Jürgen Gerhard	Modern Computer Algebra Cambridge University Press, Cambridge, 2003.
Osamu Watanabe Thomas Zeugmann (eds)	Stochastic Algorithms: Foundations and Applications Springer, 2009.
I. Wegener	Branching Programs and Binary Decision Diagrams SIAM, Philadelphia, 2000.
David P. Williamson David B. Schmoys	The Design of Approximation Algorithms Cambridge University Press, Cambridge, 2011.
Chee Keng Yap	Fundamental Problems of Algorithmic Algebra Oxford University Press, New York, 2000.
Elahe Zohoorianazad	Comportement asymptotique des mots aléatoires et des arbres aléatoires France, 2007.

Contact

Luc Devroye
School of Computer Science
McGill University
Montreal, Canada H3A 2K6
lucdevroye@gmail.com
http://cg.scs.carleton.ca/~luc