The following pages link to Counting networks (Q4323733):
Displaying 26 items.
- Impossibility results for weak threshold networks (Q287142) (← links)
- Concurrent counting is harder than queuing (Q604464) (← links)
- An efficient counting network (Q986532) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- Scalable eventually consistent counters over unreliable networks (Q1733394) (← links)
- The cost of concurrent, low-contention Read \& Modify \& Write (Q1770373) (← links)
- Public data structures: counters as a special case. (Q1853535) (← links)
- Concurrent correctness in vector space (Q2234067) (← links)
- Self-stabilizing smoothing and balancing networks (Q2375300) (← links)
- Solo-valency and the cost of coordination (Q2377250) (← links)
- Bounded-wait combining: constructing robust and high-throughput shared objects (Q2377268) (← links)
- Quantized consensus (Q2641788) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- Counting networks with arbitrary fan-out (Q5136991) (← links)
- Linearizable counting networks (Q5137016) (← links)
- Software transactional memory (Q5137331) (← links)
- Read-modify-write networks (Q5138502) (← links)
- Smoothed analysis of balancing networks (Q5198673) (← links)
- A Framework for Correctness Criteria on Weak Memory Models (Q5206951) (← links)
- A simple approach for adapting continuous load balancing processes to discrete settings (Q5890706) (← links)
- The impact of randomization in smoothing networks (Q5901191) (← links)
- Sequentially consistent versus linearizable counting networks (Q5919901) (← links)
- Threshold counters with increments and decrements (Q5958332) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)
- Quantifiability: a concurrent correctness condition modeled in vector space (Q6161035) (← links)
