On the public citation graph
Token relabeling in a tagged token data-flow architecture
0 signed · 38 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.1007/3-540-06859-7_145openalex-snapshot
First version of a data flow procedure language
inferredcites →https://doi.org/10.1016/0141-9331(85)90187-5openalex-snapshot
Computer architecture and parallel processing
inferredcites →https://doi.org/10.1109/12.29463openalex-snapshot
Token relabeling in a tagged token data-flow architecture
inferredcites →https://doi.org/10.1109/mc.1982.1653942openalex-snapshot
A Second Opinion on Data Flow Machines and Languages
inferredcites →https://doi.org/10.1109/mc.1985.1662773openalex-snapshot
Algorithmic Performance of Dataflow Multiprocessors
inferredcites →https://doi.org/10.1109/mc.1986.1663181openalex-snapshot
An Architectural Comparison of Dataflow Systems
inferredcites →https://doi.org/10.1109/tau.1967.1161899openalex-snapshot
What is the fast Fourier transform?
inferredcites →https://doi.org/10.1109/tc.1980.1675474openalex-snapshot
Performance of a Simulated Dataflow Computer
inferredcites →https://doi.org/10.1109/tc.1982.1675945openalex-snapshot
Partitioned Matrix Algorithms for VLSI Arithmetic Systems
inferredcites →https://doi.org/10.1109/tc.1985.6312207openalex-snapshot
A distributed VLSI architecture for efficient signal and data processing
inferredcites →https://doi.org/10.1109/tc.1986.5009426openalex-snapshot
Sructure Handling in Data-Flow Systems
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/17356.17363openalex-snapshot
Graph allocation in static dataflow systems
inferredcites →https://doi.org/10.1145/327070.327368openalex-snapshot
Methods for handling structures in data-flow systems
inferredcites →https://doi.org/10.1145/356869.356873openalex-snapshot
Data-Driven and Demand-Driven Computer Architecture
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470050118.ecse102openalex-snapshot
Dataflow Computers: Their History and Future
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_73openalex-snapshot
Chaotic linear system solvers in a variable-grain data-driven multiprocessor system
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_46openalex-snapshot
Chaotic Linear System Solvers in a Variable-Grain Data-Driven Multiprocessor System
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00021-fopenalex-snapshot
Incorporating input/output operations into dynamic data-flow graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2014.02.001openalex-snapshot
Carrying on the legacy of imperative languages in the future parallel computing era
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60407-6openalex-snapshot
Issues in Dataflow Computing
inferred← citeshttps://doi.org/10.1023/a:1011125419818openalex-snapshot
Enhancing Functional and Irregular Parallelism: Stateful Functions and their Semantics
inferred← citeshttps://doi.org/10.1109/71.113084openalex-snapshot
A hybrid scheme for processing data structures in a dataflow environment
inferred← citeshttps://doi.org/10.1109/hicss.1988.11778openalex-snapshot
Transformation of numerical algorithms for data-flow processing
inferred← citeshttps://doi.org/10.1109/hicss.1990.205188openalex-snapshot
Algorithm design and parallel program development through formal specifications
inferred← citeshttps://doi.org/10.1109/hicss.1992.183203openalex-snapshot
Dynamically partitioned dataflow
inferred← citeshttps://doi.org/10.1109/icapp.1996.562918openalex-snapshot
Parallel history sensitive computations in dataflow architecture
inferred← citeshttps://doi.org/10.1109/icde.1989.47252openalex-snapshot
Parallel computing; one opportunity, four challenges
inferred← citeshttps://doi.org/10.1109/icpp.1996.537168openalex-snapshot
A scalable cache design for I-structures in multithreaded architectures
inferred← citeshttps://doi.org/10.1109/ipps.1991.153797openalex-snapshot
Input/output operations for hybrid data-flow/control-flow systems
inferred← citeshttps://doi.org/10.1109/ipps.1992.222978openalex-snapshot
A functional execution model for a non-dataflow tagged token architecture
inferred← citeshttps://doi.org/10.1109/ipps.1994.288302openalex-snapshot
A direct array injection technique in a fine-grain multithreading execution model
inferred← citeshttps://doi.org/10.1109/spdp.1990.143557openalex-snapshot
Distributed input/output processing in data-driven multiprocessors
inferred← citeshttps://doi.org/10.1109/spdp.1996.570381openalex-snapshot
Extending functional languages with stateful computations
inferred← citeshttps://doi.org/10.1145/109025.109049openalex-snapshot
A scheme to extract run-time parallelism form sequential loops
inferred← citeshttps://doi.org/10.15760/etd.6060openalex-snapshot
Associative processing implemented with content-addressable memories
showing the first 21 of 22 · page through all 22
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.