Pages that link to "Item:Q2796276"

The following pages link to Computing weak consistency in polynomial time (extended abstract) (Q2796276):

Displaying 8 items.

• Probabilistic weak simulation is decidable in polynomial time (Q1029062) (← links)
• Analyzing linearizability violations in the presence of read-modify-write operations (Q1653043) (← links)
• Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
• Efficient algorithms for checking the atomicity of a run of read and write operations (Q1892712) (← links)
• A quasi-lower bound on the consistency strength of PFA (Q3190409) (← links)
• Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
• A much better polynomial time approximation of consistency in the LR calculus (Q5392506) (← links)
• Languages and Compilers for Parallel Computing (Q5714203) (← links)