On the public citation graph
On Fault-Tolerant Networks for Sorting
0 signed · 69 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/0016-0032(56)90044-8openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1016/0016-0032(56)90559-2openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1016/0022-0000(80)90014-8openalex-snapshot
Coping with errors in binary search procedures
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/321958.321976openalex-snapshot
Lower Bounds on Merging Networks
inferredcites →https://doi.org/10.1515/9781400882618-003openalex-snapshot
Probabilistic Logics and the Synthesis of Reliable Organisms From Unreliable Components
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471238961.0112110119011211.a01openalex-snapshot
Batteries, Alkaline Secondary Cells
inferred← citeshttps://doi.org/10.1006/jcss.1997.1470openalex-snapshot
Breaking theΘ(nlog2n) Barrier for Sorting with Faults
inferred← citeshttps://doi.org/10.1007/11561071_1openalex-snapshot
Designing Reliable Algorithms in Unreliable Memories
inferred← citeshttps://doi.org/10.1007/11841036_68openalex-snapshot
The Price of Resiliency: A Case Study on Sorting with Memory Faults
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_45openalex-snapshot
Fibonacci Correction Networks
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_77openalex-snapshot
Reliable minimum finding comparator networks
inferred← citeshttps://doi.org/10.1007/978-1-4615-4549-1_12openalex-snapshot
Tolerating Faults in Counting Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-53651-0_4openalex-snapshot
Reliability of Two-Terminal Networks Equivalent to Small Optimal Sorting Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-73117-9_36openalex-snapshot
Inversions from Sorting with Distance-Based Errors
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_24openalex-snapshot
Lower Bounds on Correction Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_32openalex-snapshot
Optimal Resilient Dynamic Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_5openalex-snapshot
Sorting and Selection with Imprecise Comparisons
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_22openalex-snapshot
Error-Correcting Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_3openalex-snapshot
Resilient Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_1openalex-snapshot
Experimental Study of Resilient Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_34openalex-snapshot
Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-642-41527-2_14openalex-snapshot
Gossip Protocols for Renaming and Sorting
inferred← citeshttps://doi.org/10.1007/bfb0039597openalex-snapshot
On selecting the largest element in spite of erroneous information
inferred← citeshttps://doi.org/10.1007/bfb0040411openalex-snapshot
A correction network for N-sorters
inferred← citeshttps://doi.org/10.1007/s00453-007-9088-4openalex-snapshot
Sorting and Searching in Faulty Memories
inferred← citeshttps://doi.org/10.1007/s00453-008-9264-1openalex-snapshot
The Price of Resiliency: a Case Study on Sorting with Memory Faults
inferred← citeshttps://doi.org/10.1007/s00453-015-0073-zopenalex-snapshot
Resilient Dynamic Programming
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90203-8openalex-snapshot
On sorting in the presence of erroneous information
inferred← citeshttps://doi.org/10.1016/j.cosrev.2007.10.001openalex-snapshot
Designing reliable algorithms in unreliable memories
inferred← citeshttps://doi.org/10.1016/j.dam.2011.05.010openalex-snapshot
Recursive merge sort with erroneous comparisons
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.026openalex-snapshot
Optimal resilient sorting and searching in the presence of memory faults
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00303-6openalex-snapshot
Searching games with errors—fifty years of coping with liars
inferred← citeshttps://doi.org/10.1038/s41598-017-14876-xopenalex-snapshot
Microscopy as a statistical, Rényi-Ulam, half-lie game: a new heuristic search strategy to accelerate imaging
inferred← citeshttps://doi.org/10.1109/12.293261openalex-snapshot
Fault tolerance in a class of sorting networks
inferred← citeshttps://doi.org/10.1109/12.83656openalex-snapshot
Coping with erroneous information while sorting
inferred← citeshttps://doi.org/10.1109/ahs.2009.24openalex-snapshot
Evolutionary Algorithms in Unreliable Memory
inferred← citeshttps://doi.org/10.1109/dftvs.1993.595609openalex-snapshot
Fault-tolerant sorting using VLSI processor arrays
inferred← citeshttps://doi.org/10.1109/focs.2012.69openalex-snapshot
Formulas Resilient to Short-Circuit Errors
inferred← citeshttps://doi.org/10.1109/fscs.1990.89546openalex-snapshot
Fault tolerant sorting network
inferred← citeshttps://doi.org/10.1109/ftcs.1990.89398openalex-snapshot
Concurrent error detection and correction in real-time systolic sorting arrays
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627328openalex-snapshot
Designing concurrent checking sorting networks
inferred← citeshttps://doi.org/10.1109/nano47656.2020.9183395openalex-snapshot
Employing Sorting Nets for Designing Reliable Computing Nets
inferred← citeshttps://doi.org/10.1109/pacrim.1997.620414openalex-snapshot
Testing and fault tolerance properties in a class of sorting networks
inferred← citeshttps://doi.org/10.1109/pacrim.1999.799500openalex-snapshot
Fault tolerance analysis of odd-even transposition sorting networks
inferred← citeshttps://doi.org/10.1109/pacrim.2003.1235750openalex-snapshot
Fault tolerance analysis of odd-even transposition sorting networks with single pass and multiple passes
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/tnano.2021.3113731openalex-snapshot
Four Input Sorter Good, Larger Ones Not So Good
inferred← citeshttps://doi.org/10.1137/s0097539791195877openalex-snapshot
Computing with Noisy Information
inferred← citeshttps://doi.org/10.1137/s0097539796305298openalex-snapshot
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
inferred← citeshttps://doi.org/10.1137/s0097539799354308openalex-snapshot
Depth Optimal Sorting Networks Resistant to k Passive Faults
inferred← citeshttps://doi.org/10.1145/100216.100230openalex-snapshot
Computing with unreliable information
inferred← citeshttps://doi.org/10.1145/1007352.1007375openalex-snapshot
Sorting and searching in the presence of memory faults (without redundancy)
inferred← citeshttps://doi.org/10.1145/165231.165235openalex-snapshot
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults
inferred← citeshttps://doi.org/10.1145/2187836.2187969openalex-snapshot
Max algorithms in crowdsourcing environments
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/2444016.2444022openalex-snapshot
Data structures resilient to memory faults
inferred← citeshttps://doi.org/10.1145/2701427openalex-snapshot
Sorting and Selection with Imprecise Comparisons
inferred← citeshttps://doi.org/10.1145/2723372.2723722openalex-snapshot
The Importance of Being Expert
inferred← citeshttps://doi.org/10.1145/3558481.3591093openalex-snapshot
Optimal Parallel Sorting with Comparison Errors
inferred← citeshttps://doi.org/10.1145/378580.378697openalex-snapshot
Periodic, random-fault-tolerant correction networks
inferred← citeshttps://doi.org/10.1145/986537.986591openalex-snapshot
Deterministic Majority filters applied to stochastic sorting
inferred← citeshttps://doi.org/10.3233/fi-2000-423402openalex-snapshot
Reliable Minimum Finding Comparator Networks
inferred← citeshttps://doi.org/10.48550/arxiv.0902.3176openalex-snapshot
Error-Correcting Tournaments
inferred← citeshttps://doi.org/10.5555/313852.314070openalex-snapshot
Depth optimal sorting networks resistant to k passive faults
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.