Next Day Delivery Available. Buy now on Additions Direct.

Sale Now On. Great Range. Free UK Delivery.

Find your computer at web prices. Great summer specials.

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

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

(Kluwer) Abstracts and contents from vol.4 (1995). Full text to subscribers.

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.

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.

(Academic Press) Contents from vol.14 (1993). Full text to subscribers.

A hypertext bibliography containing papers published in the Journal of Algorithms, 1980-1999.

Editor's site. Author and subscriber information.

(Elsevier) Mathematical results on complexity as broadly conceived.

Contact information, list of accepted and forthcoming papers.

An electronic journal available via WWW. All papers freely available in PostScript and PDF.

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

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.

A refereed all-electronic journal that welcomes papers in all branches of discrete mathematics. Full text is available free on-line.