| Ultrafast Parallel Algorithms and Reconfigurable Meshes Links to an online paper by Quentin F. Stout. Algorithms have been developed for problems in geometry, graph theory, arithmetic, sorting, and image processing. | |
| The Electronic Journal of Combinatorics A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics. Full text is available free on-line. | |
| The Art of Computer Programming (TAOCP) By Donald E. Knuth. Bibliographic details of the published volumes (1-3, various editions and translations) and on-line beta versions of parts of volume 4, 'Combinatorial Algorithms'. | |
| The Art of Computer Programming By Donald Knuth. Homepage of the classic text. | |
| Stack Free Recursion A paper describing the 'Stack Free Recursion' algorithm. C code with C++ comments. | |
| SODA Bibliography 1990-1998 Bibliography containing papers published in the proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. [Hypertext version died, only gzip version available.] | |
| Random Structures and Algorithms Results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks are presented with particular emphasis on the use of probabilistic methods in combinatori | |
| Journal of Symbolic Computation (Academic Press) A forum for research in the algorithmic treatment of all types of symbolic objects. Tables of contents from vol.15 (1993). Full text to subscribers. | |
| Journal of Graph Algorithms and Applications An electronic journal available via WWW. All papers freely available in PostScript and PDF. | |
| Journal of Discrete Algorithms Contact information, list of accepted and forthcoming papers. | |
| Journal of Complexity (Elsevier) Mathematical results on complexity as broadly conceived. | |
| Journal of Complexity Editor's site. Author and subscriber information. | |
| Journal of Algorithms Bibliography A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999. | |
| Journal of Algorithms (Academic Press) Contents from vol.14 (1993). Full text to subscribers. | |
| Introduction to the Theory of Computation Michael Sipser (PWS Publishing) Table of contents, errata. | |
| Introduction to Circuit Complexity: A Uniform Approach By Heribert Vollmer (Springer, 1999). Excerpts, errata, bibliography in BibTeX format. | |
| Information Processing Letters The aim of IPL is to allow rapid dissemination of interesting results in the field of information processing in the form of short, concise papers. | |
| Handbook of Algorithms and Data Structures By Gaston H. Gonnet and Ricardo Baeza-Yates. The preface, table of contents, index and all source code of this handbook. The main goal is to make available through Internet the source code of many algorithms (in C and/or Pascal) that have been already tes | |
| Discrete Applied Mathematics Aims to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Full text by subscription. | |
| Data Structures by R. K. Ghosh Course materials, animation applets, links to on-line books and other related internet resources. | |
