---
Computers - Algorithms - Publications
 ---

SODA Bibliography 1990-1998 - A hypertext bibliography containing papers published in the proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms.

Data Structures by R. K. Ghosh - Course materials, animation applets, links to on-line books and other related internet resources.

Stack Free Recursion - A paper describing the "Stack Free Recursion" algorithm. C code with C++ comments.

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.

Information Processing Letters Bibliography - A searchable hypertext bibliography containing all papers published in IPL: also in BibTeX.

Branching Programs and Binary Decision Diagrams - By Ingo Wegener (SIAM, 2000). Errata, solutions to exercises, updates on open problems.

A Compendium of NP Optimization Problems - By P. Crescenzi and V. Kann; KTH Stockholm. A continuously updated version of the appendix from the book "Complexity and Approximation" (Springer, 1999).

Introduction to Circuit Complexity: A Uniform Approach - By Heribert Vollmer (Springer, 1999). Excerpts, errata, bibliography in BibTeX format.

Introduction to the Theory of Computation - Michael Sipser (PWS Publishing) Table of contents, errata.

Algorithms and Complexity - A downloadable textbook by Herbert S. Wilf. Each chapter is available as compressed PostScript or PDF.

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".

Data Structures and Algorithms with Object-Oriented Design Patterns in C++ - A web text by Bruno R. Preiss of the University of Waterloo.

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 tested.

Combinatorics, Probability and Computing - (CUP) Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation. Contact information; full text to subscribers.

Computational Complexity - (Birkhauser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.

Computational Optimization and Applications - (Kluwer) Abstracts and contents from vol.4 (1995). Full text to subscribers.

Discrete Applied Mathematics - (Elsevier) Combinatorial Algorithms, Optimization and Computer Science.

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.

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.

Journal of Algorithms - (Academic Press) Contents from vol.14 (1993). Full text to subscribers.

Journal of Complexity - Editor's site. Author and subscriber information.

Journal of Discrete Algorithms - Contact information, list of accepted and forthcoming papers.

Journal of Graph Algorithms and Applications - An electronic journal available via WWW. All papers freely available in PostScript and PDF.

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 Complexity - (Academic Press) Mathematical results on complexity as broadly conceived.

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 combinatorics as developed by Paul Erdõs. The journal focuses on probabilistic algorithms, average case analysis of deterministic algorithms, and applications of probabilistic methods to cryptography, data structures, searching and sorting. The journal also devotes space to such areas of probability theory as percolation, random walks and combinatorial aspects of probability. Table of contents with abstracts on-line starting with volume 8 (1996), full text available to subscribers.

---

netmation.com | netmation.net | netmation.org | netmation.tv

Copyright © 1991-2009 Netmation Inc. All Rights Reserved
Site Designed and Hosted by Netmation Inc.