Found: 9
Select item for more details and to access through your institution.
Special issue on NETYS selected papers.
- Published in:
- 2015
- By:
- Publication type:
- Editorial
Byzantine consensus is Θ(n2): the Dolev-Reischuk bound is tight even in partial synchrony!
- Published in:
- Distributed Computing, 2024, v. 37, n. 2, p. 89, doi. 10.1007/s00446-023-00458-w
- By:
- Publication type:
- Article
Cross-chain payment protocols with success guarantees.
- Published in:
- Distributed Computing, 2023, v. 36, n. 2, p. 137, doi. 10.1007/s00446-023-00446-0
- By:
- Publication type:
- Article
TM2C: a software transactional memory for many-cores.
- Published in:
- Distributed Computing, 2018, v. 31, n. 5, p. 367, doi. 10.1007/s00446-017-0310-6
- By:
- Publication type:
- Article
ComChain: A blockchain with Byzantine fault‐tolerant reconfiguration.
- Published in:
- Concurrency & Computation: Practice & Experience, 2020, v. 32, n. 12, p. 1, doi. 10.1002/cpe.5494
- By:
- Publication type:
- Article
A speculation‐friendly binary search tree.
- Published in:
- Concurrency & Computation: Practice & Experience, 2019, v. 31, n. 4, p. N.PAG, doi. 10.1002/cpe.4883
- By:
- Publication type:
- Article
A skip list for multicore.
- Published in:
- Concurrency & Computation: Practice & Experience, 2017, v. 29, n. 4, p. n/a, doi. 10.1002/cpe.3876
- By:
- Publication type:
- Article
A Fast Contention-Friendly Binary Search Tree.
- Published in:
- Parallel Processing Letters, 2016, v. 26, n. 3, p. -1, doi. 10.1142/S0129626416500158
- By:
- Publication type:
- Article
ON THE INPUT ACCEPTANCE OF TRANSACTIONAL MEMORY.
- Published in:
- Parallel Processing Letters, 2010, v. 20, n. 1, p. 31, doi. 10.1142/S0129626410000041
- By:
- Publication type:
- Article