On the public citation graph
Iterative arrays with direct central control
0 signed · 53 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.1016/s0019-9958(71)90501-8openalex-snapshot
Cellular automata complexity trade-offs
inferredcites →https://doi.org/10.1016/s0022-0000(74)80005-xopenalex-snapshot
1—Way stack automaton with jumps
inferredcites →https://doi.org/10.1109/pgec.1965.264145openalex-snapshot
A One-Dimensional Real-Time Iterative Multiplier
inferredcites →https://doi.org/10.1109/sfcs.1976.25openalex-snapshot
Recognizing certain repetitions and reversals within strings
inferredcites →https://doi.org/10.1109/t-c.1969.222663openalex-snapshot
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
inferredcites →https://doi.org/10.1109/t-c.1971.223238openalex-snapshot
Machine Complexity Versus Interconnection Complexity in Iterative Arrays
inferredcites →https://doi.org/10.1137/0204028openalex-snapshot
Speed of Recognition of Context-Free Languages by Array Automata
inferredcites →https://doi.org/10.1145/321281.321290openalex-snapshot
Generation of Primes by a One-Dimensional Real-Time Iterative Array
inferredcites →https://doi.org/10.1145/321637.321649openalex-snapshot
Deterministic Pushdown Store Machines and Real-Time Computation
inferredcites →https://doi.org/10.1145/321724.321726openalex-snapshot
Real-Time Simulation of Multihead Tape Units
inferredcites →https://doi.org/10.1145/800105.803414openalex-snapshot
New real-time simulations of multihead tape units
inferredcites →https://doi.org/10.1145/800113.803644openalex-snapshot
Real-time algorithms for string-matching and palindrome recognition
inferredcites →https://doi.org/10.1145/800119.803905openalex-snapshot
Observations on nondeterministic multidimensional iterative arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_111openalex-snapshot
Efficient simulations of simple models of parallel computation by time-bounded ATM's and space-bounded TM's
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_20openalex-snapshot
Iterative Arrays with Small Time Bounds
inferred← citeshttps://doi.org/10.1007/3-540-45307-5_2openalex-snapshot
Mesh Algorithms for Multiplication and Division
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_13openalex-snapshot
Iterative arrays with a wee bit alternation
inferred← citeshttps://doi.org/10.1007/3-540-50647-0_112openalex-snapshot
Basic research for cellular processing
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_54openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_14openalex-snapshot
A Systematic Design and Explanation of the Atrubin Multiplier
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_25openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-1-4939-8700-9_54openalex-snapshot
Cellular Automata and Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-11520-7_4openalex-snapshot
Iterative Arrays with Set Storage
inferred← citeshttps://doi.org/10.1007/bf01182773openalex-snapshot
The derivation of on-line algorithms, with an application to finding palindromes
inferred← citeshttps://doi.org/10.1007/bf01187090openalex-snapshot
On the capabilities of systolic systems
inferred← citeshttps://doi.org/10.1007/bf01768472openalex-snapshot
Real-time recognition of substring repetition and reversal
inferred← citeshttps://doi.org/10.1007/bfb0016239openalex-snapshot
Systolic arrays: Characterizations and complexity
inferred← citeshttps://doi.org/10.1016/0022-0000(78)90042-9openalex-snapshot
Palindrome recognition in real time by a multitape turing machine
inferred← citeshttps://doi.org/10.1016/0022-0000(89)90011-1openalex-snapshot
On iterative and cellular tree arrays
inferred← citeshttps://doi.org/10.1016/0167-739x(92)90004-uopenalex-snapshot
On the power of global-bus in mesh-connected architectures
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90091-xopenalex-snapshot
Topological transformations as a tool in the design of systolic networks
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90163-6openalex-snapshot
Two-dimensional iterative arrays: Characterizations and applications
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90116-3openalex-snapshot
Efficient simulations of simple models of parallel computation by time-bounded ATMs and space-bounded TMs
inferred← citeshttps://doi.org/10.1016/0743-7315(85)90034-6openalex-snapshot
Some results concerning linear iterative (systolic) arrays
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00003-5openalex-snapshot
A real-time systolic integer multiplier
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00017-5openalex-snapshot
Mirroring: a technique for pipelining semi-systolic and systolic arrays
inferred← citeshttps://doi.org/10.1109/cmpeur.1989.93458openalex-snapshot
Broadcast-bus elimination without any loss of time efficiency in iterative (cellular or systolic) arrays
inferred← citeshttps://doi.org/10.1109/sfcs.1976.25openalex-snapshot
Recognizing certain repetitions and reversals within strings
inferred← citeshttps://doi.org/10.1109/sfcs.1983.32openalex-snapshot
Lower bounds on the time of probabilistic on-line simulations
inferred← citeshttps://doi.org/10.1109/sfcs.1984.715900openalex-snapshot
Designing Systolic Algorithms Using Sequential Machines
inferred← citeshttps://doi.org/10.1109/tassp.1987.1165233openalex-snapshot
VLSI algorithms for solving recurrence equations and applications
inferred← citeshttps://doi.org/10.1109/tc.1986.5009430openalex-snapshot
Designing Systolic Algorithms Using Sequential Machines
inferred← citeshttps://doi.org/10.1109/tc.1987.5009449openalex-snapshot
Parallel Parsing on a One-Way Array of Finite-State Machines
inferred← citeshttps://doi.org/10.1109/tc.1987.5009453openalex-snapshot
Dictionary Machines on Cube-Class Networks
inferred← citeshttps://doi.org/10.1137/0206035openalex-snapshot
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays
inferred← citeshttps://doi.org/10.1137/0216027openalex-snapshot
On Efficient Simulations of Systolic Arrays by Random-Access Machines
inferred← citeshttps://doi.org/10.1142/9789812704979_0006openalex-snapshot
ITERATIVE ARRAYS WITH LIMITED NONDETERMINISTIC COMMUNICATION CELL
inferred← citeshttps://doi.org/10.1145/113379.113412openalex-snapshot
On the capabilities of systolic systems (extended abstract)
inferred← citeshttps://doi.org/10.1145/130069.130144openalex-snapshot
Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization
inferred← citeshttps://doi.org/10.1145/800105.803414openalex-snapshot
New real-time simulations of multihead tape units
inferred← citeshttps://doi.org/10.1145/800135.804417openalex-snapshot
Fast parallel processing array algorithms for some graph problems(Preliminary Version)
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.