Elastic Transactions
From MaRDI portal
Recommendations
Cited in
(43)- Deleting completed transactions
- \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores
- Last-use opacity: a strong safety property for transactional memory with prerelease support
- Über Integrale auf konvexen Körpern. I, II
- Using abstract interpretation to correct synchronization faults
- The multiplicative power of consensus numbers
- The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
- On asymmetric progress conditions
- Verifying linearizability with hindsight
- Eventually linearizable shared objects
- The topology of shared-memory adversaries
- Adaptive randomized mutual exclusion in sub-logarithmic expected time
- Distributed data classification in sensor networks
- Partial information spreading with application to distributed maximum coverage
- Efficient threshold detection in a distributed environment (extended abstract)
- Forbidden-set distance labels for graphs of bounded doubling dimension
- Efficient distributed random walks with applications
- On the theoretical gap between synchronous and asynchronous MPC protocols
- Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
- Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip}
- A new technique for distributed symmetry breaking
- On the computational power of oblivious robots
- Finding mobile data under delay constraints with searching costs
- On utilizing speed in networks of mobile agents
- Expansion and the cover time of parallel random walks
- Rapid randomized pruning for fast greedy distributed algorithms
- Broadcasting in unreliable radio networks
- Discrete load balancing is (almost) as easy as continuous load balancing
- Locating a target with an agent guided by unreliable local advice, how to beat the random walk when you have a clock?
- Distributed algorithms for \textsc{Edge Dominating Sets}
- Fast flooding over Manhattan
- Bayesian ignorance
- Deterministic distributed vertex coloring in polylogarithmic time
- Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
- Optimal gradient clock synchronization in dynamic networks
- Online set packing and competitive scheduling of multi-part tasks
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- Constant RMR solutions to reader writer synchronization
- A verified durable transactional mutex lock for persistent x86-TSO
- Transactional memory
- Extensible transactional memory testbed
- Proving opacity of transactional memory with early release
This page was built for publication: Elastic Transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3646218)
