Random Structures and Algorithms
| 短名 | Random Struct. Alg. |
| Journal Impact | 1.06 |
| 国际分区 | MATHEMATICS, APPLIED(Q3) |
| 期刊索引 | SCI Q2中科院 3 区 |
| ISSN | 1042-9832, 1098-2418 |
| h-index | 69 |
| 国内分区 | 数学(3区)数学计算机软件工程(3区)数学数学(3区)数学应用数学(3区) |
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.
期刊主页投稿网址| 涉及主题 | 数学计算机科学组合数学离散数学理论计算机科学图形物理数学分析统计随机图程序设计语言 |
| 出版信息 | 出版商: John Wiley and Sons Ltd，出版周期: Bimonthly，期刊类型: journal |
| 基本数据 | 创刊年份: 1990，原创研究文献占比: 100.00%，自引率:11.10%， Gold OA占比: 24.08% |
| 平均审稿周期 | 网友分享经验：>12周，或约稿 |
| 平均录用比例 | 网友分享经验：容易 |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
The “Power of Few” Phenomenon: The Sparse Case
2024-9-14
A Sharp Threshold for a Random Version of Sperner's Theorem
2024-9-8
Large induced subgraphs of random graphs with given degree sequences
2024-8-27
Issue Information
2024-8-17
Central limit theorem for linear eigenvalue statistics of the adjacency matrices of random simplicial complexes
2024-8-12
Ramsey numbers of cycles in random graphs
2024-8-9
The devil's staircase for chip‐firing on random graphs and on graphons
2024-8-9
Central limit theorem in disordered Monomer‐Dimer model
2024-8-7
Seymour's second neighbourhood conjecture: random graphs and reductions
2024-8-7
Sumsets and entropy revisited
2024-7-31
Cover and hitting times of hyperbolic random graphs
2024-7-26
Coboundary expansion for the union of determinantal hypertrees
2024-7-19
Issue Information
2024-7-18
The asynchronous DeGroot dynamics
2024-7-10
Twin‐width of random graphs
2024-6-14
Issue Information
2024-6-14
Percolation critical probabilities of matching lattice‐pairs
2024-6-14
On the rank, Kernel, and core of sparse random graphs
2024-6-12
Equivalent regular partitions of three‐uniform hypergraphs
2024-5-29
On the typical structure of graphs not containing a fixed vertex‐critical subgraph
2024-5-24
Quasi‐majority functional voting on expander graphs
2024-5-21
Partitioning graphs with linear minimum degree
2024-5-20
Expansion in supercritical random subgraphs of expanders and its consequences
2024-5-18
Spanning cycles in random directed graphs
2024-5-15
Issue Information
2024-5-15
Increasing subsequences of linear size in random permutations and the Robinson–Schensted tableaux of permutons
2024-5-6
Testing versus estimation of graph properties, revisited
2024-4-26
Connectivity graph‐codes
2024-4-23
Reinforced Galton–Watson processes I: Malthusian exponents
2024-4-22
On connectivity in random graph models with limited dependencies
2024-4-22
The square of a Hamilton cycle in randomly perturbed graphs
2024-4-16
Transference for loose Hamilton cycles in random 3‐uniform hypergraphs
2024-4-12
The hitting time of clique factors
2024-3-28
Issue Information
2024-3-20
Weight distribution of random linear codes and Krawtchouk polynomials
2024-3-15
A polynomial‐time approximation scheme for the maximal overlap of two independent Erdős–Rényi graphs
2024-3-7
Isoperimetric inequalities for real‐valued functions with applications to monotonicity testing
2024-2-29
The GHP scaling limit of uniform spanning trees of dense graphs
2024-2-27
Weakly saturated random graphs
2024-2-19
A robust Corrádi–Hajnal theorem
2024-2-9
On pattern‐avoiding permutons
2024-1-29
Issue Information
2024-1-25
Coupling Bertoin's and Aldous–Pitman's representations of the additive coalescent
2024-1-11
Cycles with many chords
2024-1-10
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远