The computability of relaxed data structures: queues and stacks as examples.
- Published in:
- Distributed Computing, 2016, v. 29, n. 5, p. 395, doi. 10.1007/s00446-016-0272-0
- By:
- Publication type:
- Article
Works matching IS 01782770 AND DT 2016 AND VI 29 AND IP 5
Results: 5
1
2
Randomized mutual exclusion on a multiple access channel.
- Published in:
- Distributed Computing, 2016, v. 29, n. 5, p. 341, doi. 10.1007/s00446-016-0265-z
- By:
- Publication type:
- Article
3
Distributed algorithms for barrier coverage using relocatable sensors.
- Published in:
- Distributed Computing, 2016, v. 29, n. 5, p. 361, doi. 10.1007/s00446-016-0267-x
- By:
- Publication type:
- Article
4
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring.
- Published in:
- Distributed Computing, 2016, v. 29, n. 5, p. 377, doi. 10.1007/s00446-016-0269-8
- By:
- Publication type:
- Article
5
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems.
- Published in:
- Distributed Computing, 2016, v. 29, n. 5, p. 317, doi. 10.1007/s00446-016-0264-0
- By:
- Publication type:
- Article