On the public citation graph

Polymorphic processor arrays

0 signed · 89 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/978-1-4684-5511-3_32openalex-snapshot
The Gated Interconnection Network for Dynamic Programming
inferredcites →https://doi.org/10.1007/978-3-642-82150-9openalex-snapshot
Computer Architectures for Spatially Distributed Data
inferredcites →https://doi.org/10.1007/bf01215876openalex-snapshot
Parallel computer vision on Polymorphic Torus architecture
inferredcites →https://doi.org/10.1016/0165-6074(88)90140-8openalex-snapshot
A VLSI implementation of polymorphic-torus architecture
inferredcites →https://doi.org/10.1016/0165-6074(90)90233-yopenalex-snapshot
Partitioned algorithms for gaussian elimination on reconfigurable processor arrays
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0196-6774(82)90013-xopenalex-snapshot
An O(n2log n) parallel max-flow algorithm
inferredcites →https://doi.org/10.1016/0743-7315(89)90022-1openalex-snapshot
Connection autonomy in SIMD computers: A VLSI implementation
inferredcites →https://doi.org/10.1016/0743-7315(90)90089-8openalex-snapshot
BLITZEN: A highly integrated massively parallel machine
inferredcites →https://doi.org/10.1038/scientificamerican0687-108openalex-snapshot
The Connection Machine
inferredcites →https://doi.org/10.1109/12.29479openalex-snapshot
Polymorphic-torus network
inferredcites →https://doi.org/10.1109/71.80177openalex-snapshot
Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems
inferredcites →https://doi.org/10.1109/cmpcon.1990.63648openalex-snapshot
The MasPar MP-1 architecture
inferredcites →https://doi.org/10.1109/tc.1983.1676331openalex-snapshot
Mesh-Connected Computers with Broadcasting
inferredcites →https://doi.org/10.7551/mitpress/1102.003.0014openalex-snapshot
Meshes with Reconfigurable Buses
inferredcites →https://doi.org/10.7551/mitpress/4468.001.0001openalex-snapshot
The Massively Parallel Processor

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0047openalex-snapshot
On the Power of Segmenting and Fusing Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0128openalex-snapshot
A Parallel Algorithm for Global Routing Using an Associative Processor
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1385openalex-snapshot
Constant Time Graph Algorithms on the Reconfigurable Multiple Bus Machine
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1421openalex-snapshot
Time-Optimal Proximity Graph Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1810openalex-snapshot
Using Bus Linearization to Scale the Reconfigurable Mesh
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_26openalex-snapshot
Efficient List Ranking Algorithms on Reconfigurable Mesh
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_37openalex-snapshot
Cellular Automata with Dynamically Reconfigurable Buses
inferred← citeshttps://doi.org/10.1007/978-1-4614-3558-7_13openalex-snapshot
R-Mesh Simulator Using C++
inferred← citeshttps://doi.org/10.1007/bfb0037206openalex-snapshot
Virtual parallelism allows relaxing the synchronization constraints of SIMD computing paradigm
inferred← citeshttps://doi.org/10.1007/bfb0097946openalex-snapshot
Improved scaling simulation of the general reconfigurable mesh
inferred← citeshttps://doi.org/10.1007/s002240000105openalex-snapshot
Efficient List Ranking on the Reconfigurable Mesh, with Applications
inferred← citeshttps://doi.org/10.1007/s00453-001-0031-9openalex-snapshot
Parallel Implementation of a Class of Adaptive Signal Processing Applications
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00160-8openalex-snapshot
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1016/0031-3203(95)00108-5openalex-snapshot
Optimal computing hough transform on a reconfigurable array of processors with wider bus networks
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90162-eopenalex-snapshot
Image component labeling on reconfigurable processor array
inferred← citeshttps://doi.org/10.1016/b978-0-444-81784-6.50040-3openalex-snapshot
Introducing Execution Autonomy in the SIMD Computing Paradigm
inferred← citeshttps://doi.org/10.1016/j.jpdc.2003.07.005openalex-snapshot
Some results on the computation of Voronoi diagrams on a mesh with multiple broadcasting
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.05.010openalex-snapshot
Scheduling light-trails on WDM rings
inferred← citeshttps://doi.org/10.1016/s0031-3203(96)00151-3openalex-snapshot
A time-optimal solution to a classification problem in ordered functional domains, with applications
inferred← citeshttps://doi.org/10.1016/s0031-3203(96)00175-6openalex-snapshot
Image processing on a reconfigurable array of processors with wider bus networks
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00060-0openalex-snapshot
Adaptive AT2 optimal algorithms on reconfigurable meshes
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00164-3openalex-snapshot
Degree of scalability: scalable reconfigurable mesh algorithms for multiple addition and matrix–vector multiplication
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00118-7openalex-snapshot
Time and work optimal simulation of basic reconfigurable meshes on hypercubes
inferred← citeshttps://doi.org/10.1109/5.503301openalex-snapshot
The implementation of P/sup 3/I, a parallel architecture for video real-time processing: a case study
inferred← citeshttps://doi.org/10.1109/71.506693openalex-snapshot
Square meshes are not optimal for convex hull computation
inferred← citeshttps://doi.org/10.1109/71.569651openalex-snapshot
Time-optimal domain-specific querying on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.615443openalex-snapshot
An optimal algorithm for the angle-restricted all nearest neighbor problem on the reconfigurable mesh, with applications
inferred← citeshttps://doi.org/10.1109/71.629485openalex-snapshot
Podality-based time-optimal computations on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.689443openalex-snapshot
An efficient algorithm for row minima computations on basic reconfigurable meshes
inferred← citeshttps://doi.org/10.1109/71.722220openalex-snapshot
Scaling simulation of the fusing-restricted reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/71.730522openalex-snapshot
Time- and VLSI-optimal sorting on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.735954openalex-snapshot
Constant-time algorithms for constrained triangulations on reconfigurable meshes
inferred← citeshttps://doi.org/10.1109/71.737693openalex-snapshot
Optimal parallel algorithms for finding proximate points, with applications
inferred← citeshttps://doi.org/10.1109/71.737694openalex-snapshot
An O((log log n)/sup 2/) time algorithm to compute the convex hull of sorted points on reconfigurable meshes
inferred← citeshttps://doi.org/10.1109/71.755826openalex-snapshot
The mesh with hybrid buses: an efficient parallel architecture for digital geometry
inferred← citeshttps://doi.org/10.1109/71.877941openalex-snapshot
Scalable hardware-algorithms for binary prefix sums
inferred← citeshttps://doi.org/10.1109/71.954618openalex-snapshot
Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications
inferred← citeshttps://doi.org/10.1109/83.784435openalex-snapshot
Entropy thresholding and its parallel algorithm on the reconfigurable array of processors with wider bus networks
inferred← citeshttps://doi.org/10.1109/camp.1993.622499openalex-snapshot
Polymorphic processor array for constant time image compression and decompression
inferred← citeshttps://doi.org/10.1109/camp.1995.521052openalex-snapshot
Euclidean distance transform on Polymorphic Processor Array
inferred← citeshttps://doi.org/10.1109/empdp.1994.592488openalex-snapshot
A Simulator For Reconfigurable Massively Parallel Architectures
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380474openalex-snapshot
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1109/iccd.1991.139887openalex-snapshot
Transitive closure and graph component labeling on realistic processor arrays based on reconfigurable mesh network
inferred← citeshttps://doi.org/10.1109/iciap.1999.797601openalex-snapshot
Euclidean distance transform on a dedicated architecture based on a reconfigurable mesh network
inferred← citeshttps://doi.org/10.1109/icpads.1997.652546openalex-snapshot
Constant time algorithms for computing the contour of maximal elements on the reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/icpp.1993.168openalex-snapshot
Square Meshes are not Optimal for Convex Hull Computation
inferred← citeshttps://doi.org/10.1109/icpp.1993.97openalex-snapshot
Hardware Support for Fast Reconfigurability in Progress Arrays
inferred← citeshttps://doi.org/10.1109/icpp.1994.78openalex-snapshot
Constant Time Graph and Poset Algorithms on the Reconfigurable Multiple Bus Machine
inferred← citeshttps://doi.org/10.1109/icpp.1996.537382openalex-snapshot
An efficient algorithm for row minima computations in monotone matrices
inferred← citeshttps://doi.org/10.1109/icpr.1994.577193openalex-snapshot
Why linear arrays are better image processors
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925202openalex-snapshot
Timings for associative operations on the MASC model
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303175openalex-snapshot
Efficient simulation of the acyclic DR-mesh on the LR-mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370459openalex-snapshot
Constant Time Simulation of an R-Mesh on an LR-Mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161219openalex-snapshot
ARMLang: A language and compiler for programming reconfigurable mesh many-cores
inferred← citeshttps://doi.org/10.1109/ipps.1996.508135openalex-snapshot
Integer and floating point matrix-vector multiplication on the reconfigurable mesh
inferred← citeshttps://doi.org/10.1109/ipps.1996.508136openalex-snapshot
Some image processing algorithms on a RAP with wider bus networks
inferred← citeshttps://doi.org/10.1109/ipps.1997.580983openalex-snapshot
Geometric data structures on a reconfigurable mesh, with applications
inferred← citeshttps://doi.org/10.1109/ipps.1998.669936openalex-snapshot
A scalable VLSI architecture for binary prefix sums
inferred← citeshttps://doi.org/10.1109/ispan.1996.508956openalex-snapshot
Optimal parallel algorithms for computing the chessboard distance transform and the medial axis transform on RAP
inferred← citeshttps://doi.org/10.1109/ispan.1996.509032openalex-snapshot
Performance analysis for an important class of parallel-processing networks
inferred← citeshttps://doi.org/10.1109/ispan.1997.645089openalex-snapshot
On the power of the mesh with hybrid buses
inferred← citeshttps://doi.org/10.1109/mpcs.1994.367079openalex-snapshot
Tr-machine architecture
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343286openalex-snapshot
Fault tolerance properties of mesh-connected parallel computers with separable row/column buses
inferred← citeshttps://doi.org/10.1109/tc.2013.174openalex-snapshot
An FPGA-Based Reconfigurable Mesh Many-Core
inferred← citeshttps://doi.org/10.1109/tpds.2003.1233714openalex-snapshot
An efficient parallel prefix sums architecture with domino logic
inferred← citeshttps://doi.org/10.1142/s0129054104002558openalex-snapshot
SIMULATION OF MESHES WITH SEPARABLE BUSES BY MESHES WITH MULTIPLE PARTITIONED BUSES
inferred← citeshttps://doi.org/10.1142/s0129054105002863openalex-snapshot
EFFICIENT SIMULATION OF AN ACYCLIC DIRECTED RECONFIGURABLE MODEL ON AN UNDIRECTED RECONFIGURABLE MODEL
inferred← citeshttps://doi.org/10.1142/s0129054105002875openalex-snapshot
DESIGNING FAULT TOLERANT ALGORITHMS FOR RECONFIGURABLE MESHES
inferred← citeshttps://doi.org/10.1142/s0129054108006315openalex-snapshot
SIMULATING AN R-MESH ON AN LR-MESH IN CONSTANT TIME
inferred← citeshttps://doi.org/10.1145/341800.341825openalex-snapshot
An efficient self-simulation algorithm for reconfigurable meshes
inferred← citeshttps://doi.org/10.1155/1999/29035openalex-snapshot
Investigation of Various Mesh ArchitecturesWith Broadcast Buses for High‐Performance Computing
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.7081openalex-snapshot
Scaling Simulations of Reconfigurable Meshes.
inferred← citeshttps://doi.org/10.48550/arxiv.1112.6254openalex-snapshot
Scheduling Light-trails in WDM Rings
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.