On the public citation graph

The mesh with hybrid buses: an efficient parallel architecture for digital geometry

0 signed · 63 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/jpdc.1994.1074openalex-snapshot
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
inferredcites →https://doi.org/10.1006/jpdc.1995.1078openalex-snapshot
Convexity Problems on Meshes with Multiple Broadcasting
inferredcites →https://doi.org/10.1006/jpdc.1996.0095openalex-snapshot
Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes
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-56891-3_45openalex-snapshot
A unifying look at semigroup computations on meshes with multiple broadcasting
inferredcites →https://doi.org/10.1007/bf01250524openalex-snapshot
Constant time BSR solutions to L1 metric and digital geometry problems
inferredcites →https://doi.org/10.1007/bf01990523openalex-snapshot
Optimal convex hull algorithms on enhanced meshes
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1016/0020-0190(89)90114-2openalex-snapshot
An image algorithm for computing the Hausdorff distance efficiently in linear time
inferredcites →https://doi.org/10.1016/0020-0190(92)90197-4openalex-snapshot
Fast computation of the Euclidian distance maps for binary images
inferredcites →https://doi.org/10.1016/0020-0190(95)00160-8openalex-snapshot
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
inferredcites →https://doi.org/10.1016/0141-9331(91)90041-dopenalex-snapshot
VLSI circuits and systems in silicon
inferredcites →https://doi.org/10.1016/0196-6774(83)90040-8openalex-snapshot
Efficient algorithms for computing the maximum distance between two finite planar sets
inferredcites →https://doi.org/10.1016/0262-8856(89)90037-1openalex-snapshot
Computational morphology
inferredcites →https://doi.org/10.1016/0743-7315(87)90003-7openalex-snapshot
Array processor with multiple broadcasting
inferredcites →https://doi.org/10.1016/0743-7315(91)90123-qopenalex-snapshot
Parallel algorithms for generating the raster representation of straight lines and circles
inferredcites →https://doi.org/10.1016/0743-7315(92)90061-qopenalex-snapshot
Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting
inferredcites →https://doi.org/10.1016/c2009-0-21955-6openalex-snapshot
Digital Picture Processing
inferredcites →https://doi.org/10.1016/s0734-189x(85)80079-7openalex-snapshot
Vision in man and machine
inferredcites →https://doi.org/10.1090/conm/119/15openalex-snapshot
Computational geometry and computer vision
inferredcites →https://doi.org/10.1109/12.21120openalex-snapshot
Mesh computer algorithms for computational geometry
inferredcites →https://doi.org/10.1109/12.73589openalex-snapshot
Square meshes are not always optimal
inferredcites →https://doi.org/10.1109/12.9737openalex-snapshot
Efficient parallel convex hull algorithms
inferredcites →https://doi.org/10.1109/21.17370openalex-snapshot
Bus automata, brains, and mental models
inferredcites →https://doi.org/10.1109/34.42857openalex-snapshot
Image computations on meshes with multiple broadcast
inferredcites →https://doi.org/10.1109/71.224213openalex-snapshot
Polymorphic processor arrays
inferredcites →https://doi.org/10.1109/71.296326openalex-snapshot
A fast selection algorithm for meshes with multiple broadcasting
inferredcites →https://doi.org/10.1109/71.395398openalex-snapshot
Time-optimal visibility-related algorithms on meshes with multiple broadcasting
inferredcites →https://doi.org/10.1109/71.506693openalex-snapshot
Square meshes are not optimal for convex hull computation
inferredcites →https://doi.org/10.1109/71.569651openalex-snapshot
Time-optimal domain-specific querying on enhanced meshes
inferredcites →https://doi.org/10.1109/71.80135openalex-snapshot
Designing efficient parallel algorithms on mech-connected computers with multiple broadcasting
inferredcites →https://doi.org/10.1109/cmpcon.1988.4858openalex-snapshot
The AMT DAP 500
inferredcites →https://doi.org/10.1109/fmpc.1988.47428openalex-snapshot
Fractal graphics and image compression on a SIMD processor
inferredcites →https://doi.org/10.1109/fmpc.1992.234956openalex-snapshot
Distance between images
inferredcites →https://doi.org/10.1109/fmpc.1995.380474openalex-snapshot
Time- and VLSI-optimal convex hull computation on meshes with multiple broadcasting
inferredcites →https://doi.org/10.1109/mcc.1998.736438openalex-snapshot
Parallel Computation: Models And Methods
inferredcites →https://doi.org/10.1109/mwc.2024.10628065openalex-snapshot
IEEE Wireless Communications
inferredcites →https://doi.org/10.1109/tc.1979.1675216openalex-snapshot
Bitonic Sort on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1109/tc.1980.1675684openalex-snapshot
Design of a Massively Parallel Processor
inferredcites →https://doi.org/10.1109/tpami.1981.4767162openalex-snapshot
On the Cellular Convexity of Complexes
inferredcites →https://doi.org/10.1109/tpami.1982.4767221openalex-snapshot
Digital Straight Lines and Convexity of Digital Regions
inferredcites →https://doi.org/10.1117/12.142166openalex-snapshot
Constant-time digital geometry algorithms on the scan model of parallel computation
inferredcites →https://doi.org/10.1117/12.198620openalex-snapshot
Time-optimal solutions for digital geometry algorithms on enhanced meshes
inferredcites →https://doi.org/10.1137/0209058openalex-snapshot
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1142/1492openalex-snapshot
Computer Vision, Models and Inspection
inferredcites →https://doi.org/10.1142/s012905339400024xopenalex-snapshot
CONSTANT TIME DIGITAL GEOMETRY ALGORITHMS ON THE SCAN MODEL OF PARALLEL COMPUTATION
inferredcites →https://doi.org/10.1145/323233.323234openalex-snapshot
Computating the width of a set
inferredcites →https://doi.org/10.1145/359423.359432openalex-snapshot
A linear algorithm for incremental digital display of circular arcs
inferredcites →https://doi.org/10.1177/25.7.330721openalex-snapshot
Segmentation of cervical cell images.
inferredcites →https://doi.org/10.2307/1573081openalex-snapshot
Pattern Classification and Scene Analysis
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1821openalex-snapshot
Optimal Parallel Algorithms for Computer Vision Problems
inferred← citeshttps://doi.org/10.1016/j.micpro.2006.03.003openalex-snapshot
Optimal geometric algorithms for digitized images on arrays with reconfigurable optical buses
inferred← citeshttps://doi.org/10.1080/10655140290011140openalex-snapshot
Fast Inner Product Computation on Short Buses
inferred← citeshttps://doi.org/10.1109/71.730522openalex-snapshot
Time- and VLSI-optimal sorting on enhanced meshes
inferred← citeshttps://doi.org/10.1109/icpp.2001.952095openalex-snapshot
Run-length chain coding and shape's moment computations on arrays with reconfigurable optical buses
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.2009.5161093openalex-snapshot
Non-uniform fat-meshes for chip multiprocessors
inferred← citeshttps://doi.org/10.1109/tc.2004.117openalex-snapshot
Lower bounds on the loading of multiple bus networks for binary tree algorithms
inferred← citeshttps://doi.org/10.1142/s0129626409000432openalex-snapshot
NON-UNIFORM "FAT-MESHES" FOR CHIP MULTIPROCESSORS
inferred← citeshttps://doi.org/10.1142/s0219265904001064openalex-snapshot
THE MESH WITH BINARY TREE NETWORKS: AN ENHANCED MESH WITH LOW BUS-LOADING
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.