Random Structures and Algorithms

Aims & Scope

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.

View Aims & Scope

---

Metrics & Ranking

SJR (SCImago Journal Rank)

Year	Value
2024	1.055

Quartile

Year	Value
2024	Q1

h-index

Year	Value
2024	73

Journal Rank

Year	Value
2024	4426

Journal Citation Indicator

Year	Value
2024	215

Impact Factor

Year	Value
2024	0.90

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science and Mathematics, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• A critical point for random graphs with a given degree sequence

  Citation: 1591

  Authors: Michael, Bruce

• An elementary proof of a theorem of Johnson and Lindenstrauss

  Citation: 574

  Authors: Sanjoy, Anupam

• Exact sampling with coupled Markov chains and applications to statistical mechanics

  Citation: 568

  Authors: James Gary, David Bruce

• The degree sequence of a scale‐free random graph process

  Citation: 510

  Authors: B´ela, Oliver, Joel, Gábor

• The phase transition in inhomogeneous random graphs

  Citation: 453

  Authors: Béla, Svante, Oliver

• Simple Constructions of Almost k‐wise Independent Random Variables

  Citation: 302

  Authors: Noga, Oded, Johan, René

• Onk-connectivity for a geometric random graph

  Citation: 277

  Authors: Mathew D.

• Survey propagation: An algorithm for satisfiability

  Citation: 257

  Authors: A., M., R.

• Random walks in a convex body and an improved volume algorithm

  Citation: 244

  Authors: L., M.

• The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i>²/log <i>t</i>

  Citation: 225

  Authors: Jeong Han

---