On the public citation graph
Improved sorting networks withO(logN) depth
0 signed · 125 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.1002/j.1538-7305.1979.tb02972.xopenalex-snapshot
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
inferredcites →https://doi.org/10.1007/978-1-4612-5110-1_36openalex-snapshot
A Remark on Stirling’s Formula
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1016/0031-3203(82)90057-7openalex-snapshot
On a convex hull algorithm for polygons and its application to triangulation problems
inferredcites →https://doi.org/10.1016/0166-218x(84)90124-0openalex-snapshot
On the maximum empty rectangle problem
inferredcites →https://doi.org/10.1016/0166-218x(86)90071-5openalex-snapshot
A note on finding a maximum empty rectangle
inferredcites →https://doi.org/10.1137/0215022openalex-snapshot
Computing the Largest Empty Rectangle
inferredcites →https://doi.org/10.1145/12130.12154openalex-snapshot
Explicit expanders and the Ramanujan conjectures
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.10003openalex-snapshot
Area efficient layouts of the Batcher sorting networks
inferred← citeshttps://doi.org/10.1006/jcss.1995.1007openalex-snapshot
Load Sharing with Parallel Priority Queues
inferred← citeshttps://doi.org/10.1006/jcss.1997.1470openalex-snapshot
Breaking theΘ(nlog2n) Barrier for Sorting with Faults
inferred← citeshttps://doi.org/10.1006/jpdc.1998.1483openalex-snapshot
Packet Routing in Fixed-Connection Networks: A Survey
inferred← citeshttps://doi.org/10.1007/11830924_38openalex-snapshot
Monotone Circuits for the Majority Function
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_69openalex-snapshot
Selection networks with 8n log2 n size and O(log n) depth
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_27openalex-snapshot
Approximate and exact deterministic parallel selection
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_257openalex-snapshot
A probabilistic selection network with butterfly networks
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_103openalex-snapshot
A super-logarithmic lower bound for hypercubic sorting networks
inferred← citeshttps://doi.org/10.1007/978-3-030-43662-9_3openalex-snapshot
On (Valiant’s) Polynomial-Size Monotone Formula for Majority
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_10openalex-snapshot
Fragile Complexity of Adaptive Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_28openalex-snapshot
Parameterized Complexity Classes Defined by Threshold Circuits: Using Sorting Networks to Show Collapses with W-hierarchy Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-73257-7_16openalex-snapshot
Large and Parallel Human Sorting Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-84740-0_14openalex-snapshot
Circuit Complexity and Unambiguity
inferred← citeshttps://doi.org/10.1007/978-3-032-01907-3_16openalex-snapshot
How to Share an NP Statement or Combiners for Zero-Knowledge Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_13openalex-snapshot
Sparse Suffix Tree Construction in Small Space
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_18openalex-snapshot
On the Computational Complexity of Optimal Sorting Network Verification
inferred← citeshttps://doi.org/10.1007/978-981-97-6226-2_5openalex-snapshot
Distributed Quantum Computations
inferred← citeshttps://doi.org/10.1007/bf00227864openalex-snapshot
High-performance sorting algorithms for the CRAY T3D parallel computer
inferred← citeshttps://doi.org/10.1007/bf01184936openalex-snapshot
A lower bound for sorting networks based on the shuffle permutation
inferred← citeshttps://doi.org/10.1007/bf02090767openalex-snapshot
Single-exception sorting networks and the computational complexity of optimal sorting network verification
inferred← citeshttps://doi.org/10.1007/bfb0029954openalex-snapshot
Resolution proofs, exponential bounds, and Kolmogorov complexity
inferred← citeshttps://doi.org/10.1007/s002240010001openalex-snapshot
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks
inferred← citeshttps://doi.org/10.1007/s002360050181openalex-snapshot
On the cost-effectiveness of PRAMs
inferred← citeshttps://doi.org/10.1007/s00453-007-9025-6openalex-snapshot
Sorting Networks of Logarithmic Depth, Further Simplified
inferred← citeshttps://doi.org/10.1007/s00453-012-9696-5openalex-snapshot
Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons
inferred← citeshttps://doi.org/10.1007/s004530010049openalex-snapshot
Improved Routing and Sorting on Multibutterflies
inferred← citeshttps://doi.org/10.1007/s10107-014-0757-1openalex-snapshot
Smallest compact formulation for the permutahedron
inferred← citeshttps://doi.org/10.1007/s11432-011-4357-xopenalex-snapshot
High-yield performance-efficient redundancy analysis for 2D memory
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50022-9openalex-snapshot
Parallel Algorithms for Shared-Memory Machines
inferred← citeshttps://doi.org/10.1016/j.apal.2010.10.002openalex-snapshot
A sorting network in bounded arithmetic
inferred← citeshttps://doi.org/10.1016/j.apal.2020.102796openalex-snapshot
Expander construction in VNC1
inferred← citeshttps://doi.org/10.1016/j.ins.2011.12.008openalex-snapshot
On the complexity of min–max sorting networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.11.003openalex-snapshot
A deterministic algorithm for fitting a step function to a weighted point-set
inferred← citeshttps://doi.org/10.1016/j.jda.2008.08.004openalex-snapshot
Boolean circuit programming: A new paradigm to design parallel algorithms
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.05.019openalex-snapshot
Networks for sorting multitonic sequences
inferred← citeshttps://doi.org/10.1016/j.sysarc.2006.04.002openalex-snapshot
A scalable VLSI speed/area tunable sorting network
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.004openalex-snapshot
Combinatorial search in two and more rounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.034openalex-snapshot
Fragile complexity of adaptive algorithms
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00064-7openalex-snapshot
Real-time emulations of bounded-degree networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00032-0openalex-snapshot
Construction of halvers
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00390-xopenalex-snapshot
Improved fault-tolerant sorting algorithm in hypercubes
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00281-9openalex-snapshot
Periodic comparator networks
inferred← citeshttps://doi.org/10.1038/s41534-018-0071-5openalex-snapshot
Improved techniques for preparing eigenstates of fermionic Hamiltonians
inferred← citeshttps://doi.org/10.1088/1674-1056/adfb58openalex-snapshot
Distributed Kuperberg’s algorithm
inferred← citeshttps://doi.org/10.1098/rspa.2012.0686openalex-snapshot
Efficient distributed quantum computing
inferred← citeshttps://doi.org/10.1103/physreva.106.032417openalex-snapshot
Distributed quantum algorithm for Simon's problem
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/71.210809openalex-snapshot
An optimal implementation of broadcasting with selective reduction
inferred← citeshttps://doi.org/10.1109/71.285603openalex-snapshot
Adaptive binary sorting schemes and associated interconnection networks
inferred← citeshttps://doi.org/10.1109/71.770195openalex-snapshot
How to sort N items using a sorting network of fixed I/O size
inferred← citeshttps://doi.org/10.1109/71.852399openalex-snapshot
Minimizing communication in the bitonic sort
inferred← citeshttps://doi.org/10.1109/ats.2010.48openalex-snapshot
HYPERA: High-Yield Performance-Efficient Redundancy Analysis
inferred← citeshttps://doi.org/10.1109/csf68417.2026.00021openalex-snapshot
Revisiting Beimel-Weinreb Weighted Threshold Secret Sharing Schemes
inferred← citeshttps://doi.org/10.1109/fscs.1990.89545openalex-snapshot
A (fairly) simple circuit that (usually) sorts
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00021openalex-snapshot
Energy-Optimal and Low-Depth Algorithmic Primitives for Spatial Dataflow Architectures
inferred← citeshttps://doi.org/10.1109/memcod.2018.8556886openalex-snapshot
Optimal Self-Routing Split Modules for Radix-based Interconnection Networks
inferred← citeshttps://doi.org/10.1109/recosoc.2016.7533894openalex-snapshot
The selector-tree network: A new self-routing and non-blocking interconnection network
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185406openalex-snapshot
Highly fault-tolerant sorting circuits
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366814openalex-snapshot
Breaking the Θ(nlog/sup 2/ n) barrier for sorting with faults
inferred← citeshttps://doi.org/10.1109/spdp.1991.218303openalex-snapshot
On the cost-effectiveness of PRAMs
inferred← citeshttps://doi.org/10.1109/stcr51658.2021.9588986openalex-snapshot
Bitonic sorting on FPGA for energy and memory efficient mapping
inferred← citeshttps://doi.org/10.1109/tc.2012.108openalex-snapshot
Modular Design of High-Throughput, Low-Latency Sorting Units
inferred← citeshttps://doi.org/10.1109/tpds.2004.16openalex-snapshot
Classifying matrices separating rows and columns
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.1112/plms/pdu019openalex-snapshot
Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments
inferred← citeshttps://doi.org/10.1137/1.9781611973075.101openalex-snapshot
Randomized Shellsort: A Simple Oblivious Sorting Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611976465.134openalex-snapshot
Sorting Short Keys in Circuits of Size o ( n log n )
inferred← citeshttps://doi.org/10.1137/1.9781611976465.141openalex-snapshot
Optimal Oblivious Priority Queues
inferred← citeshttps://doi.org/10.1137/20m1380983openalex-snapshot
Sorting Short Keys in Circuits of Size ${o(n \log n)}$
inferred← citeshttps://doi.org/10.1137/21m1417740openalex-snapshot
Almost Optimal SuperConstant-Pass Streaming Lower Bounds for Reachability
inferred← citeshttps://doi.org/10.1137/s0097539791224285openalex-snapshot
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
inferred← citeshttps://doi.org/10.1137/s0097539793248329openalex-snapshot
A Method of Constructing Selection Networks with $O(\log n)$ Depth
inferred← citeshttps://doi.org/10.1137/s0097539794268406openalex-snapshot
Hypercubic Sorting Networks
inferred← citeshttps://doi.org/10.1137/s0097539795294141openalex-snapshot
Communication-Efficient Parallel Sorting
inferred← citeshttps://doi.org/10.1137/s0895480196304982openalex-snapshot
Matching Nuts and Bolts in O(n log n) Time
inferred← citeshttps://doi.org/10.1142/s0129626492000337openalex-snapshot
THE PAIRWISE SORTING NETWORK
inferred← citeshttps://doi.org/10.1145/129712.129751openalex-snapshot
A hypercubic sorting network with nearly logarithmic depth
inferred← citeshttps://doi.org/10.1145/140901.140909openalex-snapshot
A lower bound for sorting networks based on the shuffle permutation
inferred← citeshttps://doi.org/10.1145/140901.140917openalex-snapshot
Supporting the hypercube programming model on mesh architectures
inferred← citeshttps://doi.org/10.1145/140901.140918openalex-snapshot
Implementations of randomized sorting on large parallel machines
inferred← citeshttps://doi.org/10.1145/1755688.1755716openalex-snapshot
Bureaucratic protocols for secure two-party sorting, selection, and permuting
inferred← citeshttps://doi.org/10.1145/176979.176984openalex-snapshot
A survey of PRAM simulation techniques
inferred← citeshttps://doi.org/10.1145/195058.195202openalex-snapshot
Optimal parallel string algorithms
inferred← citeshttps://doi.org/10.1145/2228360.2228588openalex-snapshot
Computer generation of streaming sorting networks
inferred← citeshttps://doi.org/10.1145/226643.226670openalex-snapshot
Sorting on a parallel pointer machine with applications to set expression evaluation
inferred← citeshttps://doi.org/10.1145/2330163.2330248openalex-snapshot
Efficient filters for the simulated evolution of small sorting networks
inferred← citeshttps://doi.org/10.1145/237814.237870openalex-snapshot
Communication-efficient parallel sorting (preliminary version)
inferred← citeshttps://doi.org/10.1145/237814.237876openalex-snapshot
An O ( n log n )-size fault-tolerant sorting network (extended abstract)
inferred← citeshttps://doi.org/10.1145/2457317.2457384openalex-snapshot
Efficient high-similarity string comparison
inferred← citeshttps://doi.org/10.1145/258533.258645openalex-snapshot
Improved routing and sorting on multibutterflies
inferred← citeshttps://doi.org/10.1145/2745754.2745775openalex-snapshot
Skyline Queries with Noisy Comparisons
inferred← citeshttps://doi.org/10.1145/277651.277683openalex-snapshot
Layout of the batcher bitonic sorter (extended abstract)
inferred← citeshttps://doi.org/10.1145/3658644.3690326openalex-snapshot
ThorPIR: Single Server PIR via Homomorphic Thorp Shuffles
inferred← citeshttps://doi.org/10.1364/ao.30.005119openalex-snapshot
Organization of k × k switches (k ≥ 4) interconnected by d-dimensional (d ≥ 2) regular optical patterns
inferred← citeshttps://doi.org/10.26421/qic17.13-14-2openalex-snapshot
Efficient implementation of quantum circuits with limited qubit interactions
inferred← citeshttps://doi.org/10.3390/a14120342openalex-snapshot
An O(log2N) Fully-Balanced Resampling Algorithm for Particle Filters on Distributed Memory Architectures
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2024.11openalex-snapshot
Linear-Size Boolean Circuits for Multiselection
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1135openalex-snapshot
Sparse Suffix Tree Construction with Small Space
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00715openalex-snapshot
Distributed Selection in $O ( \log n )$ Time with $O ( n \log \log n )$ Messages
inferred← citeshttps://doi.org/10.48550/arxiv.1709.01008openalex-snapshot
Mix-ORAM: Using delegate shuffles
inferred← citeshttps://doi.org/10.48550/arxiv.1712.07882openalex-snapshot
The Pyramid Scheme: Oblivious RAM for Trusted Processors
inferred← citeshttps://doi.org/10.48550/arxiv.1911.00586openalex-snapshot
CNF Encodings of Cardinality Constraints Based on Comparator Networks
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/1487713.1487716openalex-snapshot
Implementing Sorting Networks with Spiking Neural P Systems
inferred← citeshttps://doi.org/10.5555/1873601.1873702openalex-snapshot
Randomized Shellsort: a simple oblivious sorting algorithm
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.