On the public citation graph
A parallel algorithm for computing Fourier transforms on the star graph
0 signed · 77 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.1016/0020-0190(91)90107-sopenalex-snapshot
Decomposing a star graph into disjoint cycles
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tau.1967.1161899openalex-snapshot
What is the fast Fourier transform?
inferredcites →https://doi.org/10.1109/tc.1977.1674863openalex-snapshot
The Indirect Binary n-Cube Microprocessor Array
inferredcites →https://doi.org/10.1109/tc.1980.1675553openalex-snapshot
Notes on Shuffle/Exchange-Type Switching Networks
inferredcites →https://doi.org/10.1109/tc.1984.1676458openalex-snapshot
Pipeline and Parallel-Pipeline FFT Processors for VLSI Implementations
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/800015.808185openalex-snapshot
Multi-dimensional systolic networks, for discrete fourier transform
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<56::aid-net5>3.0.co;2-dopenalex-snapshot
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200001)35:1<83::aid-net7>3.0.co;2-dopenalex-snapshot
Cluster fault-tolerant routing in star graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200003)35:2<161::aid-net7>3.0.co;2-qopenalex-snapshot
Cycles in butterfly graphs
inferred← citeshttps://doi.org/10.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-gopenalex-snapshot
Hamiltonian-laceability of star graphs
inferred← citeshttps://doi.org/10.1002/net.3230230408openalex-snapshot
μ‐star: An indirect star network
inferred← citeshttps://doi.org/10.1006/jpdc.1994.1066openalex-snapshot
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1155openalex-snapshot
Migration of Tasks in Interconnection Networks Based on the Star Graph
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0028openalex-snapshot
Conditional Fault Diameter of Star Graph Networks
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1414openalex-snapshot
The Hyperstar Interconnection Network
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1812openalex-snapshot
A Parallel Algorithm for Lagrange Interpolation on the Star Graph
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_32openalex-snapshot
Variable-dilation embeddings of hypercubes into star graphs: Performance metrics, mapping functions, and routing
inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_4openalex-snapshot
A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-04303-5_2openalex-snapshot
The Design of Efficient Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/978-81-322-1856-2_10openalex-snapshot
A New Approach for Parallel Discrete Fourier Transform in Multi Mesh Network
inferred← citeshttps://doi.org/10.1007/bf03037299openalex-snapshot
Mapping two complete binary trees into the star graph with quick fault recovery
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90107-sopenalex-snapshot
Decomposing a star graph into disjoint cycles
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90087-popenalex-snapshot
Fault diameter of star graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00135-yopenalex-snapshot
Node-to-node cluster fault tolerant routing in star graphs
inferred← citeshttps://doi.org/10.1016/0045-7906(96)00005-5openalex-snapshot
Computation of the fast fourier transform on the star-connected cycle networks
inferred← citeshttps://doi.org/10.1016/0167-9260(94)90021-3openalex-snapshot
On VLSI layouts of the star graph and related networks
inferred← citeshttps://doi.org/10.1016/0895-7177(94)90039-6openalex-snapshot
A depth-first search routing algorithm for star graphs and its performance evaluation
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00143-5openalex-snapshot
Scheduling of independent jobs in star graph networks
inferred← citeshttps://doi.org/10.1016/1069-0115(94)90011-6openalex-snapshot
On simulation of some Cayley-based networks
inferred← citeshttps://doi.org/10.1016/j.amc.2004.06.135openalex-snapshot
Cycle embedding in star graphs with edge faults
inferred← citeshttps://doi.org/10.1016/j.aml.2005.09.004openalex-snapshot
Distance distribution of nodes in star graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.08.007openalex-snapshot
Some topological properties of star graphs: The surface area and volume
inferred← citeshttps://doi.org/10.1016/j.ins.2003.09.023openalex-snapshot
Hyper hamiltonian laceability on edge fault star graph
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.005openalex-snapshot
Leader election in hierarchical star network
inferred← citeshttps://doi.org/10.1016/j.mcm.2013.03.011openalex-snapshot
A parallel clustering algorithm on the star graph and its performance
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.05.003openalex-snapshot
Hierarchical star: a new two level interconnection network
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.024openalex-snapshot
The diagnosability of triangle-free graphs
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00280-0openalex-snapshot
On embedding rings into a star-related network
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/s0167-8191(98)00009-xopenalex-snapshot
Unicast-based multicast algorithm in wormhole-routed star graph interconnection networks
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00057-xopenalex-snapshot
Wormhole broadcast in star graph networks
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/s0898-1221(98)00154-0openalex-snapshot
Block-cyclic matrix triangulation on the Cartesian product of star graphs
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:1019146428683openalex-snapshot
Efficient sorting on the star graph interconnection network
inferred← citeshttps://doi.org/10.1049/ip-cdt:19960245openalex-snapshot
All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs
inferred← citeshttps://doi.org/10.1080/00207160701619200openalex-snapshot
Largest connected component of a star graph with faulty vertices
inferred← citeshttps://doi.org/10.1109/12.485375openalex-snapshot
Transposition networks as a class of fault-tolerant robust networks
inferred← citeshttps://doi.org/10.1109/24.994908openalex-snapshot
Reliability modeling and assessment of the Star-Graph networks
inferred← citeshttps://doi.org/10.1109/71.494627openalex-snapshot
Two ranking schemes for efficient computation on the star interconnection network
inferred← citeshttps://doi.org/10.1109/71.605767openalex-snapshot
Matrix decomposition on the star graph
inferred← citeshttps://doi.org/10.1109/71.674318openalex-snapshot
Low expansion packings and embeddings of hypercubes into star graphs: a performance-oriented approach
inferred← citeshttps://doi.org/10.1109/aispas.1997.581636openalex-snapshot
The shortest routing path in star graphs with faulty clusters
inferred← citeshttps://doi.org/10.1109/hpcasia.2005.73openalex-snapshot
Performance comparison of adaptive routing algorithms in the star interconnection network
inferred← citeshttps://doi.org/10.1109/i-span.2012.16openalex-snapshot
Successive Generalizations of Star Graphs
inferred← citeshttps://doi.org/10.1109/icapp.1996.562908openalex-snapshot
Preemptive job scheduling in star graph networks
inferred← citeshttps://doi.org/10.1109/icpads.1998.741134openalex-snapshot
Two problems on butterfly graphs
inferred← citeshttps://doi.org/10.1109/icpads.2000.857712openalex-snapshot
Fault-free Hamiltonian cycles in faulty butterfly graphs
inferred← citeshttps://doi.org/10.1109/icpp.1998.708473openalex-snapshot
Embed longest rings onto star graphs with vertex faults
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846064openalex-snapshot
Parallel Lagrange interpolation on the star graph
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016687openalex-snapshot
Reliable communication in faulty star networks
inferred← citeshttps://doi.org/10.1109/ispan.1997.645113openalex-snapshot
Processor allocation in the star graph using Sg-lattice model
inferred← citeshttps://doi.org/10.1109/ispan.2005.63openalex-snapshot
On Some Combinatorial Properties of the Star Graph
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343121openalex-snapshot
Embedding of meshes on rotator graphs
inferred← citeshttps://doi.org/10.1109/pccc.1996.493622openalex-snapshot
Low expansion packings and embeddings of hypercubes into star graphs
inferred← citeshttps://doi.org/10.1109/spdp.1993.395464openalex-snapshot
Optimal communication algorithms on the star interconnection network
inferred← citeshttps://doi.org/10.1109/spdp.1994.346117openalex-snapshot
Embedding of cycles in rotator and incomplete rotator graphs
inferred← citeshttps://doi.org/10.1109/tr.2013.2285031openalex-snapshot
Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model
inferred← citeshttps://doi.org/10.1142/s0219265901000336openalex-snapshot
ADAPTIVE FAULT-TOLERANT ROUTING IN STAR NETWORKS
inferred← citeshttps://doi.org/10.14569/ijacsa.2016.070828openalex-snapshot
Efficient Load Balancing Algorithm for the Arrangement-Star 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.