- 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.
http://journals.cambridge.org/action/displayJournal?jid=CPC
(Added: Mon Apr 04 2011 Hits: 0 Rating: 0.00 Votes: 0)
Rate It
Review It
- 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.
http://www3.interscience.wiley.com/journal/38107/home
(Added: Mon Apr 04 2011 Hits: 0 Rating: 0.00 Votes: 0)
Rate It
Review It
|
