On the public citation graph
Square meshes are not always optimal
0 signed · 71 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.1006/jpdc.1996.1244openalex-snapshot
Implementation of Decentralized Load Sharing in Networked Workstations Using the Condor Package
inferredcites →https://doi.org/10.1007/3-540-16811-7_156openalex-snapshot
Hmesh: A vlsi architecture for parallel processing
inferredcites →https://doi.org/10.1016/0045-7949(79)90069-5openalex-snapshot
A multi-microprocessor system for finite element structural analysis
inferredcites →https://doi.org/10.1016/0743-7315(87)90003-7openalex-snapshot
Array processor with multiple broadcasting
inferredcites →https://doi.org/10.1109/jrproc.1958.286755openalex-snapshot
A Computer Oriented toward Spatial Problems
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.1973.223653openalex-snapshot
A Parallel Picture Processing Machine
inferredcites →https://doi.org/10.1109/tc.1968.226908openalex-snapshot
Cellular Interconnection Arrays
inferredcites →https://doi.org/10.1109/tc.1978.1674969openalex-snapshot
An Analysis of Computational Cost in Image Processing: A Case Study
inferredcites →https://doi.org/10.1109/tc.1980.1675566openalex-snapshot
A Systematically Designed Binary Array Processor
inferredcites →https://doi.org/10.1109/tc.1983.1676331openalex-snapshot
Mesh-Connected Computers with Broadcasting
inferredcites →https://doi.org/10.1109/tc.1984.1676405openalex-snapshot
Finding Maximum on an Array Processor with a Global Bus
inferredcites →https://doi.org/10.1109/tc.1986.1676658openalex-snapshot
Optimal Bounds for Finding Maximum on Array of Processors with k Global Buses
inferredcites →https://doi.org/10.1145/1457769.1457836openalex-snapshot
A computer oriented toward spatial problems
inferredcites →https://doi.org/10.1145/322047.322057openalex-snapshot
Some Complexity Results for Matrix Computations on Parallel Processors
inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot
Sorting on a mesh-connected parallel computer
inferredcites →https://doi.org/10.1145/800135.804417openalex-snapshot
Fast parallel processing array algorithms for some graph problems(Preliminary Version)
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.1994.1074openalex-snapshot
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0027openalex-snapshot
Routing with Locality on Meshes with Buses
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0049openalex-snapshot
A Nonoblivious Bus Access Scheme Yields an Optimal Partial Sorting Algorithm
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0095openalex-snapshot
Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1421openalex-snapshot
Time-Optimal Proximity Graph Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/0-387-29026-5_16openalex-snapshot
Topological Properties of Interconnection Networks
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_130openalex-snapshot
The power of reconfiguration
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_45openalex-snapshot
A unifying look at semigroup computations on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_96openalex-snapshot
Time-optimal nearest-neighbor computations on enhanced meshes
inferred← citeshttps://doi.org/10.1007/bf01990339openalex-snapshot
Selection on rectangular meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1007/bf02247408openalex-snapshot
A parametric algorithm for semigroup computation on mesh with buses
inferred← citeshttps://doi.org/10.1007/bf02684474openalex-snapshot
Medial axis transform on mesh-connected computers with hyperbus broadcasting
inferred← citeshttps://doi.org/10.1007/bfb0002743openalex-snapshot
Finding a pair on a mesh with multiple broadcasting is hard
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90208-qopenalex-snapshot
A lower bound for permutation routing on two-dimensional bused meshes
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/0096-0551(94)90013-2openalex-snapshot
Parallel recognition and parsing on mesh connected computers with multiple broadcasting
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90084-mopenalex-snapshot
The power of reconfiguration
inferred← citeshttps://doi.org/10.1016/1049-9660(92)90032-xopenalex-snapshot
Image analysis and computer vision: 1991
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/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/s0141-9331(05)80005-5openalex-snapshot
A constant time algorithm for finding maxima on reconfigurable bus systems using fewer processors
inferred← citeshttps://doi.org/10.1016/s0141-9331(99)00039-3openalex-snapshot
Computing robot Jacobians on meshes with multiple buses
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00455-5openalex-snapshot
Analysis of permutation routing algorithms
inferred← citeshttps://doi.org/10.1016/s1383-7621(97)00009-xopenalex-snapshot
Log-time delay consideration on mesh with multiple buses
inferred← citeshttps://doi.org/10.1023/a:1008234629602openalex-snapshot
Efficient Parallel Manipulations of IBB Coded Images on Meshes with Multiple Broadcasting
inferred← citeshttps://doi.org/10.1080/10637199608915557openalex-snapshot
TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING
inferred← citeshttps://doi.org/10.1109/12.544491openalex-snapshot
Fast gossiping on mesh-bus computers
inferred← citeshttps://doi.org/10.1109/71.246069openalex-snapshot
Optimal architectures and algorithms for mesh-connected parallel computers with separable row/column buses
inferred← citeshttps://doi.org/10.1109/71.342133openalex-snapshot
Prefix computations on a generalized mesh-connected computer with multiple buses
inferred← citeshttps://doi.org/10.1109/71.395398openalex-snapshot
Time-optimal visibility-related algorithms on meshes with multiple broadcasting
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.629485openalex-snapshot
Podality-based time-optimal computations on enhanced meshes
inferred← citeshttps://doi.org/10.1109/71.730522openalex-snapshot
Time- and VLSI-optimal sorting on enhanced 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.914773openalex-snapshot
An improved generalization of mesh-connected computers with multiple buses
inferred← citeshttps://doi.org/10.1109/asap.1995.522904openalex-snapshot
Time-optimal ranking algorithms on sorted matrices
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/icpp.1993.168openalex-snapshot
Square Meshes are not Optimal for Convex Hull Computation
inferred← citeshttps://doi.org/10.1109/ipdps.2000.845992openalex-snapshot
Semigroup and prefix computations on improved generalized mesh-connected computers with multiple buses
inferred← citeshttps://doi.org/10.1109/ipps.1992.223023openalex-snapshot
Optimal aspect ratio and number of separable row/column buses for mesh-connected parallel computers
inferred← citeshttps://doi.org/10.1109/ipps.1994.288313openalex-snapshot
Time-optimal visibility-related algorithms of meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1109/ipps.1994.288314openalex-snapshot
Time-optimal proximity algorithms on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1109/ipps.1996.508131openalex-snapshot
Coping with sparse inputs on enhanced meshes-semigroup computation with COMMON CRCW buses
inferred← citeshttps://doi.org/10.1109/ispan.1994.367143openalex-snapshot
Gossiping on mesh-bus computers by packets
inferred← citeshttps://doi.org/10.1109/ispan.1996.509024openalex-snapshot
A time-optimal solution to planar point location in ordered functional domains, with applications
inferred← citeshttps://doi.org/10.1109/spdp.1994.346104openalex-snapshot
Routing with locality in partitioned-bus meshes
inferred← citeshttps://doi.org/10.1109/spdp.1996.570360openalex-snapshot
A unifying methodology for multiple querying on enhanced meshes
inferred← citeshttps://doi.org/10.1137/s0097539793256879openalex-snapshot
Complexity of Sub-Bus Mesh Computations
inferred← citeshttps://doi.org/10.1145/165231.166116openalex-snapshot
Vector prefix addition on sub-bus mesh computers
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.7190openalex-snapshot
Multiple Bus Networks for Binary -Tree Algorithms.
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.