Northern Reviews on Algorithmic Research, Theoretical Computation, and Complexity

Northern Reviews on Algorithmic Research, Theoretical Computation, and Complexity is a peer-reviewed scholarly journal dedicated to rigorous advances in algorithms, computation theory, and computational complexity. We publish work that strengthens the foundations of computing, clarifies what can (and cannot) be computed efficiently, and connects theory to principled practice.

The journal welcomes original research articles, survey/review papers, and concise technical notes that deliver clear statements, reproducible proofs, and meaningful theoretical insights.

Aims & Scope

• Algorithm design and analysis (deterministic, randomized, approximation, online)
• Computational complexity (lower bounds, completeness, fine-grained complexity)
• Graph theory and combinatorics in computation
• Parameterized and exact algorithms
• Proof complexity, logic, and formal methods
• Information theory, coding, and communication complexity
• Quantum computation and complexity
• Cryptography and foundational security theory
• Learning theory and theoretical aspects of AI/ML
• Distributed, parallel, and streaming theory

Editorial Principles

• Quality-first review: careful evaluation of correctness, novelty, and clarity.
• Transparent scholarship: precise definitions, complete proofs, and clear limitations.
• Ethics & integrity: strict policies on plagiarism, dual submission, and authorship.

For submission guidelines, formatting instructions, and policies, please visit the Submissions page.