On the public citation graph
A fast selection algorithm for meshes with multiple broadcasting
0 signed · 57 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.1994.1074openalex-snapshot
A Time-Optimal Multiple Search Algorithm on Enhanced Meshes, with Applications
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/bf01990339openalex-snapshot
Selection on rectangular meshes with multiple broadcasting
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.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/s0167-8191(05)80059-6openalex-snapshot
An efficient parallel algorithm for multiselection
inferredcites →https://doi.org/10.1109/21.17370openalex-snapshot
Bus automata, brains, and mental models
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/cmpeur.1992.218501openalex-snapshot
Time-optimal sorting and applications on n*n enhanced meshes
inferredcites →https://doi.org/10.1109/icpp.1993.180openalex-snapshot
Time- and VLSI-optimal Sorting on Meshes with Multiple Broadcasting
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.1984.1676405openalex-snapshot
Finding Maximum on an Array Processor with a Global Bus
inferredcites →https://doi.org/10.1142/s0129626492000386openalex-snapshot
CONVEX POLYGON PROBLEMS ON MESHES WITH MULTIPLE BROADCASTING
inferredcites →https://doi.org/10.1142/s0129626493000095openalex-snapshot
SIMULATING ENHANCED MESHES, WITH APPLICATIONS
inferredcites →https://doi.org/10.1145/72935.72951openalex-snapshot
Square meshes are not always optimal
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.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/3-540-59071-4_48openalex-snapshot
Time-optimal tree computations on sparse meshes
inferred← citeshttps://doi.org/10.1007/978-3-319-73676-1_17openalex-snapshot
Vehicular Clouds: A Survey and Future Directions
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/0167-739x(94)00066-nopenalex-snapshot
Order statistics on a linear array with a reconfigurable bus
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.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/asap.1993.397147openalex-snapshot
Time-optimal visibility-related algorithms on meshes with multiple broadcasting
inferred← citeshttps://doi.org/10.1109/asap.1994.331786openalex-snapshot
An efficient VLSI architecture for digital geometry
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.2016.18openalex-snapshot
Optimal Algorithms for Graphs and Images on a Shared Memory Mesh
inferred← citeshttps://doi.org/10.1109/ipdps.2017.74openalex-snapshot
Optimal Algorithms for a Mesh-Connected Computer with Limited Additional Global Bandwidth
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/ispan.1996.509024openalex-snapshot
A time-optimal solution to planar point location in ordered functional domains, with applications
inferred← citeshttps://doi.org/10.1109/mppoi.1994.336629openalex-snapshot
Order statistics on optically interconnected multiprocessor systems
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/tcc.2018.2834352openalex-snapshot
A tight estimate of job completion time in vehicular clouds
inferred← citeshttps://doi.org/10.1109/tits.2016.2620434openalex-snapshot
Reasoning About Job Completion Time in Vehicular Clouds
inferred← citeshttps://doi.org/10.1109/tits.2017.2710353openalex-snapshot
Towards Approximating the Mean Time to Failure in Vehicular Clouds
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.6578openalex-snapshot
Design and Analysis of Optical Interconnection Networks for Parallel Computation.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.7190openalex-snapshot
Multiple Bus Networks for Binary -Tree Algorithms.
inferred← citeshttps://doi.org/10.3390/s21227652openalex-snapshot
SEE-TREND: SEcurE Traffic-Related EveNt Detection in Smart Communities
inferred← citeshttps://doi.org/10.3390/smartcities4010004openalex-snapshot
A Survey of Enabling Technologies for Smart Communities
inferred← citeshttps://doi.org/10.3390/smartcities4020034openalex-snapshot
Vehicular Crowdsourcing for Congestion Support in Smart Cities
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.