Books on algorithms and data structures

Last update: Mon Apr 15 11:08:55 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!



ACM

Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1991.

ACM

Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1992.

ACM

Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1993.

ACM

Proceedings of the 26th Annual ACM Symposium on the Theory of Computing
ACM Press, New York, 1994.

ACM

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1994.

ACM

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1994.

ACM

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1995.

ACM

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 1999.

ACM

Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms
Association for Computing Machinery, New York, 2001.

A. V. Aho
J. E. Hopcroft
J. D. Ullman

The Design and Analysis of Computer Algorithms
Addison-Wesley, Reading, MA, 1975.

A.V. Aho
J.E. Hopcroft
J.D. Ullman

Data Structures and Algorithms
Addison-Wesley, Reading, MA, 1983.

R.K. Ahuja
T.L. Magnanti
J.B. Orlin

Network Flows: Theory, Algorithms and Applications
Prentice Hall, Englewood Cliffs, NJ, 1993.

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.

Jean-Paul Allouche
Jeffrey Shallit

Automatic Sequences Theory, Applications, Generalizations
Cambridge University Press, Cambridge, 2003.

L. Ammeraal

Algorithms and Data Structures in C++
John Wiley, Chichester, 1996.

W. Amsbury

Data Structures: From Arrays to Priority Queues
Wadsworth, Belmont, CA, 1985.

S. Anderson-Freed

Solutions Manual for Horowitz and Sahni: Fundamentals of Data Structures in Pascal, 3d ed
Computer Science Press, New York, 1991.

S. Anderson-Freed

Solutions Manual for Horowitz and Sahni: Fundamentals of Data Structures in Pascal, 3d ed
Computer Science Press, New York, 1991.

David L. Applegate
Robert E. Bixby
Vasek Chvátal
William J. Cook

The Traveling Salesman Problem: A Computational Study
Princeton University Press, Princeton, NJ, 2006.

Jacques Arsac

Jeux et casse-t\^ete à programmer
Dunod, Paris, 1985.

M.J. Atallah (ed)

Algorithms and Theory of Computation Handbook
CRC Press, Boca Raton, FL, 1999.

M.J. Atallah (ed)

Algorithms and Theory of Computation Handbook
CRC Press, Boca Raton, FL, 1999.

G. Ausiello
M. Dezani-Ciancaglini
S. Ronchi della Rocca (eds)

Automata, Languages and Programming: 16th ICALP
Springer-Verlag, Berlin, 1989.

S. Baase

Computer Algorithms: Introduction to Design and Analysis
Addison-Wesley, Reading, MA, 1978.

Eric Bach
Jeffrey Shallit

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

J.P. Barthélemy
A. Guénoche

Les arbres et les représentations des proximités
Masson, Paris, 1987.

J. Beidler

An Introduction to Data Structures
Allyn and Bacon, Boston, 1982.

R. Bellman
S. Dreyfus

Applied Dynamic Programming
Princeton University Press, Princeton, NJ, 1962.

R. Bellman
K.L. Cooke
J.A. Lockett

Algorithms, Graphs and Computers
Academic Press, New York, 1970.

J. Bergin

Data Abstraction The Object-Oriented Approach Using C++
McGraw-Hill, New York, 1994.

P. Bose
P. Morin (eds)

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

G. Brassard
P. Bratley

Algorithmique: Conception et Analyse
Masson, Paris, 1987.

G. Brassard
P. Bratley

Algorithmics, Theory and Practice
Prentice-Hall, Englewood Cliffs, NJ, 1988.

G. Brassard
P. Bratley

Fundamentals of Algorithmics
Prentice-Hall, Englewood Cliffs, NJ, 1996.

Peter Brass

Advanced Data Structures
Cambridge University Press, New York, NY, 2008.

J.D. Brown
R.L. Kruse
S.A. Matheson

Solutions to Exercises and Projects to accompany Data Structures and Program Design (2nd ed)
Prentice-Hall, Englewood Cliffs, NJ, 1987.

M.R. Brown

The Analysis of a Practical and Nearly Optimal Priority Queue
Garland Publishing Company, New York, 1980.

Russ Bubley

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

Rainer Burkard
Mauro dell'Amico
Silvano Martello

Assignment Problems
SIAM, Philadelphia, 2009.

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

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

B. Chazelle

The Discrepancy Method
Cambridge University Press, Cambridge, 2000.

Henri Cohen

Advanced Topics in Computational Number Theory
Springer-Verlag, New York, 1999.

T. H. Cormen
C. E. Leiserson
R. L. Rivest

Introduction to Algorithms
MIT Press, New York, 1990.

T. H. Cormen
C. E. Leiserson
R. L. Rivest

Introduction to Algorithms
MIT Press, New York, 1990.

T. H. Cormen
C. E. Leiserson
R. L. Rivest
C. Stein

Introduction to Algorithms Second Edition
MIT Press, Cambridge, MA, 2001.

T. H. Cormen
C. E. Leiserson
R. L. Rivest
C. Stein

Introduction to Algorithms Third Edition
MIT Press, Cambridge, MA, 2009.

D. Cox
J. Little
D. O'Shea

Ideals, Varieties, and Algorithms
Springer-Verlag, 1992.

D. Cox
J. Little
D. O'Shea

Ideals, Varieties, and Algorithms
Springer-Verlag, 1992.

M. Crochemore
W. Rytter

Text Algorithms
Oxford University Press, New York, 1994.

Maxime Crochemore
Wojcieh Rytter

Jewels of Stringology Text Algorithms
World Scientific, Singapore, 2003.

Maxime Crochemore
Christophe Hancart
Thierry Lecroq

Algorithms on Strings
Cambridge University Press, Cambridge, MA, 2007.

N. Dale
H.M. Walker

Abstract Data Types
D.C. Heath and Company, Lexington, MA, 1996.

N. Dale
H.M. Walker

Abstract Data Types
D.C. Heath and Company, Lexington, MA, 1996.

F. Dehne
J.-R. Sack
N. Santoro (eds)

Algorithms and Data Structures
Springer-Verlag, Berlin, 1989.

L. Devroye

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

L. Devroye

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

Peter Drake

Data Structures and Algorithms in Java
Pearson, Upper Saddle River, NJ, 2006.

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.

R. Durbin
S. Eddy
A. Krogh
G. Mitchison

Biological Sequence Analysis Probabilistic Models of Proteins and Nucleic Acids
Cambridge University Press, Cambridge, UK, 1998.

M. Elson

Data Structures
Science Research Associates, Chicago, 1975.

S. Even

Algorithmic Combinatorics
Macmillan, New York, 1973.

M.C. Gaudel
M. Soria
C. Froidevaux

Types de Données et Algorithmes Volume I
INRIA, Rocquencourt, France, 1990.

M.C. Gaudel
M. Soria
C. Froidevaux

Types de Données et Algorithmes Volume II
INRIA, Rocquencourt, France, 1990.

J.L. Gersting

Instructor's Manual to accompany Mathematical Structures for Computer Science (3rd ed)
Computer Science Press, New York, 1993.

J.L. Gersting

Mathematical Structures for Computer Science (3rd ed)
Computer Science Press, New York, 1993.

A. Gibbons

Algorithmic Graph Theory
Cambridge University Press, Cambridge, 1988.

S. Gill Williamson

Combinatorics of Computer Science
Computer Science Press, Rockville, MD, 1985.

G.H. Gonnet

A Handbook of Algorithms and Data Structures
Addison-Wesley, Reading, MA, 1984.

G.H. Gonnet
R. Baeza-Yates

Handbook of Algorithms and Data Structures
Addison-Wesley, Workingham, 1991.

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.

M.T. Goodrich
R. Tamassia

Data Structures and Algorithms in JAVA
John Wiley, New York, 1998.

M.T. Goodrich
R. Tamassia

Data Structures and Algorithms in JAVA
John Wiley, New York, 1998.

M.T. Goodrich
R. Tamassia

Data Structures and Algorithms in JAVA (third edition)
John Wiley, New York, 2004.

M.T. Goodrich
R. Tamassia

Data Structures and Algorithms in JAVA (fifth edition)
John Wiley, New York, 2010.

M. Grötschel
L. Lovász
A. Schrijver

Geometric Algorithms and Combinatorial Optimization
Springer-Verlag, New York, 1988.

Jozef Gruska

Foundations of Computing
International Thomson Computer Press, London, 1997.

D. Gusfield
R.W. Irving

The Stable Marriage Problem
MIT Press, Hayward, MA, 1989.

Dan Gusfield

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

G.J. Hale
R.J. Easton

Applied Data Structures Using Pascal
D.C.Heath and Company, Lexington, MA, 1987.

D. Harel

Algorithmics: The Spirit of Computing (2nd ed.)
Addison-Wesley, Reading, MA, 1992.

M. Headington
D.D. Riley

Data Abstraction and Structures Using C++
D.C. Heath and Company, Lexington, MA, 1994.

E. Horowitz
S. Sahni
S. Anderson-Freed

Fundamentals of Data Structures in C
Computer Science Press, New York, 1993.

E. Horowitz
S. Sahni
S. Rajasekaran

Computer Algorithms C++
W.H. Freeman Press, New York, 1997.

E. Horowitz
S. Sahni
S. Rajasekaran

Computer Algorithms C++
W.H. Freeman Press, New York, 1997.

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.

T.C. Hu

Combinatorial Algorithms
Addison-Wesley, Reading, MA, 1982.

T. Ibaraki
N. Katoh
H. Ono (eds)

Algorithms and Computation 14th International Symposium ISAAC 2003
Springer-Verlag, Berlin, 2003.

D.S. Johnson
T. Nishizeki
A. Nozaki
H.S. Wilf (eds)

Discrete Algorithms and Complexity
Academic Press, New York, 1987.

Neil C. Jones
Pavel A. Pevzner

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

D. Jungnickel

Graphs, Networks and Algorithms
Springer-Verlag, Berlin, 1999.

R. Karlsson
A. Lingas (eds)

SWAT 88
Springer-Verlag, Berlin, 1988.

Jon Kleinberg
Éva Tardos

Algorithm Design
Pearson, Boston, 2006.

Jon Kleinberg
Éva Tardos

Algorithm Design
Pearson, Boston, 2006.

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.

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.

J.F. Korsh

Data Structures, Algorithms, and Program Style
PWS Computer Science, Boston, 1986.

D.C. Kozen

The Design and Analysis of Algorithms
Springer-Verlag, New York, 1992.

R.L. Kruse

Data Structures and Program Design
Prentice-Hall, Englewood Cliffs, NJ, 1984.

R.L. Kruse

Data Structures and Program Design (2nd ed)
Prentice-Hall, Englewood Cliffs, NJ, 1987.

W. Kuich (ed)

Automata, Languages and Programming: 19th ICALP
Springer-Verlag, Berlin, 1989.

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.

Hang Tong Lau

Algorithms on Graphs
TAB, Blue Ridge Summit, PA, 1989.

Anany Levitin

Introduction to the Desiogn and Analysis of Algorithms Second Edition
Pearson Education Inc, Boston, 2007.

Anany Levitin

Introduction to The Design & Analysis of Algorithms
Pearson Education Inc, San Francisco, CA, 2007.

H.R. Lewis
L. Denenberg

Data Structures and Their Algorithms
Harper Collins, New York, 1991.

T.G. Lewis
M.Z. Smith

Applying Data Structures
Houghton Mifflin Company, Dallas, 1982.

Nancy A. Lynch

Distributed Algorithms
Morgan Kaufmann, San Francisco, 1996.

U. Manber

Introduction to Algorithms
Addison-Wesley, Reading, MA, 1989.

J.J. Martin

Data Types and Data Structures
Prentice-Hall, Englewood Cliffs, NJ, 1986.

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

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

K. Mehlhorn

Data Structures and Algorithms 1: Sorting and Searching
Springer-Verlag, Berlin, 1984.

K. Mehlhorn

Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry
Springer-Verlag, Berlin, 1984.

K. Mehlhorn

Data Structures and Algorithms 2: Graph Algorithms and $NP$-Completeness
Springer-Verlag, Heidelberg, 1984.

Kurt Mehlhorn
Stefan Näher

LEDA
Cambridge University Press, Cambridge, UK, 1999.

Kurt Mehlhorn
Peter Sanders

Algorithms and Data Structures: The Basic Toolbox
Springer-Verlag, Heidelberg, 2008.

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.

D.W. Nance
T.L. Naps

Introduction to Computer Science (2nd ed)
West Publishing, St. Paul, 1992.

D.W. Nance
T.L. Naps

Introduction to Computer Science (3rd ed)
West Publishing, St. Paul, 1995.

T.L. Naps
B. Singh

Introduction to Data Structures with Pascal
West Publishing, St. Paul, 1986.

T.L. Naps
G.J. Pothering

Introduction to Data Structures and Algorithms with Pascal (2nd ed)
West Publishing, St. Paul, 1992.

T.L. Naps

Introduction to Program Design and Data Structures
West Publishing, St. Paul, 1993.

T.L. Naps

Laboratory Manual for Data Structures and Algorithm Analysis C++ Version
West Publishing, St. Paul, 1995.

R.E. Neapolitan
K. Naimipour

Foundations of Algorithms
D.C.Heath and Company, Lexington, MA, 1996.

R.E. Neapolitan
K. Naimipour

Foundations of Algorithms
D.C.Heath and Company, Lexington, MA, 1996.

R.E. Neapolitan
K. Naimipour

Foundations of Algorithms
D.C.Heath and Company, Lexington, MA, 1996.

R.E. Neapolitan
K. Naimipour

Foundations of Algorithms Fourth Edition
Jones and Bartlett, Sudbury, MA, 2011.

R.E. Neapolitan
K. Naimipour

Foundations of Algorithms
Jones and Bartlett, Sudbury, MA, 2011.

J. Nievergelt
K.H. Hinrichs

Algorithms and Data Structures with Applications to Graphics and Geometry
Prentice-Hall, Englewood Cliffs, NJ, 1993.

A. Nijenhuis
H.S. Wilf

Combinatorial Algorithms (2nd ed)
Academic Press, New York, 1975.

T. Nishizeki
N. Chiba

Planar Graphs: Theory and Algorithms
North-Holland, 1987.

O. Nurmi
E. Ukkonen

SWAT'92: Algorithm Theory
Springer-Verlag, Berlin, 1992.

Chris Okasaki

Purely Functional Data Structures
Cambridge University Press, 1999.

M. H. Overmars

The Design of Dynamic Data Structures
Springer-Verlag, Berlin, 1983.

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.

J. Pieprzyk
B. Sadeghiyan

Design of Hashing Algorithms
Springer-Verlag, Berlin, 1993.

G.J. Pothering
T.L. Naps

Introduction to Data Structures and Algorithm Analysis with C++
West Publishing, St. Paul, 1995.

Colin R. Reeves (ed)

Modern Heuristic Techniques for Combinatorial Problems
Halsted Press, New York, 1993.

E.M. Reingold
J. Nievergelt
N. Deo

Combinatorial Algorithms: Theory and Practice
Prentice Hall, Englewood Cliffs, NJ, 1977.

E.M. Reingold
W.J. Hansen

Data Structures
Little, Brown and Company, Boston, 1983.

E.M. Reingold
W.J. Hansen

Data Structures in Pascal
Little, Brown and Company, Boston, 1986.

J.H. Riley

Advanced Programming and Data Structures Using Pascal
PWS-KENT Publishing, Boston, 1990.

S. Sahni

Data Structures, Algorithms, and Applications in Java
McGraw Hill, Boston, 2000.

H. Samet

Applications of Spatial Data Structures
Addison-Wesley, Reading, MA, 1990.

H. Samet

The Design and Analysis of Spatial Data Structures
Addison-Wesley, Reading, MA, 1990.

R. Sedgewick

Algorithms
Addison-Wesley, Reading, MA, 1983.

R. Sedgewick

Algorithms in C++ (3rd ed)
Addison-Wesley Longman, Reading, MA, 1998.

J. Setubal
J. Meidanis

Introduction to Computational Molecular Biology
PWS Publishing Company, Boston, 1997.

SIAM

Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms
SIAM, Philadelphia, 1990.

SIAM

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms
SIAM, Philadelphia, 2000.

SIAM

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms
SIAM, Philadelphia, 2000.

B. Singh
T.L. Naps

Introduction to Data Structures
West Publishing, St. Paul, 1985.

S.S. Skiena

The Algorithm Design Manual
Springer-Verlag, New York, 1997.

H.F. Smith

Data Structures: Form and Function
Harcourt Brace Jovanovich Publishers, San Diego, CA, 1987.

T.A. Standish

Data Structure Techniques
Addison-Wesley, Reading, MA, 1980.

T.A. Standish

Data Structure Techniques (Instructors Manual)
Addison-Wesley, Reading, MA, 1980.

T.A. Standish

Data Structures, Algorithms, and Software Principles
Addison-Wesley, Reading, MA, 1994.

G.A. Stephen

String Searching Algorithms
World Scientific, Singapore, 1994.

G. W. Stewart

Matrix Algorithms Volume 1: Basic Decompositions
SIAM, Philadelphia, 1998.

R.E. Tarjan

Data Structures and Network Algorithms
Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

R.E. Tarjan

Data Structures and Network Algorithms
Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.

A.M. Tenenbaum
M.J. Augenstein

Data Structures Using Pascal (2nd ed)
Prentice Hall, Englewood Cliffs, NJ, 1981.

A.M. Tenenbaum
M.J. Augenstein

Data Structures Using Pascal (2nd ed)
Prentice Hall, Englewood Cliffs, NJ, 1986.

A.M. Tenenbaum
Y. Langsam
M.J. Augenstein

Data Structures using C
Prentice Hall, Englewood Cliffs, NJ, 1990.

J.S. Tilford

Solutions Manual to accompany E.M. Reingold and W.J. Hansen's Data Structures
Little, Brown and Company, Boston, 1983.

Gabriel Valiente

Algorithms on Trees and Graphs
Springer-Verlag, Heidelberg, 2002.

J. Van Leeuwen (ed)

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

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.

Michael S. Waterman

Introduction to Computational Biology
Chapman and Hall, London, 1995.

M.A. Weiss

Data Structures and Algorithm Analysis
The Benjamin Cummings Publishing Company, Redwood City, CA, 1992.

M.A. Weiss

Data Structures and Algorithm Analysis in C++
The Benjamin Cummings Publishing Company, Redwood City, 1994.

J. Welsh
J. Elder
D. Bustard

Sequential Program Structures
Prentice-Hall, Englewood Cliffs, NJ, 1984.

G.F. Wetzel
W.G. Bulgren

The Algorithmic Process: An Introduction to Problem Solving
Science Research Associates, Chicago, 1985.

H. Wilf

Combinatorial Algorithms: An Update
SIAM, Philadelphia, 1989.

H. Wilf

Combinatorial Algorithms: An Update
SIAM, Philadelphia, 1989.

H.S. Wilf

Algorithms and Complexity
Prentice Hall, Englewood Cliffs, NJ, 1986.

David P. Williamson
David B. Schmoys

The Design of Approximation Algorithms
Cambridge University Press, Cambridge, 2011.

N. Wirth

Algorithms and Data Structures
Prentice Hall, Englewood Cliffs, NJ, 1986.

D. Wood

Paradigms and Programming with PASCAL
Computer Science Press, Rockville, MD, 1984.

D. Wood

Data Structures, Algorithms, and Performance
Addison-Wesley, Reading, MA, 1993.

W.A. Wulf
M. Shaw
P.N. Hilfinger
L. Flon

Fundamental Structures of Computer Science
Addison-Wesley, Reading, MA, 1981.

Chee Keng Yap

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



Contact

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