Books on the analysis of algorithms

Last update: Fri Jun 30 16:18:37 EDT 2017


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 [Google]
John Wiley, Chichester, 1988.

Jin Akiyama
Mikio Kano (eds)

Discrete and Computational Geometry JCDCG 2002 [Google]
Springer-Verlag, Berlin, 2003.

Jin Akiyama
Mikio Kano (eds)

Discrete and Computational Geometry JCDCG 2002 [Google]
Springer-Verlag, Berlin, 2003.

D. Aldous
P. Diaconis
J. Spencer
J.M. Steele (eds)

Discrete Probability and Algorithms [Google]
Springer-Verlag, New York, 1995.

D. Aldous
R. Pemantle (eds)

Random Discrete Structures [Google]
Springer-Verlag, New York, 1996.

D. Aldous
J. Propp (eds)

Microsurveys in Discrete Probability [Google]
The American Mathematical Society, Providence, RI, 1998.

Jean-Paul Allouche
Jeffrey Shallit

Automatic Sequences Theory, Applications, Generalizations [Google]
Cambridge University Press, Cambridge, 2003.

N. Alon
J. Spencer
P. Erdös

The Probabilistic Method [Google]
John Wiley, New York, 1992.

Noga Alon
Joel H. Spencer

The Probabilistic Method Second Edition [Google]
John Wiley, New York, 2000.

Noga Alon
Joel H. Spencer

The Probabilistic Method Third Edition [Google]
Wiley Interscience, Hoboken, NJ, 2008.

Noga Alon
Joel H. Spencer

The Probabilistic Method Fourth Edition [Google]
Wiley Interscience, Hoboken, NJ, 2016.

L. Alonso
R. Schott

Random Generation of Trees [Google]
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 [Google]
SIAM, Philadelphia, 2007.

Eric Bach
Jeffrey Shallit

Algorithmic Number Theory, Vol. 1: Efficient Algorithms [Google]
MIT Press, Cambridge, 1996.

F. Bergeron
G. Labelle
P. Leroux

Théorie des espèces et combinatoire des structures arborescentes [Google]
LACIM, Montréal, 1994.

F. Bergeron
G. Labelle
P. Leroux

Combinatorial Species and Tree-like Structures [Google]
Cambridge University Press, 1997.

Francine Blanchet-Sadri

Algorithmic Combinatorics on Partial Words [Google]
Chapman & Hall, Boca Raton, FL, 2008.

Anthony Bonato

A Course on the Web Graph [Google]
American Mathematical Society, Providence, RI, 2008.

R.B. Boppana
J.F. Lynch (eds)

Logic and Random Structures [Google]
The American Mathematical Society, Providence, RI, 1997.

K.H. Borgwardt

The Simplex Method---A Probabilistic Analysis [Google]
Springer-Verlag, Berlin, 1987.

P. Bose
P. Morin (eds)

Algorithms and Computation 13th International Symposium ISAAC 2002 [Google]
Springer-Verlag, Berlin, 2002.

David M. Bressoud

Factorization and Primality Testing [Google]
Springer-Verlag, New York, 1989.

Russ Bubley

Randomized Algorithms: Approximation, Generation, and Counting [Google]
Springer-Verlag, London, 2001.

J.P. Buhler
P. Stevenhagen

Algorithmic Number Theory [Google]
MSRI / Cambridge University Press, New York, NY, 2008.

Rainer Burkard
Mauro dell'Amico
Silvano Martello

Assignment Problems [Google]
SIAM, Philadelphia, 2009.

Philippe Chassaing (ed.)

Proceedings of the 4th Colloquium on Mathematics and Computer Science [Google]
Institut Elie Cartan, Nancy, France, 2006.

B. Chauvin
S. Cohen
A. Rouault (eds)

Trees: Workshop in Versailles, June 14-16, 1995 [Google]
Birkhäuser, 1996.

B. Chauvin
P. Flajolet
D. Gardy
A. Mokkadem (eds)

Mathematics and Computer Science II Algorithms, Trees, Combinatorics and Probabilities [Google]
Birkhäuser, Basel, 2002.

B. Chazelle

The Discrepancy Method [Google]
Cambridge University Press, Cambridge, 2000.

E.G. Coffman
G.S. Lueker

Probabilistic Analysis of Packing and Partitioning Algorithms [Google]
John Wiley, New York, 1991.

E.G. Coffman
G.S. Lueker

Probabilistic Analysis of Packing and Partitioning Algorithms [Google]
John Wiley, New York, 1991.

Maxime Crochemore
Christophe Hancart
Thierry Lecroq

Algorithms on Strings [Google]
Cambridge University Press, Cambridge, MA, 2007.

Sanjoy Dasgupta
Christos Papadimitriou
Umesh Vazirani

Algorithms [Google]
McGraw Hill, New York, 2008.

L. Devroye

Lecture Notes on Bucket Algorithms [Google]
Birkhäuser, Boston, MA, 1986.

L. Devroye

Lecture Notes on Bucket Algorithms [Google]
Birkhäuser, Boston, MA, 1986.

G. Di Battista
P. Eades
R. Tamassia
I.G. Tollis

Graph Drawing [Google]
Prentice-Hall, Upper Saddle River, NJ, 1999.

Vladimir A. Dobrushkin

Methods in Algorithmic Analysis [Google]
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 [Google]
Birkhäuser, Basel, 2004.

Michael Drmota

Random Trees [Google]
Springer, Vienna, 2009.

Michael Drmota
Bernhard Gittenberger

Proceedings of AofA'10 [Google]
Technical University of Vienna, Vienna, Austria, 2010.

Devdatt P. Dubhashi
Alessandro Panconesi

Concentration of Measure for the Analysis of Randomized Algorithms [Google]
Cambridge University Press, Cambridge, 2009.

Devdatt P. Dubhashi
Alessandro Panconesi

Concentration of Measure for the Analysis of Randomized Algorithms [Google]
Cambridge University Press, Cambridge, 2009.

Dingzhu Du
Xiaodong Hu

Steiner Tree Problems in Computer Communication Networks [Google]
World Scientific, 2009.

Dingzhu Du
Xiaodong Hu

Steiner Tree Problems in Computer Communication Networks [Google]
World Scientific, 2009.

Joel Spencer (ed)

Paul Erdös The Art of Counting Selected Writings [Google]
MIT Press, Cambridge, MA, 1992.

Ming-Yang Kao (Ed.)

Encyclopedia of Algorithms Volume 1 [Google]
Springer, New York, 2008.

Ming-Yang Kao (Ed.)

Encyclopedia of Algorithms Volume 2 [Google]
Springer, New York, 2008.

Paul Erdös
Joel Spencer

Probabilistic Methods in Combinatorics [Google]
Academic Press, New York, 1974.

Linda Farczadi

Connectivity for line-of-sight networks in higher dimensions [Google]
2010.

Philippe Flajolet
Robert Sedgewick

Analytic Combinatorics [Google]
Cambridge University Press, Cambridge, 2008.

Philippe Flajolet
Robert Sedgewick

Analytic Combinatorics [Google]
Cambridge University Press, Cambridge, 2008.

Alan Frieze
Michal Karonski

Introduction to Random Graphs [Google]
Cambridge University Press, Cambridge, 2016.

Nicola Galli

Search processes and their average case analysis [Google]
Ph.D. dissertation, Swiss Federal Institute of Technology, Zurich, 1998.

D. Gardy
A. Mokkadem (eds)

Algorithms, Trees, Combinatorics and Probabilities [Google]
Birkhäuser, Basel, 2000.

D. Gardy
A. Mokkadem (eds)

Algorithms, Trees, Combinatorics and Probabilities [Google]
Birkhäuser, Basel, 2000.

Danièle Gardy

Bases de données, allocations aléatoires: quelques analyses de performances(thèse de doctorat) [Google]
Université de Paris-Sud, Paris, 1989.

Bernd Gärtner
Jiri Matousek

Approximation Algorithms and Semidefinite Programming [Google]
Springer, Berlin Heidelberg, 2012.

W.R. Gilks
S. Richardson
D.J. Spiegelhalter (eds)

Markov Chain Monte Carlo in Practice [Google]
Chapman and Hall/CRC, Boca Raton, 1996.

Teofilo F. Gonzalez

Handbook of Approximation Algorithms and Metaheuristics [Google]
Chapman & Hall/CRC, Boca Raton, FL, 2007.

Teofilo F. Gonzalez

Handbook of Approximation Algorithms and Metaheuristics [Google]
Chapman & Hall/CRC, Boca Raton, FL, 2007.

R.L. Graham
D.E. Knuth
O. Patashnik

Concrete Mathematics---A Foundation for Computer Science [Google]
Addison-Wesley, Reading, MA, 1989.

Dan Gusfield

Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology [Google]
Cambridge University Press, New York, 1997.

M. Habib
C. McDiarmid
J. Ramirez-Alfonsin
B. Reed (eds)

Probabilistic Methods for Algorithmic Discrete Mathematics [Google]
Springer-Verlag, Berlin, 1998.

M. Habib
C. McDiarmid
J. Ramirez-Alfonsin
B. Reed (eds)

Probabilistic Methods for Algorithmic Discrete Mathematics [Google]
Springer-Verlag, Berlin, 1998.

Martin Haenggi

Stochastic Geometry for Wireless Networks [Google]
Cambridge University Press, Cambridge, UK, 2013.

O. Häggstr\:om

Finite Markov Chains and Algorithmic Applications [Google]
Cambridge University Press, Cambridge, UK, 2002.

Israat Tanzeena Haque

Randomized Routing Algorithms in Mobile Ad Hoc Networks [Google]
Verlag Dr. Müller, Saarbrücken, 2009.

Moritz Hardt

Testing Polynomial Identities with Fewer Random Bits: Can You Fool a Polynomial without Rolling Dice? [Google]
VDM Verlag Dr. Müller, Saarbrücken, 2008.

Sariel Har-Peled

Geometric Approximation Algorithms [Google]
American Mathematical Society, Providence, RI, 2011.

D.S. Hochbaum (ed.)

Approximation Algorithms for NP-hard Problems [Google]
PWS Publishing Co, Boston, 1997.

M. Hofri

Probabilistic Analysis of Algorithms [Google]
Springer-Verlag, New York, 1987.

M. Hofri

Analysis of Algorithms: Computational Methods and Mathematical Tools [Google]
Oxford University Press, New York, 1995.

Cecilia Holmgren

Split Trees, Cuttings and Explosions [Google]
2010.

Juraj Hromkovic

Design and Analysis of Randomized Algorithms [Google]
Springer-Verlag, Berlin, 2005.

Juraj Hromkovic

Algorithmics for Hard Problems Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics (2nd ed.) [Google]
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 [Google]
Springer, Berlin, 2007.

Eyal Hushilevitz
Noam Nisan

Communication Complexity [Google]
Cambridge University Press, Cambridge, 1997.

Philippe Jacquet (ed.)

International Conferencve on Analysis of Algorithms DMTCS Proceedings Series Volume XX [Google]
2007.

Philippe Jacquet
Wojciech Szpankowski

Analytic Pattern Matching: From DNA to Twitter [Google]
Cambridge University Press, Cambridge, 2015.

Philippe Jacquet
Wojciech Szpankowski

Analytic Pattern Matching: From DNA to Twitter [Google]
Cambridge University Press, Cambridge, 2015.

Mark Jerrum

Counting, Sampling and Integrating: Algorithms and Complexity [Google]
Birkhäuser, Basel, 2003.

Neil C. Jones
Pavel A. Pevzner

An Introduction to Bioinformatics and Algorithms [Google]
MIT Press, Cambridge, MA, 2004.

R. Kemp

Fundamentals of the Average Case Analysis of Particular Algorithms [Google]
B.G.~Teubner, Stuttgart, 1984.

Peter E. Kloeden
Eckhard Platen

Numerical Solution of Stochastic Differential Equations [Google]
Springer, Heidelberg, 2010.

D. Knuth

The Art of Computer Programming, Vol. I, 3rd Ed. [Google]
Addison-Wesley, Reading, MA, 1997.

D. Knuth

The Art of Computer Programming, Vol. II, 3rd Ed. [Google]
Addison-Wesley, Reading, MA, 1997.

D. Knuth

The Art of Computer Programming, Vol. III, 2nd Ed. [Google]
Addison-Wesley, Reading, MA, 1997.

D.E. Knuth

The Art of Computer Programming, Vol. 1. Fundamental Algorithms [Google]
Addison-Wesley, Reading, Mass., 1968.

D.E. Knuth

The Art of Computer Programming, Vol. 2: Seminumerical Algorithms [Google]
Addison-Wesley, Reading, MA, 1969.

D.E. Knuth

The Art of Computer Programming, Vol. 3: Searching and Sorting [Google]
Addison-Wesley, Reading, MA, 1973.

D.E. Knuth

The Art of Computer Programming Volume 4 Fascicle 2 [Google]
Addison-Wesley, Upper Saddle River, NJ, 2005.

D.E. Knuth

The Art of Computer Programming Volume 4A Combinatorial Algorithms [Google]
Addison-Wesley, Westford, MA, 2011.

Donald E. Knuth

The Art of Computer Programming Volume 4 Introduction to Combinatorial Algorithms and Boolean Functions [Google]
Pearson Education Inc, Upper Saddle River, NJ, 2008.

William Kocay
Donald L. Kreher

Graphs, Algorithms and Optimization [Google]
Chapman & Hall, Boca Raton, FL, 2005.

V.F. Kolchin
B.A. Sevast'yanov
V.P. Chistyakov

Random Allocations [Google]
V.H. Winston and Sons, Washington, D.C., 1978.

V.F. Kolchin

Random Mappings [Google]
Optimization Software Inc., New York, 1986.

L. Laforest

Etude des arbres hyperquaternaires (thèse de doctorat) [Google]
McGill University, Montréal, 1990.

L. Laforest

Etude des arbres hyperquaternaires [Google]
Université du Québec à Montréal, Montréal, 1990.

C. Lemaire

Triangulation de Delaunay et arbres multidimensionnels (thèse de doctorat) [Google]
Université Jean Monnet, Saint-Etienne, France, 1997.

David A. Levin
Yuval Peres
Elizabeth L. Wilmer

Markov Chains and Mixing Times [Google]
American Mathematical Society, Providence, RI, 2008.

G. Louchard
G. Latouche (eds)

Probability Theory and Computer Science [Google]
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 [Google]
2001.

H.M. Mahmoud

Evolution of Random Search Trees [Google]
John Wiley, New York, 1992.

H.M. Mahmoud

Sorting: A Distribution Theory [Google]
John Wiley, New York, 2000.

Hosam M. Mahmoud

Polya Urn Models [Google]
CRC Press, Boca Raton, FL, 2009.

Jiri Matousek
Bernd Gärtner

Understanding and Using Linear Programming [Google]
Springer-Verlag, Berlin, 2007.

Ernst W. Mayr
Hans Jürgen Prömel
Angelika Steger (eds)

Lectures on Proof Verification and Approximation Algorithms [Google]
Springer-Verlag, Berlin, 1998.

Dinesh P. Mehta
Sartaj Sahni

Handbook of Data Structures and Applications [Google]
Chapman & Hall, Boca Raton, FL, 2005.

Dinesh P. Mehta
Sartaj Sahni

Handbook of Data Structures and Applications [Google]
Chapman & Hall, Boca Raton, FL, 2005.

Michael Mitzenmacher
Eli Upfal

Probability and Computing Randomized Algorithms and Probabilistic Analysis [Google]
Cambridge University Press, Cambridge, UK, 2005.

Hanène Mohamed

Etude probabiliste d'algorithmes en arbre [Google]
France, 2007.

M. Molloy
B. Reed

Graph Coloring and the Probabilistic Method [Google]
Springer-Verlag, Berlin, 2002.

Ravi Montenegro
Prasad Tetali

Mathematical Aspects of Mixing Times in Markov Chains [Google]
Now Publishers, Hanover, MA, 2006.

Rajeev Motwani
Prabhakar Raghavan

Randomized Algorithms [Google]
Cambridge University Press, Cambridge, MA, 1995.

K. Mulmuley

Computational Geometry: An Introduction Through Randomized Algorithms [Google]
Prentice-Hall, Englewood Cliffs, NJ, 1994.

Noam Nisan
T. Roughgarden
E. Tardos
V.J. Vazirani (eds.)

Algorithmic Game Theory [Google]
Cambridge University Press, Cambridge, 2007.

Noam Nisan
T. Roughgarden
E. Tardos
V.J. Vazirani (eds.)

Algorithmic Game Theory [Google]
Cambridge University Press, Cambridge, 2007.

E.M. Palmer

Graphical Evolution [Google]
John Wiley, New York, 1985.

Ian Parberrry

Problems on Algorithms [Google]
Prentice Hall, 1999.

Sriram Pemmaraju
Steven Skiena

Computational Discrete Mathematics [Google]
Cambridge University Press, Cambridge, UK, 2003.

P.A. Pevzner

Computational Molecular Biology [Google]
MIT Press, Cambridge, MA, 2000.

P.A. Pevzner

Computational Molecular Biology [Google]
MIT Press, Cambridge, MA, 2000.

G. Pflug

Stochastische Modelle in der Informatik [Google]
B.G.Teubner, Stuttgart, Germany, 1986.

H. Prodinger
W. Szpankowski (eds)

Average-Case Analysis of Algorithms (volume 22(4) of Algorithmica) [Google]
Springer-Verlag, New York, 1998.

Paul Walton Purdom
Cynthia A. Brown

The Analysis of Algorithms [Google]
Holt, Rinehart and Winston, New York, 1985.

Paul Walton Purdom
Cynthia A. Brown

The Analysis of Algorithms [Google]
Holt, Rinehart and Winston, New York, 1985.

Sanguthevar Rajasekaran
Panos M. Pardalos
John H. Reif
José Rolim (eds)

Handbook of Randomized Computing Volume II [Google]
Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.

Sanguthevar Rajasekaran
Panos M. Pardalos
John H. Reif
José Rolim (eds)

Handbook of Randomized Computing Volume I [Google]
Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001.

Bruce A. Reed
Claudia Linhares-Sales (eds)

Recent Advances in Algorithmic Combinatorics [Google]
Springer-Verlag, New York, 2003.

Vladimir N. Sachkov

Probabilistic Methods in Combinatorial Analysis [Google]
Cambridge University Press, Cambridge, 1997.

R. Sedgewick
P. Flajolet

An Introduction to the Analysis of Algorithms [Google]
Addison-Wesley, Reading, MA, 1996.

R. Sedgewick
P. Flajolet

An Introduction to the Analysis of Algorithms Second Edition [Google]
Addison-Wesley, Westford, MA, 2013.

A. Sinclair

Randomised Algorithms for Counting and Generating Combinatorial Structures (Ph.D. dissertation) [Google]
University of Edinburgh, Edinburgh, 1988.

Alistair Sinclair

Algorithms for Random Generation and Counting [Google]
Birkhäuser, Boston, 1993.

J. Spencer

Ten Lectures on the Probabilistic Method [Google]
SIAM Lecture Notes, Philadelphia, 1987.

Wojcieh Szpankowski

Average Case Analysis of Algorithms on Sequences [Google]
Wiley, New York, 2001.

K.S. Trivedi

Probability and Statistics, with Reliability, Queuing, and Computer Science Applications [Google]
Prentice Hall, Englewood Cliffs, NJ, 1982.

K.S. Trivedi

Probability and Statistics, with Reliability, Queuing, and Computer Science Applications [Google]
John Wiley, New York, 2002.

K.S. Trivedi

Probability and Statistics, with Reliability, Queuing, and Computer Science Applications [Google]
John Wiley, New York, 2002.

J. Van Leeuwen (ed)

Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity [Google]
Elsevier Science and MIT Press, Cambridge, MA, 1990.

Vijay V. Vazirani

Approximation Algorithms [Google]
Springer-Verlag, Heidelberg, 2001.

Vijay V. Vazirani

Approximation Algorithms [Google]
Springer-Verlag, Heidelberg, 2001.

Santosh S. Vempala

The Random Projection Method [Google]
American Mathematical Society, Providence, RI, 2004.

J.S. Vitter
W.-C. Chen

Design and Analysis of Coalesced Hashing [Google]
Oxford University Press, New York, 1986.

Joachim von zur Gathen
Jürgen Gerhard

Modern Computer Algebra [Google]
Cambridge University Press, Cambridge, 2003.

Osamu Watanabe
Thomas Zeugmann (eds)

Stochastic Algorithms: Foundations and Applications [Google]
Springer, 2009.

I. Wegener

Branching Programs and Binary Decision Diagrams [Google]
SIAM, Philadelphia, 2000.

David P. Williamson
David B. Schmoys

The Design of Approximation Algorithms [Google]
Cambridge University Press, Cambridge, 2011.

Chee Keng Yap

Fundamental Problems of Algorithmic Algebra [Google]
Oxford University Press, New York, 2000.

Elahe Zohoorianazad

Comportement asymptotique des mots aléatoires et des arbres aléatoires [Google]
France, 2007.



Contact

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