On the public citation graph
Matrix decomposition on the star graph
0 signed · 45 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.1993.1098openalex-snapshot
Embedding Meshes on the Star Graph
inferredcites →https://doi.org/10.1016/0020-0190(93)90043-9openalex-snapshot
Fault tolerant routing in the star and pancake interconnection networks
inferredcites →https://doi.org/10.1016/0020-0190(93)90086-oopenalex-snapshot
A broadcasting algorithm in star graph interconnection networks
inferredcites →https://doi.org/10.1016/0167-8191(89)90022-7openalex-snapshot
Evaluating speedups on distributed memory architectures
inferredcites →https://doi.org/10.1016/0167-8191(92)90010-5openalex-snapshot
LU decomposition optimized for a parallel computer with a hierarchical distributed memory
inferredcites →https://doi.org/10.1016/0167-8191(94)00091-nopenalex-snapshot
Order preserving communication on a star network
inferredcites →https://doi.org/10.1016/0167-8191(94)90085-xopenalex-snapshot
Subcube matrix decomposition: A unifying view for LU factorization on multicomputers
inferredcites →https://doi.org/10.1016/0743-7315(87)90038-4openalex-snapshot
Gaussian elimination on a hypercube automaton
inferredcites →https://doi.org/10.1016/0898-1221(94)90042-6openalex-snapshot
Optimal data exchange algorithms on star graphs
inferredcites →https://doi.org/10.1109/12.247843openalex-snapshot
A routing and broadcasting scheme on faulty star graphs
inferredcites →https://doi.org/10.1109/12.277296openalex-snapshot
The cost of broadcasting on star graphs and k-ary hypercubes
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/71.250119openalex-snapshot
Unifying and optimizing parallel linear algebra algorithms
inferredcites →https://doi.org/10.1109/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/71.262593openalex-snapshot
Incomplete star: an incrementally scalable network based on the star graph
inferredcites →https://doi.org/10.1109/71.282562openalex-snapshot
A parallel algorithm for computing Fourier transforms on the star graph
inferredcites →https://doi.org/10.1109/71.382321openalex-snapshot
A well-behaved enumeration of star graphs
inferredcites →https://doi.org/10.1109/71.494627openalex-snapshot
Two ranking schemes for efficient computation on the star interconnection network
inferredcites →https://doi.org/10.1109/hicss.1993.284105openalex-snapshot
Load balancing and selection on the star and pancake interconnection networks
inferredcites →https://doi.org/10.1109/ipps.1993.262802openalex-snapshot
Selection, routing, and sorting on the star graph
inferredcites →https://doi.org/10.1109/spdp.1990.143600openalex-snapshot
Embedding of cycles and grids in star graphs
inferredcites →https://doi.org/10.1109/spdp.1991.218211openalex-snapshot
Data communication and computational geometry on the star and pancake interconnection networks
inferredcites →https://doi.org/10.1109/superc.1992.236696openalex-snapshot
On the parallelization of blocked LU factorization algorithms on distributed memory architectures
inferredcites →https://doi.org/10.1142/s0129626492000179openalex-snapshot
PERFORMANCE ESTIMATION OF LU FACTORISATION ON MESSAGE PASSING MULTIPROCESSORS
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.5555/147877.147953openalex-snapshot
On the parallelization of blocked LU factorization algorithms on distributed memory architectures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0057966openalex-snapshot
Divide-and-conquer algorithms on two-dimensional meshes
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.114openalex-snapshot
Clustered Gauss–Huard algorithm for the solution of Ax=b
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.07.004openalex-snapshot
Analytic performance comparison of hypercubes and star graphs with implementation constraints
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00121-2openalex-snapshot
On the attractiveness of the star network
inferred← citeshttps://doi.org/10.1016/s0743-7315(02)00056-4openalex-snapshot
Node-ranking schemes for the star networks
inferred← citeshttps://doi.org/10.1016/s0743-7315(03)00031-5openalex-snapshot
A faster algorithm for solving linear algebraic equations on the star graph
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00020-1openalex-snapshot
On the topological properties of the arrangement–star network
inferred← citeshttps://doi.org/10.1023/a:1011140203528openalex-snapshot
On the Performance of Parallel Matrix Factorisation on the Hypermesh
inferred← citeshttps://doi.org/10.1080/00207160701619200openalex-snapshot
Largest connected component of a star graph with faulty vertices
inferred← citeshttps://doi.org/10.1080/10637199808947390openalex-snapshot
UNIFIED PARALLEL ALGORITHMS FOR GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ON PRODUCT NETWORKS
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183404openalex-snapshot
A parallel implementation of GESPP on a cluster of Silicon Graphics workstations
inferred← citeshttps://doi.org/10.1109/icpp.2001.952043openalex-snapshot
A mathematical game and its applications to the design of interconnection networks
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925019openalex-snapshot
On the VLSI area and bisection width of star graphs and hierarchical cubic networks
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016687openalex-snapshot
Reliable communication in faulty star networks
inferred← citeshttps://doi.org/10.1142/s0219265901000336openalex-snapshot
ADAPTIVE FAULT-TOLERANT ROUTING IN STAR NETWORKS
inferred← citeshttps://doi.org/10.4018/978-1-4666-2065-0.ch014openalex-snapshot
Structural Outlooks for the OTIS-Arrangement Network
inferred← citeshttps://doi.org/10.4018/jghpc.2011040105openalex-snapshot
Structural Outlooks for the OTIS-Arrangement Network
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.