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.

《Random Structures & Algorithms》是一本由WILEY出版商出版的专业数学期刊，该刊创刊于1990年，刊期Bimonthly，该刊已被国际权威数据库SCI、SCIE收录。在中科院最新升级版分区表中，该刊分区信息为大类学科：数学 2区，小类学科：计算机：软件工程 2区；数学 2区；应用数学 2区；在JCR（Journal Citation Reports）分区等级为Q2。该刊发文范围涵盖计算机：软件工程等领域，旨在及时、准确、全面地报道国内外计算机：软件工程工作者在该领域取得的最新研究成果、工作进展及学术动态、技术革新等，促进学术交流，鼓励学术创新。2021年影响因子为1.057，平均审稿速度>12周，或约稿。