The following pages link to Dynamo (Q39211):
Displayed 17 items.
- Maximum weight matching with hysteresis in overloaded queues with setups (Q285966) (← links)
- Merging ring-structured overlay indices: toward network-data transparency (Q455944) (← links)
- Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward (Q475108) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Scalable eventually consistent counters over unreliable networks (Q1733394) (← links)
- The weakest failure detector for eventual consistency (Q2010607) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- Generalized Paxos made Byzantine (and less complex) (Q2633262) (← links)
- Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks (Q3075530) (← links)
- Enabling Compressed Encryption for Cloud Based Big Data Stores (Q3297626) (← links)
- (Q3300825) (← links)
- (Q3300830) (← links)
- A datalog-based computational model for coordination-free, data-parallel systems (Q4559834) (← links)
- Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
- (Q5009605) (← links)
- Multiparty testing preorders (Q5060196) (← links)
- Quantile Markov Decision Processes (Q5095150) (← links)