On the public citation graph
Fast sorting algorithms on a linear array with a reconfigurable pipelined bus system
0 signed · 38 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.1007/978-0-585-27268-9_11openalex-snapshot
Basic Data Movement Operations on the LARPBS Model
inferredcites →https://doi.org/10.1007/bfb0097976openalex-snapshot
Solving graph theory problems using reconfigurable pipelined optical buses
inferredcites →https://doi.org/10.1016/0743-7315(91)90130-2openalex-snapshot
Pipelined communications in optically interconnected arrays
inferredcites →https://doi.org/10.1016/s0020-0255(97)10013-5openalex-snapshot
Linear array with a reconfigurable pipelined bus system — Concepts and applications
inferredcites →https://doi.org/10.1016/s0167-739x(97)00013-7openalex-snapshot
Efficient and scalable quicksort on a linear array with a reconfigurable pipelined bus system
inferredcites →https://doi.org/10.1023/a:1007922924139openalex-snapshot
Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
inferredcites →https://doi.org/10.1080/01495739808947358openalex-snapshot
FAST NEAREST NEIGHBOR ALGORITHMS ON A LINEAR ARRAY WITH A RECONFIGURABLE PIPELINED BUS SYSTEM
inferredcites →https://doi.org/10.1080/10637199608915554openalex-snapshot
MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗
inferredcites →https://doi.org/10.1109/12.277290openalex-snapshot
Parallel computations on reconfigurable meshes
inferredcites →https://doi.org/10.1109/71.642947openalex-snapshot
Sorting, selection, and routing on the array with reconfigurable optical buses
inferredcites →https://doi.org/10.1109/71.706044openalex-snapshot
Fast and processor efficient parallel matrix multiplication algorithms on a linear array with a reconfigurable pipelined bus system
inferredcites →https://doi.org/10.1109/fmpc.1999.750611openalex-snapshot
Fast parallel selection on the linear array with reconfigurable pipelined bus system
inferredcites →https://doi.org/10.1109/ipps.1999.760431openalex-snapshot
Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system
inferredcites →https://doi.org/10.1109/ispan.1999.778909openalex-snapshot
Models and algorithms for optical and optoelectronic parallel computers
inferredcites →https://doi.org/10.1109/mc.1987.1663446openalex-snapshot
Using Coincident Optical Pulses for Parallel Memory Addressing
inferredcites →https://doi.org/10.1364/ao.29.002024openalex-snapshot
Coincident pulse techniques for multiprocessor interconnection structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-37619-4_22openalex-snapshot
Faster Sorting on a Linear Array with a Reconfigurable Pipelined Bus System
inferred← citeshttps://doi.org/10.1007/s11227-015-1611-9openalex-snapshot
All-optical Linear Array with a Reconfigurable Pipelined Bus System (OLARPBS) optical bus parallel computing model
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.11.020openalex-snapshot
An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.015openalex-snapshot
Panconnectivity and edge-pancyclicity of k -ary n -cubes with faulty elements
inferred← citeshttps://doi.org/10.1016/j.ins.2007.08.012openalex-snapshot
Edge-pancyclicity and path-embeddability of bijective connection graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2009.09.007openalex-snapshot
Path embeddings in faulty 3-ary n-cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.01.002openalex-snapshot
Fast and scalable algorithms for the Euclidean distance transform on a linear array with a reconfigurable pipelined bus system
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.04.004openalex-snapshot
Optimal fault-tolerant embedding of paths in twisted cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.06.001openalex-snapshot
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
inferred← citeshttps://doi.org/10.1023/a:1016552512787openalex-snapshot
Efficient Graph-Theoretic Algorithms on a Linear Array with a Reconfigurable Pipelined Bus System
inferred← citeshttps://doi.org/10.1023/b:supe.0000032783.66123.63openalex-snapshot
Multiple Addition and Prefix Sum on a Linear Array with a Reconfigurable Pipelined Bus System
inferred← citeshttps://doi.org/10.1080/17445760.2023.2172574openalex-snapshot
Big data processing with 1D-Crosspoint Arrays
inferred← citeshttps://doi.org/10.1109/cecnet.2011.5768403openalex-snapshot
Embedding paths into the 4-ary n-cube with faulty nodes
inferred← citeshttps://doi.org/10.1109/ipdpsw.2013.74openalex-snapshot
Scalable, Multithreaded, Partially-in-Place Sorting
inferred← citeshttps://doi.org/10.1109/pdcat.2007.18openalex-snapshot
Randomized Initialization on the 1-Dimensional Reconfigurable Mesh
inferred← citeshttps://doi.org/10.1109/pdcat.2007.74openalex-snapshot
An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS
inferred← citeshttps://doi.org/10.1109/tpds.2007.1003openalex-snapshot
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes
inferred← citeshttps://doi.org/10.1109/tpds.2009.68openalex-snapshot
Optimal Sorting Algorithms for a Simplified 2D Array with Reconfigurable Pipelined Bus System
inferred← citeshttps://doi.org/10.48550/arxiv.2011.11144openalex-snapshot
Searching and Sorting with O(n^2) processors in O(1) time
inferred← citeshttps://doi.org/10.5555/1761566.1761595openalex-snapshot
Faster sorting on a linear array with a reconfigurable pipelined bus system
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.