On the public citation graph
Optimal convex hull algorithms on enhanced meshes
0 signed · 56 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.1016/0141-9331(89)90038-0openalex-snapshot
High-performance computer architecture
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(89)90022-1openalex-snapshot
Connection autonomy in SIMD computers: A VLSI implementation
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/pccc.1992.200593openalex-snapshot
Fundamental data movement algorithms for reconfigurable meshes
inferredcites →https://doi.org/10.1109/pccc.1992.200594openalex-snapshot
Integer sorting in O(1) time on an n*n reconfigurable mesh
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.1137/0209058openalex-snapshot
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1137/0215006openalex-snapshot
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferredcites →https://doi.org/10.1142/s0129626493000095openalex-snapshot
SIMULATING ENHANCED MESHES, WITH APPLICATIONS
inferredcites →https://doi.org/10.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
inferredcites →https://doi.org/10.1145/828.322449openalex-snapshot
Graph Problems on a Mesh-Connected Processor Array
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.7551/mitpress/1102.003.0014openalex-snapshot
Meshes with Reconfigurable Buses
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.0095openalex-snapshot
Time-Optimal Nearest-Neighbor Computations on Enhanced Meshes
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0155openalex-snapshot
Optimal Algorithms for Constrained Reconfigurable 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/3-540-58078-6_15openalex-snapshot
Constant-time convexity problems on reconfigurable meshes
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.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/0020-0255(95)00026-lopenalex-snapshot
A constant time algorithm for theorem proving in propositional logic on reconfigurable meshes
inferred← citeshttps://doi.org/10.1016/b978-0-444-81704-4.50010-7openalex-snapshot
Image Processing On Reconfigurable Meshes With Buses
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/s0166-218x(97)00135-2openalex-snapshot
Time-optimal tree computations on sparse meshes
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/10637199608915555openalex-snapshot
COMPUTATION OF THE CONVEX HULL FOR SORTED POINTS ON A RECONFIGURABLE MESH
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.569648openalex-snapshot
Constant time algorithms for computational geometry on the reconfigurable mesh
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.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.954618openalex-snapshot
Optimal algorithms for the multiple query problem on reconfigurable meshes, with applications
inferred← citeshttps://doi.org/10.1109/asap.1994.331789openalex-snapshot
Constant-time triangulation problems on reconfigurable meshes
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/icpads.1994.589892openalex-snapshot
Semigroup computation and its applications on mesh-connected computers with hyperbus broadcasting
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183376openalex-snapshot
Time-optimal parallel algorithms for constructing optimal virtual cellular networks
inferred← citeshttps://doi.org/10.1109/icpp.1994.79openalex-snapshot
Constant-Time Convexity Problems on Dense Reconfigurable Meshes
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.1998.669953openalex-snapshot
An O((log log n)/sup 2/) time convex hull algorithm on reconfigurable meshes
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.1996.570360openalex-snapshot
A unifying methodology for multiple querying on enhanced meshes
inferred← citeshttps://doi.org/10.1109/tnn.2007.891201openalex-snapshot
Neurocomputing Model for Computation of an Approximate Convex Hull of a Set of Points and Spheres
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.