On the public citation graph
Poisson approximation for large deviations
0 signed · 195 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240010210openalex-snapshot
A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
inferredcites →https://doi.org/10.1016/0097-3165(89)90022-8openalex-snapshot
A useful elementary correlation inequality
inferredcites →https://doi.org/10.1093/oso/9780198522355.001.0001openalex-snapshot
Poisson Approximation
inferredcites →https://doi.org/10.1184/r1/6478793openalex-snapshot
On small subgraphs of random graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.5281/zenodo.7589264openalex-extracted
High Order Complementary Bases of Primes
inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199907)31:3<201::aid-jgt5>3.0.co;2-topenalex-snapshot
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(199710)11:3<245::aid-rsa3>3.0.co;2-0openalex-snapshot
Threshold functions for asymmetric Ramsey properties involving cycles
inferred← citeshttps://doi.org/10.1002/(sici)1098-2418(200001)16:1<1::aid-rsa1>3.0.co;2-eopenalex-snapshot
TEN YEARS!
inferred← citeshttps://doi.org/10.1002/1098-2418(200007)16:4<344::aid-rsa4>3.0.co;2-5openalex-snapshot
On the concentration of multivariate polynomials with small expectation
inferred← citeshttps://doi.org/10.1002/9783527627981.ch5openalex-snapshot
On the Structure of Neutral Networks of RNA Pseudoknot Structures
inferred← citeshttps://doi.org/10.1002/jgt.22950openalex-snapshot
Spanners in randomly weighted graphs: Euclidean case
inferred← citeshttps://doi.org/10.1002/jgt.23015openalex-snapshot
Random polynomial graphs for random Turán problems
inferred← citeshttps://doi.org/10.1002/net.20111openalex-snapshot
Approximation algorithms for channel allocation problems in broadcast networks
inferred← citeshttps://doi.org/10.1002/rsa.10038openalex-snapshot
Approximation algorithms for the covering Steiner problem
inferred← citeshttps://doi.org/10.1002/rsa.20048openalex-snapshot
Integer and fractional packing of families of graphs
inferred← citeshttps://doi.org/10.1002/rsa.20352openalex-snapshot
Ramsey properties of random discrete structures
inferred← citeshttps://doi.org/10.1002/rsa.20371openalex-snapshot
A concentration result with application to subgraph count
inferred← citeshttps://doi.org/10.1002/rsa.20381openalex-snapshot
The missing log in large deviations for triangle counts
inferred← citeshttps://doi.org/10.1002/rsa.20440openalex-snapshot
Tight upper tail bounds for cliques
inferred← citeshttps://doi.org/10.1002/rsa.20444openalex-snapshot
When does the K4‐free process stop?
inferred← citeshttps://doi.org/10.1002/rsa.20446openalex-snapshot
Upper bounds on probability thresholds for asymmetric Ramsey properties
inferred← citeshttps://doi.org/10.1002/rsa.20488openalex-snapshot
For most graphsH, mostH‐free graphs have a linear homogeneous set
inferred← citeshttps://doi.org/10.1002/rsa.20506openalex-snapshot
The Janson inequalities for general up‐sets
inferred← citeshttps://doi.org/10.1002/rsa.20545openalex-snapshot
An improved upper bound on the density of universal random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20590openalex-snapshot
The lower tail: Poisson approximation revisited
inferred← citeshttps://doi.org/10.1002/rsa.20723openalex-snapshot
Sharp thresholds for Ramsey properties of strictly balanced nearly bipartite graphs
inferred← citeshttps://doi.org/10.1002/rsa.20785openalex-snapshot
On the cycle space of a random graph
inferred← citeshttps://doi.org/10.1002/rsa.20859openalex-snapshot
A counterexample to the DeMarco‐Kahn upper tail conjecture
inferred← citeshttps://doi.org/10.1002/rsa.20870openalex-snapshot
Powers of Hamiltonian cycles in randomly augmented graphs
inferred← citeshttps://doi.org/10.1002/rsa.20971openalex-snapshot
Vertex Ramsey properties of randomly perturbed graphs
inferred← citeshttps://doi.org/10.1002/rsa.21000openalex-snapshot
Optimal stopping for many connected components in a graph
inferred← citeshttps://doi.org/10.1002/rsa.21228openalex-snapshot
On the typical structure of graphs not containing a fixed vertex‐critical subgraph
inferred← citeshttps://doi.org/10.1002/rsa.3240010302openalex-snapshot
Representations of integers as the sum of k terms
inferred← citeshttps://doi.org/10.1002/rsa.3240020306openalex-snapshot
A zero‐one law for a random subset
inferred← citeshttps://doi.org/10.1002/rsa.3240050202openalex-snapshot
Random graphs with monochromatic triangles in every edge coloring
inferred← citeshttps://doi.org/10.1002/rsa.3240070204openalex-snapshot
Bounding Ramsey numbers through large deviation inequalities
inferred← citeshttps://doi.org/10.1002/rsa.70014openalex-snapshot
The Clique Chromatic Number of Sparse Random Graphs
inferred← citeshttps://doi.org/10.1006/jagm.2000.1096openalex-snapshot
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
inferred← citeshttps://doi.org/10.1006/jcta.1997.2785openalex-snapshot
Ramsey Properties of Random Hypergraphs
inferred← citeshttps://doi.org/10.1006/jcta.1999.3048openalex-snapshot
Maximum Antichains in Random Subsets of a Finite Set
inferred← citeshttps://doi.org/10.1007/11617983_22openalex-snapshot
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_44openalex-snapshot
Approximating the unsatisfiability threshold of random formulas (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-1-4612-2418-1_18openalex-snapshot
Some Applications of Probability to Additive Number Theory and Harmonic Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_23openalex-snapshot
The Origins of the Theory of Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-0348-8974-2_1openalex-snapshot
Randomness and Pseudo-Randomness in Discrete Mathematics
inferred← citeshttps://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-319-51753-7_12openalex-snapshot
The Lower Tail: Poisson Approximation Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_21openalex-snapshot
On the Covering Steiner Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_5openalex-snapshot
Approximation Algorithms for Channel Allocation Problems in Broadcast Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_38openalex-snapshot
On the Benefits of Adaptivity in Property Testing of Dense Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_20openalex-snapshot
An Improved Upper Bound on the Density of Universal Random Graphs
inferred← citeshttps://doi.org/10.1007/bf01200906openalex-snapshot
OnK 4-free subgraphs of random graphs
inferred← citeshttps://doi.org/10.1007/bf02699376openalex-snapshot
Concentration of measure and isoperimetric inequalities in product spaces
inferred← citeshttps://doi.org/10.1007/bf02771528openalex-snapshot
Upper tails for subgraph counts in random graphs
inferred← citeshttps://doi.org/10.1007/s00440-017-0808-7openalex-snapshot
Higher order corrections for anisotropic bootstrap percolation
inferred← citeshttps://doi.org/10.1007/s00446-008-0072-2openalex-snapshot
Optimal inter-object correlation when replicating for availability
inferred← citeshttps://doi.org/10.1007/s00453-008-9237-4openalex-snapshot
On the Benefits of Adaptivity in Property Testing of Dense Graphs
inferred← citeshttps://doi.org/10.1007/s00453-021-00813-yopenalex-snapshot
Beating Treewidth for Average-Case Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1007/s00453-022-01000-3openalex-snapshot
Monotone Circuit Lower Bounds from Robust Sunflowers
inferred← citeshttps://doi.org/10.1007/s00493-004-0038-3openalex-snapshot
The Deletion Method For Upper Tail Estimates
inferred← citeshttps://doi.org/10.1007/s00493-010-2436-zopenalex-snapshot
Online vertex-coloring games in random graphs
inferred← citeshttps://doi.org/10.1007/s00493-025-00188-6openalex-snapshot
Clique packings in random graphs
inferred← citeshttps://doi.org/10.1007/s004930050048openalex-snapshot
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality
inferred← citeshttps://doi.org/10.1007/s004930070019openalex-snapshot
The Structure of Hereditary Properties and Colourings of Random Graphs
inferred← citeshttps://doi.org/10.1007/s004930100017openalex-snapshot
Vertex Covers by Edge Disjoint Cliques
inferred← citeshttps://doi.org/10.1007/s10474-009-9155-1openalex-snapshot
On Sidon sets which are asymptotic bases
inferred← citeshttps://doi.org/10.1007/s10474-010-9155-1openalex-snapshot
On Sidon sets which are asymptotic bases
inferred← citeshttps://doi.org/10.1007/s10878-008-9174-9openalex-snapshot
Subhypergraph counts in extremal and random hypergraphs and the fractional q-independence
inferred← citeshttps://doi.org/10.1007/s10955-014-1099-3openalex-snapshot
A Sharp Threshold for a Modified Bootstrap Percolation with Recovery
inferred← citeshttps://doi.org/10.1007/s10959-012-0437-0openalex-snapshot
Moderate Deviations via Cumulants
inferred← citeshttps://doi.org/10.1007/s10994-024-06536-9openalex-snapshot
Generalization bounds for learning under graph-dependence: a survey
inferred← citeshttps://doi.org/10.1007/s11538-008-9356-8openalex-snapshot
Local Connectivity of Neutral Networks
inferred← citeshttps://doi.org/10.1007/s11856-017-1546-3openalex-snapshot
Upper tails for arithmetic progressions in random subsets
inferred← citeshttps://doi.org/10.1016/j.aam.2022.102378openalex-snapshot
Asymptotic linearity of binomial random hypergraphs via cluster expansion under graph-dependence
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.010openalex-snapshot
The discrepancy of the lex-least de Bruijn sequence
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115118openalex-snapshot
Tiling randomly perturbed multipartite graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103843openalex-snapshot
Schur properties of randomly perturbed sets
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.077openalex-snapshot
An expected polynomial time algorithm for coloring 2-colorable 3-graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.098openalex-snapshot
4-cycles at the triangle-free process
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.059openalex-snapshot
On limits of sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.05.003openalex-snapshot
On the missing log in upper tail estimates
inferred← citeshttps://doi.org/10.1016/j.spl.2021.109272openalex-snapshot
When Janson meets McDiarmid: Bounded difference inequalities under graph-dependence
inferred← citeshttps://doi.org/10.1016/s0169-7161(01)19006-1openalex-snapshot
Topics in poisson approximation
inferred← citeshttps://doi.org/10.1017/cbo9781107325975.009openalex-snapshot
Metrics for sparse graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/fms.2026.10178openalex-snapshot
Sharp thresholds for Ramsey properties
inferred← citeshttps://doi.org/10.1017/s0001867800002020openalex-snapshot
CLT-related large deviation bounds based on Stein's method
inferred← citeshttps://doi.org/10.1017/s0001867800009745openalex-snapshot
Compound Poisson approximation and the clustering of random points
inferred← citeshttps://doi.org/10.1017/s0963548300000559openalex-snapshot
Threshold Functions for H -factors
inferred← citeshttps://doi.org/10.1017/s0963548300002029openalex-snapshot
Small Submatroids in Random Matroids
inferred← citeshttps://doi.org/10.1017/s0963548300004545openalex-snapshot
A Large Deviation Result on the Number of Small Subgraphs of a Random Graph
inferred← citeshttps://doi.org/10.1017/s0963548315000103openalex-snapshot
On the Method of Typical Bounded Differences
inferred← citeshttps://doi.org/10.1017/s0963548316000262openalex-snapshot
On the Lower Tail Variational Problem for Random Graphs
inferred← citeshttps://doi.org/10.1090/s0002-9947-1994-1138950-5openalex-snapshot
The structure of a random graph at the point of the phase transition
inferred← citeshttps://doi.org/10.1090/s0894-0347-1995-1276825-6openalex-snapshot
Threshold Functions for Ramsey Properties
inferred← citeshttps://doi.org/10.1109/ccc.2009.23openalex-snapshot
k-Subgraph Isomorphism on AC_0 Circuits
inferred← citeshttps://doi.org/10.1109/cscwd.2017.8066750openalex-snapshot
Increasing the availability of multi-object tasks on multi-region distributed system
inferred← citeshttps://doi.org/10.1109/cvpr52733.2024.00503openalex-snapshot
Efficient Detection of Long Consistent Cycles and its Application to Distributed Synchronization
inferred← citeshttps://doi.org/10.1109/focs.2010.26openalex-snapshot
The Monotone Complexity of k-clique on Random Graphs
inferred← citeshttps://doi.org/10.1109/focs.2014.44openalex-snapshot
On the AC0 Complexity of Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00020openalex-snapshot
Sampling, Counting, and Large Deviations for Triangle-Free Graphs Near the Critical Density
inferred← citeshttps://doi.org/10.1109/isit.2005.1523647openalex-snapshot
On the asymptotic performance of iterative decoders for product codes
inferred← citeshttps://doi.org/10.1109/phm-yantai55411.2022.9941921openalex-snapshot
Reliability of Two-dimensional Consecutive Voting System
inferred← citeshttps://doi.org/10.1109/tit.2011.2119464openalex-snapshot
New Bounds on the Capacity of Multidimensional Run-Length Constraints
inferred← citeshttps://doi.org/10.1112/plms/pdv050openalex-snapshot
On Sidon sets and asymptotic bases
inferred← citeshttps://doi.org/10.1137/060657492openalex-snapshot
Ramsey Properties of Random k-Partite, k-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1137/1.9781611973099.37openalex-snapshot
Concentration and Moment Inequalities for Polynomials of Independent Random Variables
inferred← citeshttps://doi.org/10.1137/110839059openalex-snapshot
The Monotone Complexity of $k$-Clique on Random Graphs
inferred← citeshttps://doi.org/10.1137/14099721xopenalex-snapshot
On the $AC^0$ Complexity of Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1137/15m1027310openalex-snapshot
Formulas versus Circuits for Small Distance Connectivity
inferred← citeshttps://doi.org/10.1137/19m1276467openalex-snapshot
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem
inferred← citeshttps://doi.org/10.1137/20m1335418openalex-snapshot
The Effect of Adding Randomly Weighted Edges
inferred← citeshttps://doi.org/10.1137/s0097539704445718openalex-snapshot
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees
inferred← citeshttps://doi.org/10.1142/9789813272880_0187openalex-snapshot
LOWER BOUNDS FOR SUBGRAPH ISOMORPHISM
inferred← citeshttps://doi.org/10.1145/1281100.1281137openalex-snapshot
Optimal inter-object correlation when replicating for availability
inferred← citeshttps://doi.org/10.1145/1374376.1374480openalex-snapshot
On the constant-depth complexity of k-clique
inferred← citeshttps://doi.org/10.1145/2591796.2591828openalex-snapshot
Formulas vs. circuits for small distance connectivity
inferred← citeshttps://doi.org/10.1145/3313276.3316339openalex-snapshot
A fixed-depth size-hierarchy theorem for AC 0 [⊕] via the coin problem
inferred← citeshttps://doi.org/10.1145/3564246.3585238openalex-snapshot
Optimal Explicit Small-Depth Formulas for the Coin Problem
inferred← citeshttps://doi.org/10.11606/d.45.2020.tde-25112020-162107openalex-snapshot
Sunflowers theorems in computational complexity
inferred← citeshttps://doi.org/10.11606/t.45.2010.tde-20230727-113656openalex-snapshot
A conjectura KLR e 1-afirmações para propriedades anti-Ramsey
inferred← citeshttps://doi.org/10.1184/r1/6478793openalex-snapshot
On small subgraphs of random graphs
inferred← citeshttps://doi.org/10.1214/009117904000000856openalex-snapshot
Moment inequalities for functions of independent random variables
inferred← citeshttps://doi.org/10.1214/19-aop1371openalex-snapshot
On the probability of nonexistence in binomial subsets
inferred← citeshttps://doi.org/10.1214/20-ecp322openalex-snapshot
Lower large deviations for geometric functionals
inferred← citeshttps://doi.org/10.1214/21-ejp650openalex-snapshot
A sharp threshold for bootstrap percolation in a random hypergraph
inferred← citeshttps://doi.org/10.1214/aoap/1015345355openalex-snapshot
Compound Poisson approximation: a user's guide
inferred← citeshttps://doi.org/10.1214/aop/1055425791openalex-snapshot
Concentration inequalities using the entropy method
inferred← citeshttps://doi.org/10.1214/ejp.v14-723openalex-snapshot
Moderate Deviations in a Random Graph and for the Spectrum of Bernoulli Random Matrices
inferred← citeshttps://doi.org/10.1215/00127094-2021-0067openalex-snapshot
Upper tails via high moments and entropic stability
inferred← citeshttps://doi.org/10.1215/00127094-2023-0029openalex-snapshot
Regularity method and large deviation principles for the Erdős–Rényi hypergraph
inferred← citeshttps://doi.org/10.1215/s0012-7094-00-10516-9openalex-snapshot
On a refinement of Waring's problem
inferred← citeshttps://doi.org/10.1239/aap/1013540020openalex-snapshot
Compound Poisson approximation and the clustering of random points
inferred← citeshttps://doi.org/10.1287/opre.2018.1730openalex-snapshot
Generating Random Networks Without Short Cycles
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.2478/qic-2025-0039openalex-snapshot
Random-Projector Quantum Diagnostics of Ramsey Numbers and A Prime-factor Heuristic for R (5, 5) = 45
inferred← citeshttps://doi.org/10.37236/10openalex-snapshot
On the Upper Tail of Counts of Strictly Balanced Subgraphs
inferred← citeshttps://doi.org/10.37236/100openalex-snapshot
Balanced Online Ramsey Games in Random Graphs
inferred← citeshttps://doi.org/10.37236/10728openalex-snapshot
On the Chromatic Number in the Stochastic Block Model
inferred← citeshttps://doi.org/10.37236/11275openalex-snapshot
The Covering Threshold of a Directed Acyclic Graph by Directed Acyclic Subgraphs
inferred← citeshttps://doi.org/10.37236/11449openalex-snapshot
On the Anti-Ramsey Threshold for Non-Balanced Graphs
inferred← citeshttps://doi.org/10.37236/11638openalex-snapshot
On the Concentration of the Chromatic Number of Random Graphs
inferred← citeshttps://doi.org/10.37236/331openalex-snapshot
The $t$-Stability Number of a Random Graph
inferred← citeshttps://doi.org/10.37236/93openalex-snapshot
Lower Bounds for the Size of Random Maximal $H$-Free Graphs
inferred← citeshttps://doi.org/10.4007/annals.2015.181.2.1openalex-snapshot
Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution
inferred← citeshttps://doi.org/10.4007/annals.2016.184.2.2openalex-snapshot
Combinatorial theorems in sparse random sets
inferred← citeshttps://doi.org/10.4064/aa162-3-1openalex-snapshot
The additive complements of primes and Goldbach's problem
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2019.24openalex-snapshot
Beating Treewidth for Average-Case Subgraph Isomorphism
inferred← citeshttps://doi.org/10.4310/joc.2013.v4.n2.a5openalex-snapshot
General deletion lemmas via the Harris inequality
inferred← citeshttps://doi.org/10.48550/arxiv.0809.0141openalex-snapshot
The t-stability number of a random graph
inferred← citeshttps://doi.org/10.48550/arxiv.0901.3246openalex-snapshot
Moderate deviations in random graphs and Bernoulli random matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1003.3498openalex-snapshot
The missing log in large deviations for triangle counts
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0220openalex-snapshot
Trees in Random Sparse Graphs with a Given Degree Sequence
inferred← citeshttps://doi.org/10.48550/arxiv.1404.3324openalex-snapshot
Combinatorial theorems relative to a random set
inferred← citeshttps://doi.org/10.48550/arxiv.1408.0294openalex-snapshot
Large deviation upper bounds for sums of positively associated indicators
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07000openalex-snapshot
Sidon basis in polynomial rings over finite fields
inferred← citeshttps://doi.org/10.48550/arxiv.1705.10893openalex-snapshot
Asymptotics of the spectral radius for directed Chung-Lu random graphs with community structure
inferred← citeshttps://doi.org/10.48550/arxiv.1902.02197openalex-snapshot
Ramsey properties of randomly perturbed dense graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.02883openalex-snapshot
A Natural Extension of the BK Inequality
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09208openalex-snapshot
An efficient container lemma
inferred← citeshttps://doi.org/10.48550/arxiv.2010.00658openalex-snapshot
Upper Tails of Subgraph Counts in Sparse Regular Graphs
inferred← citeshttps://doi.org/10.5281/zenodo.10428949openalex-snapshot
Logarithmic Representability of Integers as k-Sums
inferred← citeshttps://doi.org/10.5555/1283383.1283435openalex-snapshot
Online vertex colorings of random graphs without monochromatic subgraphs
inferred← citeshttps://doi.org/10.5555/1496770.1496795openalex-snapshot
Almost all hypergraphs without Fano planes are bipartite
inferred← citeshttps://doi.org/10.5555/2095116.2095153openalex-snapshot
Concentration and moment inequalities for polynomials of independent random variables
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96089openalex-snapshot
Random combinatorial structures with low dependencies : existence and enumeration
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.