On the public citation graph

FIGURE 5 in Two new species of protoplophorid mites (Acari: Oribatida: Protoplophoridae) from Thailand

https://doi.org/10.5281/zenodo.200730
0 signed · 21 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.1006/inco.2000.2911openalex-snapshot
Regular Languages Accepted by Quantum Automata
inferredcites →https://doi.org/10.1007/3-540-08342-1_7openalex-snapshot
Some recursively unsolvable problems relating to isolated cutpoints in probabilistic automata
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/978-3-540-45208-9_8openalex-snapshot
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages
inferredcites →https://doi.org/10.1007/bf02650179openalex-snapshot
Simulating physics with computers
inferredcites →https://doi.org/10.1016/j.jsc.2004.11.008openalex-snapshot
Quantum automata and algebraic groups
inferredcites →https://doi.org/10.1016/j.tcs.2005.03.032openalex-snapshot
Small size quantum automata recognizing some regular languages
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.1016/s0747-7171(88)80003-8openalex-snapshot
The complexity of linear problems in fields
inferredcites →https://doi.org/10.1051/ita:2002014openalex-snapshot
On the Size of One-way Quantum Finite Automata with Periodic Behaviors
inferredcites →https://doi.org/10.1051/ita:2005007openalex-snapshot
Some decision problems on integer matrices
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1098/rspa.1985.0070openalex-snapshot
Quantum theory, the Church–Turing principle and the universal quantum computer
inferredcites →https://doi.org/10.1109/sfcs.1998.743469openalex-snapshot
1-way quantum finite automata: strengths, weaknesses and generalizations
inferredcites →https://doi.org/10.1137/0212019openalex-snapshot
Properties of Finite and Pushdown Transducers
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539796300921openalex-snapshot
Quantum Complexity Theory
inferredcites →https://doi.org/10.1137/s0097539799353443openalex-snapshot
Characterizations of 1-Way Quantum Finite Automata
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search

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.6189246zenodo-depositor-declared
Protoplophora takensis Fuangarworn, 2011, sp. nov.
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.