Random Structures and Algorithms

Subject: Random Structures and Algorithms
Date: Thu, 26 Jul 2001 15:19:49 -0400 (EDT)

Random Structures and Algorithms 

http://www3.interscience.wiley.com/cgi-bin/jhome/38107

ISSN: 1098-2418      

It is the aim of this journal to meet two main objectives: to cover the
latest research on discrete random structures, and to present applications
of such research to problems in combinatorics and computer science. The
goal is to provide a natural home for a significant body of current
research, and a useful forum for ideas on future studies in randomness.  
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.

Available by subscription only.

Contact:

Editor: Michal Karonski
Email:  random@math.amu.edu.pl