Random Structures and Algorithms
Library Home || Full Table of Contents || Suggest a Link || Library Help
|John Wiley & Sons, Inc.|
|A journal that publishes results concerning random graphs, hypergraphs, matroids, trees, mappings, permutations, matrices, sets and orders, as well as stochastic graph processes and networks, with particular emphasis on the use of probabilistic methods in combinatorics as developed by Paul Erdös. It 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.|
|Math Topics:||Discrete Math, Probability, Cryptography|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.