On the public citation graph

Counting networks with arbitrary fan-out

https://doi.org/10.1007/bf02242734
0 signed · 63 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/3-540-57271-6_39openalex-snapshot
Notes on sorting and counting networks (extended abstract)
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1080/00988157.1991.9977916openalex-snapshot
Disintegrating rural development
inferredcites →https://doi.org/10.1109/71.80120openalex-snapshot
The performance of spin lock alternatives for shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/sfcs.1991.185415openalex-snapshot
Low contention linearizable counting
inferredcites →https://doi.org/10.1145/103418.103421openalex-snapshot
Counting networks and multi-processor coordination
inferredcites →https://doi.org/10.1145/129712.129752openalex-snapshot
Small-depth counting networks
inferredcites →https://doi.org/10.1145/140901.140924openalex-snapshot
Low contention load balancing on large-scale multiprocessors
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1145/164051.164079openalex-snapshot
A lower bound on wait-free counting
inferredcites →https://doi.org/10.1145/185675.185815openalex-snapshot
Counting networks
inferredcites →https://doi.org/10.1145/197917.198092openalex-snapshot
A combinatorial treatment of balancing networks
inferredcites →https://doi.org/10.1145/235666.235671openalex-snapshot
Distributed computing column
inferredcites →https://doi.org/10.1145/76359.76362openalex-snapshot
The periodic balanced sorting network
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.1996.0837openalex-snapshot
A Lower Bound on Wait-Free Counting
inferred← citeshttps://doi.org/10.1006/jcss.1996.0049openalex-snapshot
Concurrent Counting
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_79openalex-snapshot
A Combinatorial Characterization of Properties Preserved by Antitokens
inferred← citeshttps://doi.org/10.1007/3-540-45414-4_23openalex-snapshot
Adding Networks
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_37openalex-snapshot
Supporting Increment and Decrement Operations in Balancing Networks
inferred← citeshttps://doi.org/10.1007/3-540-57271-6_39openalex-snapshot
Notes on sorting and counting networks (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-74466-5_86openalex-snapshot
Periodic Load Balancing on the N-Cycle: Analytical and Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/bf02242714openalex-snapshot
Atomic snapshots using lattice agreement
inferred← citeshttps://doi.org/10.1007/s00224-001-1027-1openalex-snapshot
Sorting and Counting Networks of Arbitrary Width and Small Depth
inferred← citeshttps://doi.org/10.1007/s002240000072openalex-snapshot
Elimination Trees and the Construction of Pools and Stacks
inferred← citeshttps://doi.org/10.1007/s00446-003-0097-5openalex-snapshot
Read-modify-write networks
inferred← citeshttps://doi.org/10.1007/s00446-008-0066-0openalex-snapshot
Sequentially consistent versus linearizable counting networks
inferred← citeshttps://doi.org/10.1007/s00446-009-0087-3openalex-snapshot
The impact of randomization in smoothing networks
inferred← citeshttps://doi.org/10.1007/s004460050019openalex-snapshot
Linearizable counting networks
inferred← citeshttps://doi.org/10.1016/j.jpdc.2007.01.004openalex-snapshot
Recursive construction of parallel distribution networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.023openalex-snapshot
An efficient counting network
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00096-3openalex-snapshot
Impossibility results for weak threshold networks
inferred← citeshttps://doi.org/10.1016/s0020-0255(96)00175-2openalex-snapshot
Balancing networks: State of the art
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00113-xopenalex-snapshot
Threshold counters with increments and decrements
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00312-7openalex-snapshot
Public data structures: counters as a special case
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00237-0openalex-snapshot
Timing conditions for linearizability in uniform counting networks
inferred← citeshttps://doi.org/10.1109/icdcs.2003.1203446openalex-snapshot
Self-stabilizing smoothing and counting
inferred← citeshttps://doi.org/10.1109/ipps.1997.580978openalex-snapshot
The impact of timing on linearizability in counting networks
inferred← citeshttps://doi.org/10.1109/ipps.1998.669944openalex-snapshot
An efficient counting network
inferred← citeshttps://doi.org/10.1109/istcs.1995.377040openalex-snapshot
Dynamic counting
inferred← citeshttps://doi.org/10.1109/istcs.1995.377041openalex-snapshot
Public data structures: counters as a special case
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185415openalex-snapshot
Low contention linearizable counting
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743520openalex-snapshot
Local divergence of Markov chains and the analysis of iterative load-balancing schemes
inferred← citeshttps://doi.org/10.1142/9789812562494_0017openalex-snapshot
A COMBINATORIAL CHARACTERIZATION OF PROPERTIES PRESERVED BY ANTITOKENS
inferred← citeshttps://doi.org/10.1145/129712.129752openalex-snapshot
Small-depth counting networks
inferred← citeshttps://doi.org/10.1145/1400751.1400797openalex-snapshot
The impact of randomization in smoothing networks
inferred← citeshttps://doi.org/10.1145/140901.140924openalex-snapshot
Low contention load balancing on large-scale multiprocessors
inferred← citeshttps://doi.org/10.1145/1583991.1584043openalex-snapshot
A randomized, o(log w)-depth 2 smoothing network
inferred← citeshttps://doi.org/10.1145/164051.164079openalex-snapshot
A lower bound on wait-free counting
inferred← citeshttps://doi.org/10.1145/167088.167145openalex-snapshot
Contention in shared memory algorithms
inferred← citeshttps://doi.org/10.1145/185675.185815openalex-snapshot
Counting networks
inferred← citeshttps://doi.org/10.1145/197917.197950openalex-snapshot
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
inferred← citeshttps://doi.org/10.1145/197917.198090openalex-snapshot
Coins, weights and contention in balancing networks
inferred← citeshttps://doi.org/10.1145/197917.198092openalex-snapshot
A combinatorial treatment of balancing networks
inferred← citeshttps://doi.org/10.1145/197917.198192openalex-snapshot
Contention in counting networks
inferred← citeshttps://doi.org/10.1145/234752.234754openalex-snapshot
A combinatorial treatment of balancing networks
inferred← citeshttps://doi.org/10.1145/235543.235546openalex-snapshot
Diffracting trees
inferred← citeshttps://doi.org/10.1145/248052.248111openalex-snapshot
Counting networks are practically linearizable
inferred← citeshttps://doi.org/10.1145/268999.269000openalex-snapshot
Contention in shared memory algorithms
inferred← citeshttps://doi.org/10.1145/277697.277705openalex-snapshot
Contention in balancing networks resolved (extended abstract)
inferred← citeshttps://doi.org/10.1145/301308.301342openalex-snapshot
Sequentially consistent versus linearizable counting networks
inferred← citeshttps://doi.org/10.1145/305619.305627openalex-snapshot
Sorting and counting networks of small depth and arbitrary width
inferred← citeshttps://doi.org/10.1201/9781315119335-48openalex-snapshot
Concurrent Data Structures
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.