Random Structures & Algorithms
Vol 42 (8 Issues in 2013)
Edited by: Michal Karonski, Noga Alon, and Andrzej Rucinski
Print ISSN: 1042-9832 Online ISSN: 1098-2418
Impact Factor: 1.048
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.
Manuscripts should be submitted via email to the Managing Editor, Malgorzata Bednarska at email@example.com . Information for contributors appears in the journal as space allows, and is available at http://onlinelibrary.wiley.com/resolve/openurl?genre=journal&issn=1042-9832/authors.html