On the public citation graph

Sorting in constant number of row and column phases on a mesh

0 signed · 59 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0039623openalex-snapshot

Optimal sorting on multi-dimensionally mesh-connected computers

inferredcites →https://doi.org/10.1016/0020-0190(85)90062-6openalex-snapshot

The VLSI optimality of the aks sorting network

inferredcites →https://doi.org/10.1016/0743-7315(86)90023-7openalex-snapshot

Some parallel sorts on a mesh-connected processor array and their time efficiency

inferredcites →https://doi.org/10.1109/mc.2023.3338754openalex-snapshot

IEEE Transactions on Computers

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.1983.1676217openalex-snapshot

An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes

inferredcites →https://doi.org/10.1109/tc.1985.1676603openalex-snapshot

Systolic Sorting on a Mesh-Connected Network

inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot

Tight Bounds on the Complexity of Parallel Sorting

inferredcites →https://doi.org/10.1145/12130.12156openalex-snapshot

An optimal sorting algorithm for mesh connected computers

inferredcites →https://doi.org/10.1145/359461.359481openalex-snapshot

Sorting on a mesh-connected parallel computer

inferredcites →https://doi.org/10.1145/800061.808726openalex-snapshot

An 0(n log n) sorting network

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1999.1036openalex-snapshot

Self-Simulation for the Passive Optical Star

inferred← citeshttps://doi.org/10.1006/jpdc.1996.0155openalex-snapshot

Optimal Algorithms for Constrained Reconfigurable Meshes

inferred← citeshttps://doi.org/10.1006/jpdc.1996.1295openalex-snapshot

RCC-Full: An Effective Network for Parallel Computations

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1462openalex-snapshot

A Randomized Parallel Sorting Algorithm with an Experimental Study

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot

Packet Routing in Fixed-Connection Networks: A Survey

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1503openalex-snapshot

Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers

inferred← citeshttps://doi.org/10.1006/jpdc.1998.1525openalex-snapshot

Communication-Efficient Sorting Algorithms on Reconfigurable Array of Processors With Slotted Optical Buses

inferred← citeshttps://doi.org/10.1006/jpdc.2000.1643openalex-snapshot

Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses

inferred← citeshttps://doi.org/10.1007/11576235_30openalex-snapshot

It’s Elementary, My Dear Watson: Time-Optimal Sorting Algorithms on a Completely Overlapping Network

inferred← citeshttps://doi.org/10.1007/3-540-54945-5_66openalex-snapshot

An analysis of randomized shear sort on the mesh computer

inferred← citeshttps://doi.org/10.1007/3-540-60313-1_156openalex-snapshot

Self-simulation for the Passive Optical Star model

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/bf01759059openalex-snapshot

Parallel sorting on cayley graphs

inferred← citeshttps://doi.org/10.1007/bf02259747openalex-snapshot

Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays

inferred← citeshttps://doi.org/10.1007/s00453-002-0966-5openalex-snapshot

Communication—Processor Tradeoffs in a Limited Resources PRAM

inferred← citeshttps://doi.org/10.1007/s00453-006-1222-1openalex-snapshot

Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters

inferred← citeshttps://doi.org/10.1016/0020-0190(91)90193-lopenalex-snapshot

A unified algorithm for sorting on multidimensional mesh-connected processors

inferred← citeshttps://doi.org/10.1016/0304-3975(95)80011-5openalex-snapshot

Parallel interval order recognition and construction of interval representations

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50005-xopenalex-snapshot

Deterministic Parallel Computational Geometry

inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00060-0openalex-snapshot

Adaptive AT2 optimal algorithms on reconfigurable meshes

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00210-1openalex-snapshot

Parallel N-free order recognition

inferred← citeshttps://doi.org/10.1080/10637199508915514openalex-snapshot

A CONSTANT TIME ALGORITHM FOR THE CHANNEL ASSIGNMENT PROBLEM USING THE RECONFIGURABLE MESH

inferred← citeshttps://doi.org/10.1109/12.277299openalex-snapshot

A new class of optimal bounded-degree VLSI sorting networks

inferred← citeshttps://doi.org/10.1109/31.44352openalex-snapshot

Optimal image computations on reduced VLSI architectures

inferred← citeshttps://doi.org/10.1109/34.159904openalex-snapshot

Parallel architectures and algorithms for image component labeling

inferred← citeshttps://doi.org/10.1109/5.163410openalex-snapshot

Parallel techniques for computational geometry

inferred← citeshttps://doi.org/10.1109/71.159046openalex-snapshot

Sorting in mesh connected multiprocessors

inferred← citeshttps://doi.org/10.1109/71.476164openalex-snapshot

Sorting n/sup 2/ numbers on n×n meshes

inferred← citeshttps://doi.org/10.1109/71.532114openalex-snapshot

The block distributed memory model

inferred← citeshttps://doi.org/10.1109/cvpr.1988.196344openalex-snapshot

Optimal geometric algorithms on fixed-size linear arrays and scan line arrays

inferred← citeshttps://doi.org/10.1109/fmpc.1995.380468openalex-snapshot

Many-to-many personalized communication with bounded traffic

inferred← citeshttps://doi.org/10.1109/hicss.1994.323272openalex-snapshot

Scalable data parallel implementations of object-recognition on Connection Machine CM-5

inferred← citeshttps://doi.org/10.1109/icpads.1996.517562openalex-snapshot

Fast sorting algorithms on reconfigurable array of processors with optical buses

inferred← citeshttps://doi.org/10.1109/icpp.1994.100openalex-snapshot

Efficient CRCW PRAM Emulation on Practical Networks

inferred← citeshttps://doi.org/10.1109/icpp.1996.537386openalex-snapshot

Integer sorting and routing in arrays with reconfigurable optical buses

inferred← citeshttps://doi.org/10.1109/ipdps.2005.334openalex-snapshot

PDM Sorting Algorithms That Take A Small Number of Passes

inferred← citeshttps://doi.org/10.1109/ipps.1993.262858openalex-snapshot

Sorting n/sup 2/ numbers on n*n meshes

inferred← citeshttps://doi.org/10.1109/ipps.1993.262877openalex-snapshot

Sorting n numbers on n*n reconfigurable meshes with buses

inferred← citeshttps://doi.org/10.1109/ipps.1994.288220openalex-snapshot

The block distributed memory model for shared memory multiprocessors

inferred← citeshttps://doi.org/10.1109/ipps.1998.669982openalex-snapshot

An AT/sup 2/ optimal mapping of sorting onto the mesh connected array without comparators

inferred← citeshttps://doi.org/10.1109/ipps.1999.760468openalex-snapshot

Optimally scaling permutation routing on reconfigurable linear arrays with optical buses

inferred← citeshttps://doi.org/10.1109/ispan.1999.778953openalex-snapshot

A randomized BSP/CGM algorithm for the maximal independent set problem

inferred← citeshttps://doi.org/10.1109/shpcc.1994.296725openalex-snapshot

Scalable data parallel object recognition using geometric hashing on CM-5

inferred← citeshttps://doi.org/10.1109/spdp.1995.530733openalex-snapshot

Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers

inferred← citeshttps://doi.org/10.1109/tc.2007.70810openalex-snapshot

Optimal and Practical Algorithms for Sorting on the PDM

inferred← citeshttps://doi.org/10.1137/18m1194341openalex-snapshot

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch

inferred← citeshttps://doi.org/10.1145/125826.126169openalex-snapshot

Optimal bounded-degree VLSI networks for sorting in a constant number of rounds

inferred← citeshttps://doi.org/10.1145/305619.305628openalex-snapshot

Communication-processor tradeoffs in limited resources PRAM

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.