On the public citation graph

Characterizations of 1-Way Quantum Finite Automata

https://doi.org/10.1137/s0097539799353443
0 signed · 163 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-07407-4_23openalex-snapshot
Piecewise testable events
inferredcites →https://doi.org/10.1007/3-540-18088-5_19openalex-snapshot
On the languages accepted by finite reversible automata
inferredcites →https://doi.org/10.1007/3-540-44693-1_7openalex-snapshot
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
inferredcites →https://doi.org/10.1007/3-540-48686-0_17openalex-snapshot
Probabilities to Accept Languages by Quantum Finite Automata
inferredcites →https://doi.org/10.1007/978-0-387-75477-2_20openalex-snapshot
The Banach-Tarski Paradox
inferredcites →https://doi.org/10.1007/978-1-4899-0471-3openalex-snapshot
Matrix Theory: A Second Course
inferredcites →https://doi.org/10.1007/bf01746516openalex-snapshot
Remarks on algebraic decomposition of automata
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/c2013-0-11297-4openalex-snapshot
Introduction to Probabilistic Automata
inferredcites →https://doi.org/10.1016/s0019-9958(63)90290-0openalex-snapshot
Probabilistic automata
inferredcites →https://doi.org/10.1016/s0304-3975(98)00191-1openalex-snapshot
Quantum automata and quantum grammars
inferredcites →https://doi.org/10.1109/sfcs.1997.646094openalex-snapshot
On the power of quantum finite state automata
inferredcites →https://doi.org/10.1109/sfcs.1998.743469openalex-snapshot
1-way quantum finite automata: strengths, weaknesses and generalizations
inferredcites →https://doi.org/10.1109/sffcs.1999.814608openalex-snapshot
Optimal lower bounds for quantum automata and random access codes
inferredcites →https://doi.org/10.1137/s0097539796300921openalex-snapshot
Quantum Complexity Theory
inferredcites →https://doi.org/10.1145/167088.167097openalex-snapshot
Quantum complexity theory
inferredcites →https://doi.org/10.1145/301250.301347openalex-snapshot
Dense quantum coding and a lower bound for 1-way quantum automata
inferredcites →https://doi.org/10.1145/322017.322031openalex-snapshot
Word Problems Solvable in Logspace

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4348641openalex-extracted
inferred← citeshttps://doi.org/10.1007/11505877_7openalex-snapshot
Complexity of Quantum Uniform and Nonuniform Automata
inferred← citeshttps://doi.org/10.1007/11549345_2openalex-snapshot
Knot Theory, Jones Polynomial and Quantum Computing
inferred← citeshttps://doi.org/10.1007/11605157_1openalex-snapshot
Languages Recognizable by Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/11611257_22openalex-snapshot
Quantum Finite Automata and Logics
inferred← citeshttps://doi.org/10.1007/11809678_11openalex-snapshot
Varieties Generated by Certain Models of Reversible Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-44411-4_22openalex-snapshot
Quantum Pushdown Automata
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_9openalex-snapshot
On the Lower Bounds for One-Way Quantum Automata
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_8openalex-snapshot
On Computational Power of Quantum Branching Programs
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_7openalex-snapshot
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_1openalex-snapshot
Quantum Computing: 1-Way Quantum Automata
inferred← citeshttps://doi.org/10.1007/3-540-45446-2_8openalex-snapshot
Upper Bounds on the Size of One-Way Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_61openalex-snapshot
Probabilistic Reversible Automata and Quantum Automata
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_24openalex-snapshot
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-46011-x_1openalex-snapshot
Automata: From Uncertainty to Quantum
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_17openalex-snapshot
Probabilities to Accept Languages by Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-04070-3_21openalex-snapshot
Classically Time-Controlled Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-13435-8_10openalex-snapshot
Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice
inferred← citeshttps://doi.org/10.1007/978-3-030-23247-4_22openalex-snapshot
How Does Adiabatic Quantum Computation Fit into Quantum Automata Theory?
inferred← citeshttps://doi.org/10.1007/978-3-030-68195-1_1openalex-snapshot
On Language Varieties Without Boolean Operations
inferred← citeshttps://doi.org/10.1007/978-3-031-02516-7openalex-snapshot
High Level Structures for Quantum Computing
inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_16openalex-snapshot
Energy Complexity of Regular Language Recognition
inferred← citeshttps://doi.org/10.1007/978-3-031-16336-4_18openalex-snapshot
Mirrors and Memory in Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_1openalex-snapshot
Energy Complexity of Computation
inferred← citeshttps://doi.org/10.1007/978-3-032-31176-4_12openalex-snapshot
Measure Many Quantum Finite Automata on Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-319-04921-2_49openalex-snapshot
On the State Complexity of Semi-quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-08846-4_6openalex-snapshot
On the Power of One-Way Automata with Quantum and Classical States
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_12openalex-snapshot
Complexity of Promise Problems on Classical and Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_18openalex-snapshot
From Quantum Query Complexity to State Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-13749-0_13openalex-snapshot
Quantum and Reversible Verification of Proofs Using Constant Memory Space
inferred← citeshttps://doi.org/10.1007/978-3-319-19225-3_24openalex-snapshot
Quantum State Complexity of Formal Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_29openalex-snapshot
Theory of One Tape Linear Time Turing Machines
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_9openalex-snapshot
Algebraic Results on Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-30500-2_21openalex-snapshot
An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-45208-9_8openalex-snapshot
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_9openalex-snapshot
Multi-letter Reversible and Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_2openalex-snapshot
Various Aspects of Finite Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-87442-3_1openalex-snapshot
Some Observations on Two-Way Finite Automata with Quantum and Classical States
inferred← citeshttps://doi.org/10.1007/978-3-540-88282-4_34openalex-snapshot
Lower Bounds for Generalized Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_33openalex-snapshot
Languages Recognized with Unbounded Error by Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13523-1_14openalex-snapshot
Postselection Finite Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-14932-0_1openalex-snapshot
Revisiting the Power and Equivalence of One-Way Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_33openalex-snapshot
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-24897-9_7openalex-snapshot
Quantum Automata Theory – A Review
inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_45openalex-snapshot
One-Way Reversible and Quantum Finite Automata with Advice
inferred← citeshttps://doi.org/10.1007/978-3-642-31464-3_11openalex-snapshot
Parallel Quantum Algorithm for Finding the Consistency of Saaty’s Matrices
inferred← citeshttps://doi.org/10.1007/978-3-642-31644-9_19openalex-snapshot
One-Way Finite Automata with Quantum and Classical States
inferred← citeshttps://doi.org/10.1007/978-3-642-39074-6_4openalex-snapshot
Size Lower Bounds for Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-46078-8_29openalex-snapshot
Quantum Pushdown Automata with a Garbage Tape
inferred← citeshttps://doi.org/10.1007/978-981-97-6957-5_3openalex-snapshot
Exploring Quantum Automata and Grammars
inferred← citeshttps://doi.org/10.1007/s00224-005-1263-xopenalex-snapshot
Algebraic Results on Quantum Automata
inferred← citeshttps://doi.org/10.1007/s00236-011-0139-6openalex-snapshot
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
inferred← citeshttps://doi.org/10.1007/s10773-010-0582-0openalex-snapshot
Two-Tape Finite Automata with Quantum and Classical States
inferred← citeshttps://doi.org/10.1007/s10773-018-3983-0openalex-snapshot
Quantum ω-Automata over Infinite Words and Their Relationships
inferred← citeshttps://doi.org/10.1007/s10773-022-04974-6openalex-snapshot
Characterization of Tree Automata Based on Quantum Logic
inferred← citeshttps://doi.org/10.1007/s10849-019-09302-6openalex-snapshot
On Relation Between Linear Temporal Logic and Quantum Finite Automata
inferred← citeshttps://doi.org/10.1007/s11047-009-9154-8openalex-snapshot
Trace monoids with idempotent generators and measure-only quantum automata
inferred← citeshttps://doi.org/10.1007/s11047-014-9441-xopenalex-snapshot
Simulation methods for quantum walks on graphs applied to formal language recognition
inferred← citeshttps://doi.org/10.1007/s11047-015-9511-8openalex-snapshot
More on quantum, stochastic, and pseudo stochastic languages with few states
inferred← citeshttps://doi.org/10.1007/s11128-008-0083-8openalex-snapshot
Some algebraic properties of measure-once two-way quantum finite automata
inferred← citeshttps://doi.org/10.1007/s11704-008-0022-yopenalex-snapshot
An overview of quantum computation models: quantum automata
inferred← citeshttps://doi.org/10.1016/b978-0-44-327704-7.00010-4openalex-snapshot
Quantum computing models
inferred← citeshttps://doi.org/10.1016/j.ic.2003.11.003openalex-snapshot
Automata theory based on quantum logic: some characterizations
inferred← citeshttps://doi.org/10.1016/j.ic.2011.01.008openalex-snapshot
Unbounded-error quantum computation with small space bounds
inferred← citeshttps://doi.org/10.1016/j.ic.2012.07.002openalex-snapshot
On the complexity of minimizing probabilistic and quantum automata
inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.003openalex-snapshot
One-way reversible and quantum finite automata with advice
inferred← citeshttps://doi.org/10.1016/j.ic.2015.02.003openalex-snapshot
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104694openalex-snapshot
How does adiabatic quantum computation fit into quantum automata theory?
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104783openalex-snapshot
Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104916openalex-snapshot
Eilenberg's variety theorem without Boolean operations
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.08.006openalex-snapshot
A probabilistic model of computing with words
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.12.001openalex-snapshot
An application of quantum finite automata to interactive proof systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.01.004openalex-snapshot
Another approach to the equivalence of measure-many one-way quantum finite automata and its application
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.06.008openalex-snapshot
Exponentially more concise quantum recognition of non-RMM regular languages
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.01.001openalex-snapshot
On hybrid models of quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.08.004openalex-snapshot
Equivalence checking of quantum finite-state machines
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.05.002openalex-snapshot
On injectivity of quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103659openalex-snapshot
State complexity of one-way quantum finite automata together with classical states
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.08.007openalex-snapshot
Characterizations of quantum automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.034openalex-snapshot
Quantum versus deterministic counter automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.032openalex-snapshot
Small size quantum automata recognizing some regular languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.042openalex-snapshot
Some formal tools for analyzing quantum automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.001openalex-snapshot
Determination of equivalence between quantum sequential machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.026openalex-snapshot
Automata theory based on quantum logic: Reversibilities and pushdown automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.037openalex-snapshot
Quantum automata for some multiperiodic languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.023openalex-snapshot
Quantum inductive inference by finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.021openalex-snapshot
Determining the equivalence for one-way quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.05.006openalex-snapshot
Interference automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.026openalex-snapshot
A note on quantum sequential machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.029openalex-snapshot
Efficient probability amplification in two-way quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.042openalex-snapshot
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.03.040openalex-snapshot
Hierarchy and equivalence of multi-letter quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.08.031openalex-snapshot
Theory of one-tape linear-time Turing machines
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.10.021openalex-snapshot
Characterizations of one-way general quantum finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.005openalex-snapshot
State succinctness of two-way finite automata with quantum and classical states
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.004openalex-snapshot
Size lower bounds for quantum automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.045openalex-snapshot
Quantum finite automata: Advances on Bertoni's ideas
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114291openalex-snapshot
Energy complexity of regular languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114740openalex-snapshot
Quantum Büchi automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00138-xopenalex-snapshot
Two-way finite automata with quantum and classical states
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00393-6openalex-snapshot
Exact results for accepting probabilities of quantum automata
inferred← citeshttps://doi.org/10.1017/s0960129523000373openalex-snapshot
Learning quantum finite automata with queries
inferred← citeshttps://doi.org/10.1051/ita/2012018openalex-snapshot
Superiority of one-way and realtime quantum machines
inferred← citeshttps://doi.org/10.1051/ita/2014003openalex-snapshot
On the state complexity of semi-quantum finite automata
inferred← citeshttps://doi.org/10.1051/ita:2001106openalex-snapshot
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
inferred← citeshttps://doi.org/10.1051/ita:2002014openalex-snapshot
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
inferred← citeshttps://doi.org/10.1051/ita:2006007openalex-snapshot
Quantum finite automata with control language
inferred← citeshttps://doi.org/10.1093/comjnl/bxae089openalex-snapshot
Classically time-controlled quantum automata: definition and properties
inferred← citeshttps://doi.org/10.1103/physrevresearch.2.013089openalex-snapshot
Photonic realization of a quantum finite automaton
inferred← citeshttps://doi.org/10.1109/icccas.2004.1345943openalex-snapshot
Regular quantum grammars and regular grammars
inferred← citeshttps://doi.org/10.1109/icqnm.2010.22openalex-snapshot
On the Weakness of One-Way Quantum Pushdown Automata
inferred← citeshttps://doi.org/10.1117/12.683111openalex-snapshot
On computational power of classical and quantum branching programs
inferred← citeshttps://doi.org/10.1137/s0097539703425861openalex-snapshot
Decidable and Undecidable Problems about Quantum Automata
inferred← citeshttps://doi.org/10.1142/s0129054103002060openalex-snapshot
GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0129054112500141openalex-snapshot
SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES
inferred← citeshttps://doi.org/10.1142/s0129054115400055openalex-snapshot
On the Power of One-Way Automata with Quantum and Classical States
inferred← citeshttps://doi.org/10.1142/s0129054115500215openalex-snapshot
Potential of Quantum Finite Automata with Exact Acceptance
inferred← citeshttps://doi.org/10.1142/s0129054118500132openalex-snapshot
Quantum Pushdown Automata with Garbage Tape
inferred← citeshttps://doi.org/10.1142/s0129054124430032openalex-snapshot
Latvian Quantum Finite State Automata for Unary Languages
inferred← citeshttps://doi.org/10.1142/s0218271826500513openalex-snapshot
Decidability, observational bridges and finite-information quantum gravity
inferred← citeshttps://doi.org/10.13130/bianchi-maria-paola_phd2013-02-26openalex-snapshot
DESCRIPTIONAL COMPLEXITY OF CLASSICAL AND QUANTUM UNARY AUTOMATA
inferred← citeshttps://doi.org/10.2200/s00422ed1v01y201205qmc006openalex-snapshot
High-level Structures for Quantum Computing
inferred← citeshttps://doi.org/10.3233/fi-2010-333openalex-snapshot
Behaviours of Unary Quantum Automata
inferred← citeshttps://doi.org/10.3233/fi-2014-1105openalex-snapshot
Algebraic Characterization of the Class of Languages Recognized by Measure Only Quantum Automata
inferred← citeshttps://doi.org/10.3389/fphy.2023.1162973openalex-snapshot
Quaternionic quantum Turing machines
inferred← citeshttps://doi.org/10.3390/app11188768openalex-snapshot
An Enhanced Photonic Quantum Finite Automaton
inferred← citeshttps://doi.org/10.3390/app14041490openalex-snapshot
Unary Quantum Finite State Automata with Control Language
inferred← citeshttps://doi.org/10.3390/books978-3-0365-3311-7openalex-snapshot
Basics and Applications in Quantum Optics
inferred← citeshttps://doi.org/10.4018/978-1-4666-1574-8.ch004openalex-snapshot
Quantum Automata with Open Time Evolution
inferred← citeshttps://doi.org/10.4018/jncr.2010010104openalex-snapshot
Quantum Automata with Open Time Evolution
inferred← citeshttps://doi.org/10.4171/automata-1/39openalex-snapshot
Automata and quantum computing
inferred← citeshttps://doi.org/10.4204/eptcs.388.8openalex-snapshot
Latvian Quantum Finite State Automata for Unary Languages
inferred← citeshttps://doi.org/10.4236/jqis.2023.133009openalex-snapshot
One Hot Encoding Synthesis of Quantum Automata from Flowcharts
inferred← citeshttps://doi.org/10.48550/arxiv.0807.0476openalex-snapshot
Research report: State complexity of operations on two-way quantum finite automata
inferred← citeshttps://doi.org/10.48550/arxiv.0812.1061openalex-snapshot
Decidability of the Equivalence of Multi-Letter Quantum Finite Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1102.0378openalex-snapshot
Classical and quantum computation with small space bounds (PhD thesis)
inferred← citeshttps://doi.org/10.48550/arxiv.1102.0666openalex-snapshot
Probabilistic and quantum finite automata with postselection
inferred← citeshttps://doi.org/10.48550/arxiv.1203.0113openalex-snapshot
On equivalence, languages equivalence and minimization of multi-letter and multi-letter measure-many quantum automata
inferred← citeshttps://doi.org/10.48550/arxiv.1301.3931openalex-snapshot
(Extended Version) Algebraic Characterization of the Class of Languages recognized by Measure Only Quantum Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07992openalex-snapshot
Quantum finite automata: survey, status and research directions
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0110005openalex-snapshot
Two-way Quantum One-counter Automata
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0604085openalex-snapshot
A Polynomial-Time Algorithm for the Equivalence between Quantum Sequential Machines
inferred← citeshttps://doi.org/10.5281/zenodo.200730openalex-snapshot
FIGURE 5 in Two new species of protoplophorid mites (Acari: Oribatida: Protoplophoridae) from Thailand
inferred← citeshttps://doi.org/10.82308/31455openalex-snapshot
Applications of algebraic automata theory to quantum finite automata
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.